Related papers: Geometrical sets with forbidden configurations
It is known that if the underlying iterated function system satisfies the open set condition, then the upper box dimension of an inhomogeneous self-similar set is the maximum of the upper box dimensions of the homogeneous counterpart and…
The quantum mechanical definition of probability, the uncertainty principle and Poincare invariance provide strong basic restrictions on the ability to define spatial densities associated with form factors describing the properties of…
Persistence diagrams are objects that play a central role in topological data analysis. In the present article, we investigate the local and global geometric properties of spaces of persistence diagrams. In order to do this, we construct a…
We present an explicit geometric construction of a large parametrized family of graphs with no $k$-cliques and with bounded independence number, generalizing the triangle-free Ramsey graphs of Codenotti, Pudl\'ak, and Resta and revisiting…
We consider the problem of bounding large deviations for non-i.i.d. random variables that are allowed to have arbitrary dependencies. Previous works typically assumed a specific dependence structure, namely the existence of independent…
We consider the problem of recovering conditional independence relationships between $p$ jointly distributed Hilbertian random elements given $n$ realizations thereof. We operate in the sparse high-dimensional regime, where $n \ll p$ and no…
We investigate the deposition of binary mixtures of oriented superdisks on a plane. Superdisks are chosen as objects bounded by $|x|^{2p}+|y|^{2p}=1$, where parameter $p$ controls their size and shape. For single-type superdisks, the…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed; the former ad hoc proof of this…
Bead packs of up to 150,000 mono-sized spheres with packing densities ranging from 0.58 to 0.64 have been studied by means of X-ray Computed Tomography. These studies represent the largest and the most accurate description of the structure…
Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…
Let $\sigma$ be a non-atomic, infinite Radon measure on $\mathbb R^d$, for example, $d\sigma(x)=z\,dx$ where $z>0$. We consider a system of freely independent particles $x_1,\dots,x_N$ in a bounded set $\Lambda\subset\mathbb R^d$, where…
We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…
We study 1-parameter families in the space $\mathscr{M}^G_1$ of $G$-invariant, unit volume metrics on a given compact, connected, almost-effective homogeneous space $M=G/H$. In particular, we focus on diverging sequences, i.e. which are not…
Predicting segregation of granular materials composed of different-sized particles is a challenging problem. In this paper, we develop and implement a theoretical model that captures the interplay between advection, segregation, and…
We study a one-dimensional gas of $N$ Brownian particles that diffuse independently but are simultaneously reset whenever any of them reaches a fixed threshold located at $L > 0$. For any $N > 2$, the system reaches a non-equilibrium…
A classical theorem of Erdos, Lovasz and Spencer asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permutations and we then apply the methods used in the proof to…
We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational…
Following our earlier work, we construct statistical discrete geometry by applying statistical mechanics to discrete (Regge) gravity. We propose a coarse-graining method for discrete geometry under the assumptions of atomism and background…