Related papers: Fast repetitivity in non-rectifiable Delone sets
We consider the non-parametric maximum likelihood estimation in the class of Polya frequency functions of order two, viz. the densities with a concave logarithm. This is a subclass of unimodal densities and fairly rich in general. The NPMLE…
We consider iterated function systems on the interval with random perturbation. Let $Y_\epsilon$ be uniformly distributed in $[1- \epsilon, 1 + \epsilon]$ and let $f_i \in C^{1+\alpha}$ be contractions with fixpoints $a_i$. We consider the…
In this short note we give a construction of an infinite series of Delone simplices whose relative volume grows super-exponentially with their dimension. This dramatically improves the previous best lower bound, which was linear.
Let $p_0,\ldots,p_n$ be a finite sequence of points in an Euclidean space $\R^d$. Suppose that there is a (pointlike) particle sitting at each point $p_i$. In a ``legal'' move, any one of them can jump over another, landing on the other…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
It is well known that in $n$-dimensional Euclidean space ($n\geq 2$) the classes of (diametrically) complete sets and of bodies of constant width coincide. Due to this, they both form a proper subfamily of the class of reduced bodies. For…
We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…
We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…
The paper elucidates the relationship between the density of a Banach space and possible sizes of well-separated subsets of its unit sphere. For example, it is proved that for a large enough space $X$, the unit sphere $S_X$ always contains…
In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and…
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
We describe a unified and computationally tractable framework for finding outliers in, and maximum-diversity subsets of, finite metric spaces of strict negative type. Examples of such spaces include finite subsets of Euclidean space and…
If $g$ is a map from a space $X$ into $\mathbb R^m$ and $z\not\in g(X)$, let $P_{2,1,m}(g,z)$ be the set of all lines $\Pi^1\subset\mathbb R^m$ containing $z$ such that $|g^{-1}(\Pi^1)|\geq 2$. We prove that for any $n$-dimensional metric…
We prove that in a Euclidean space of dimension at least two, there exists a compact set of Lebesgue measure zero such that any real-valued Lipschitz function defined on the space is differentiable at some point in the set. Such a set is…
Convergence rates of kernel density estimators for stationary time series are well studied. For invertible linear processes, we construct a new density estimator that converges, in the supremum norm, at the better, parametric, rate…
In this note we present that the patch counting entropy can be obtained as a limit and investigate which sequences of compact sets are suitable to define this quantity. We furthermore present a geometric definition of patch counting entropy…
Answering one problem that has its origins in quantum mechanics, we prove that for any sequence $(A_n)_{n\in\mathbb N}$ of convex nowhere dense sets in a Banach space $X$ and any sequence $(\varepsilon_n)_{n=1}^\infty$ of positive real…
We study the problem of universal decoding for unknown discrete memoryless channels in the presence of erasure/list option at the decoder, in the random coding regime. Specifically, we harness a universal version of Forney's classical…
The variational capacity cap_p in Euclidean spaces is known to enjoy the density dichotomy at large scales, namely that for every subset E of R^n, inf_{x in R^n} (cap_p(E \cap B(x,r),B(x,2r)) / cap_p(B(x,r),B(x,2r))) is either zero or tends…
Motivated by the study of a certain family of classical geometric problems we investigate the existence of multiplicative connections on proper Lie groupoids. We show that one can always deform a given connection which is only approximately…