Related papers: Notions of denseness
Differential completions and compactifications of differential spaces are introduced and investigated. The existence of the maximal differential completion and the maximal differential compactification is proved. A sufficient condition for…
We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices)…
Condensed mathematics, developed by Clausen and Scholze over the last few years, proposes a generalization of topology with better categorical properties. It replaces the concept of a topological space by that of a condensed set, which can…
The problem of covering random points in a plane with sets of a given shape has several practical applications in communications and operations research. One especially prominent application is the coverage of randomly-located points of…
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…
Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in $2$-dimensions goes back to the work of Gauss. In this paper, we focus on…
Dicke superradiance describes an ensemble of $N$ permutationally invariant two-level systems collectively emitting radiation with a peak radiated intensity scaling as $N^2$. Although individual Dicke states are typically entangled, the…
The past several years have witnessed a surge of research investigating various aspects of sparse representations and compressed sensing. Most of this work has focused on the finite-dimensional setting in which the goal is to decompose a…
In this paper, we introduce new concepts of domination and packing functions in graphs, which generalize, respectively, the labelled dominating and packing functions defined by Lee and Chang in 2008, and Hinrichsen et al. in 2019. These…
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we study strict subsets, i.e. sets whose variational capacity with respect to a larger reference set is finite, in the case $p=1$.…
Using transversality and a dimension reduction argument, a result of A. Bezdek and W. Kuperberg is applied to polycylinders $\mathbb{D}^2\times \mathbb{R}^n$, showing that the optimal packing density is $\pi/\sqrt{12}$ in any dimension.
A topological space is iso-dense if it has a dense set of isolated points. A topological space is scattered if each of its non-empty subspaces has an isolated point. In $\mathbf{ZF}$, in the absence of the axiom of choice, basic properties…
We investigate the existence of random close and random loose packing limits in two-dimensional packings of monodisperse hard disks. A statistical mechanics approach-- based on several approximations to predict the probability distribution…
We call a periodic ball packing in d-dimensional Euclidean space periodically (strictly) jammed with respect to a period lattice if there are no nontrivial motions of the balls that preserve the period (that maintain some period with…
A domino covering of a board is saturated if no domino is redundant. We introduce the concept of a fragment tiling and show that a minimal fragment tiling always corresponds to a maximal saturated domino covering. The size of a minimal…
We analyze a macroscopic model with a maximal density constraint which describes short range repulsion in biological systems. This system aims at modeling finite-size particles which cannot overlap and repel each other when they are too…
We consider the space of real-valued continuously differentiable functions on a compact subset of a euclidean space. We characterize the completeness of this space and prove that the space of restrictions of continuously differentiable…
Given a digraph $D=(V,A)$, a set $B\subset V$ is a packing set in $D$ if there are no arcs joining vertices of $B$ and for any two vertices $x,y\in B$ the sets of in-neighbors of $x$ and $y$ are disjoint. The set $S$ is a dominating set (an…
We study quasi-modular pseudometric spaces as asymmetric refinements of modular metric structures. To each such space we associate canonical forward and backward quasi-uniformities and the corresponding directional topologies. We introduce…
We consider the collection of uniformly discrete point sets in Euclidean space equipped with the vague topology. For a point set in this collection, we characterise minimality of an associated dynamical system by almost repetitivity of the…