Related papers: A Statistical Characterization of Regular Simplice…

We show that intersection graphs of compact convex sets in R^n of bounded aspect ratio have asymptotic dimension at most 2n+1. More generally, we show this is the case for intersection graphs of systems of subsets of any metric space of…

We prove that whenever the selfmapping $(M_1,\dots,M_p)\colon I^p \to I^p$, ($p \in \mathbb{N}$ and $M_i$-s are $p$-variable means on the interval $I$) is invariant with respect to some continuous and strictly monotone mean $K \colon I^p…

It is well-known that a paracompact space $X$ is of covering dimension at most $n$ if and only if any map $f\colon X\to K$ from $X$ to a simplicial complex $K$ can be pushed into its $n$-skeleton $K^{(n)}$. We use the same idea to…

We show that there is no simple congruence formula for the number of points of the mod p reduction of a regular model of a smooth proper variety defined over a local field with $\ell$-adic cohomology supported in codimension $\ge \kappa$.

Given a continuous function $f:[a,b]\to\mathbb{R}$ such that $f(a)=f(b)$, we investigate the set of distances $|x-y|$ where $f(x)=f(y)$. In particular, we show that the only distances this set must contain are ones which evenly divide…

Distance correlation is a recent extension of Pearson's correlation, that characterises general statistical independence between Euclidean-space-valued random variables, not only linear relations. This review delves into how and when…

We prove a sharp quantitative version of the $p$-Sobolev inequality for any $1<p<n$, with a control on the strongest possible distance from the class of optimal functions. Surprisingly, the sharp exponent is constant for $p<2$, while it…

Let $V$ be a set of $n$ points in $\mathbb{R}^d$, and suppose that the distance between each pair of points is revealed independently with probability $p$. We study when this information is sufficient to reconstruct large subsets of $V$, up…

Random probabilities are a key component to many nonparametric methods in Statistics and Machine Learning. To quantify comparisons between different laws of random probabilities several works are starting to use the elegant Wasserstein over…

Scaling-invariant functions preserve the order of points when the points are scaled by the same positive scalar (with respect to a unique reference point). Composites of strictly monotonic functions with positively homogeneous functions are…

Let (R,m) be an n-dimensional regular local ring, essentially of finite type over a field of characteristic zero. In this paper we study the relationship between the singularities of the scheme defined by an m-primary ideal I of R and the…

Upper bounds on the Kolmogorov distance (and, equivalently in this case, on the total variation distance) between the Student distribution with p degrees of freedom (SD_p) and the standard normal distribution are obtained. These bounds are…

Distance covariance is a measure of dependence between two random variables that take values in two, in general different, metric spaces, see Sz\'ekely, Rizzo and Bakirov (2007) and Lyons (2013). It is known that the distance covariance,…

Curious spectral properties of an ensemble of random unitary matrices appearing in the quantization of a map p -> p+alpha, q -> q+f(p+alpha) in [Giraud et al. nlin.CD/0403033] are investigated. When alpha=m/n with integer co-prime m,n and…

Let $\mathbf{X}_p=(\mathbf{s}_1,...,\mathbf{s}_n)=(X_{ij})_{p \times n}$ where $X_{ij}$'s are independent and identically distributed (i.i.d.) random variables with $EX_{11}=0,EX_{11}^2=1$ and $EX_{11}^4<\infty$. It is showed that the…

Let $K$ be an algebraically closed field. There has been much interest in characterizing multiple structures in $\P^n_K$ defined on a linear subspace of small codimension under additional assumptions (e.g. Cohen-Macaulay). We show that no…

Let $ n\geq 2, A=(a_{ij})_{i,j=1}^{n}$ be a real symmetric matrix, $a=(a_i)_{i=1}^{n}\in \Bbb R^n.$ Consider the differential operator $D_A = \sum_{i,j=1}^n a_{ij}{\partial^2 \over \partial x_i \partial x_j}+ \sum_{i=1}^n a_i{\partial \over…

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.

Successive differences on a sequence of data help to discover some smoothness features of this data. This was one of the main reasons for rewriting the classical interpolation formula in terms of such data differences. The aim of this paper…