Related papers: Geometrical sets with forbidden configurations

We prove that there exists a scrambled set for the Gauss map with full Hausdorff dimension. Meanwhile, we also investigate the topological properties of the sets of points with dense or non-dense orbits.

We consider a classically chaotic system that is described by a Hamiltonian H(Q,P;x), where (Q,P) describes a particle moving inside a cavity, and x controls a deformation of the boundary. The quantum-eigenstates of the system are |n(x)>.…

We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…

Denote by $m(G)$ the largest size of a minimal generating set of a finite group $G$. We estimate $m(G)$ in terms of $\sum_{p\in \pi(G)}d_p(G),$ where we are denoting by $d_p(G)$ the minimal number of generators of a Sylow $p$-subgroup of…

Let $F(x)=(f_1(x), \dots, f_m(x))$ be such that $1, f_1, \dots, f_m$ are linearly independent polynomials with real coefficients. Based on ideas of Bachoc, DeCorte, Oliveira and Vallentin in combination with estimating certain oscillatory…

Many natural notions of additive and multiplicative largeness arise from results in Ramsey theory. In this paper, we explain the relationships between these notions for subsets of $\mathbb{N}$ and in more general ring-theoretic structures.…

In repeated Measure Designs with multiple groups, the primary purpose is to compare different groups in various aspects. For several reasons, the number of measurements and therefore the dimension of the observation vectors can depend on…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

We study the size-topology relations in random packings of dry adhesive polydisperse microspheres with Gaussian and lognormal size distributions through a geometric tessellation. We find that the dependence of the neighbour number on the…

We report a numerical calculation of the total number of disordered jammed configurations $\Omega$ of $N$ repulsive, three-dimensional spheres in a fixed volume $V$. To make these calculations tractable, we increase the computational…

Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…

We study a higher-dimensional thin film equation that incorporates competitive effects between aggregation and repulsion, where repulsion is modeled by fourth-order diffusion and aggregation by backward second-order degenerate diffusion,…

Let $X$ be a product of locally compact rank one Hadamard spaces and $\Gamma$ a discrete group of isometries which contains two elements projecting to a pair of independent rank one isometries in each factor. In [arXiv:1308.5584] we gave a…

Given a weighted graph $G=(V,E,w)$, a partition of $V$ is $\Delta$-bounded if the diameter of each cluster is bounded by $\Delta$. A distribution over $\Delta$-bounded partitions is a $\beta$-padded decomposition if every ball of radius…

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…

We present classes of models in which particles are dropped on an arbitrary fixed finite connected graph, obeying adhesion rules with screening. We prove that there is an invariant distribution for the resulting height profile, and Gaussian…

Let $k,d $ be positive integers. We determine a sequence of constants that are asymptotic to the probability that the cluster at the origin in a $d$-dimensional Poisson Boolean model with balls of fixed radius is of order $k$, as the…

We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph…

Swarm and constellation reconfiguration can be viewed as motion of an unordered point configuration in an ambient space. Here, we provide persistence-stable, symmetry-invariant geometric representations for comparing and monitoring…

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…