Related papers: Geometrical sets with forbidden configurations
Particle models with finitely many types of particles are considered, both on $\mathbb{Z}^d$ and on discrete point sets of finite local complexity. Such sets include many standard examples of aperiodic order such as model sets or certain…
Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a…
Given finite sets $X_1,\dotsc,X_m$ in $\mathbb{R}^d$ (with $d$ fixed), we prove that there are respective subsets $Y_1,\dotsc,Y_m$ with $|Y_i|\ge \frac{1}{\operatorname{poly}(m)}|X_i|$ such that, for $y_1\in Y_1,\dotsc,y_m\in Y_m$, the…
Given a complete noncompact Riemannian manifold $N^n$, we investigate whether the set of bounded Sobolev maps $(W^{1, p} \cap L^\infty) (Q^m; N^n)$ on the cube $Q^m$ is strongly dense in the Sobolev space $W^{1, p} (Q^m; N^n)$ for $1 \le p…
In a series of papers with Kossakowski, the first author has examined properties of densities for which the positive partial transpositrionm (PPT) property can be readily checked. These densities were also investigated from a different…
Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…
In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…
The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…
We examine the reduced density matrix of the centre of mass on position basis considering a one-dimensional system of $N$ non-interacting distinguishable particles in a infinitely deep square potential well. We find a class of pure states…
This paper introduces a geometric mechanics framework for constrained systems on principal bundles through \emph{compatible pairs} $(\mathcal{D}, \lambda)$, addressing fundamental challenges in gauge-constrained physical systems. We…
Let $F_n$ be a free group of rank $n$, with free generating set $X$. A subset $D$ of $F_n$ is a \emph{Distinct Difference Configuration} if the differences $g^{-1}h$ are distinct, where $g$ and $h$ range over all (ordered) pairs of distinct…
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…
We present a parametrization of density matrices (mixed states) in a finite-dimensional Hilbert space $\mathbb{C}^n$, particularly suited to the description of their time evolution as open quantum systems governed by GKLS dynamics. A…
We study scaling limits of random permutations ("permutons") constrained by having fixed densities of a finite number of patterns. We show that the limit shapes are determined by maximizing entropy over permutons with those constraints. In…
Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…
Gromov asked what a typical (finitely presented) group looks like, and he suggested a way to make the question precise in terms of limiting density. The typical finitely generated group is known to share some important properties with the…
We discover unexpected connections between packing configurations and rare fluctuations in dense systems of active particles subject to pulsation of size. Using large deviation theory, we examine biased ensembles which select atypical…
In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs $(G_n)$. Let $\lambda_n$ be the largest eigenvalue of the adjacency matrix of $G_n$, and let $G_n(p_n)$ be the random subgraph of $G_n$ obtained…
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…
Recently, a combinatorial settlement planning model was introduced. The idea underlying the model is that the houses are randomly being built on a rectangular tract of land according to the specified rule until the maximal configuration is…