Related papers: Geometry and Arithmetic of Crystallographic Sphere…
In this note we introduce the notion of a transcendental group, that is, a subgroup $G$ of the topological group $\mathbb{C}$ of all complex numbers such that every element of $G$ except $ 0$ is a transcendental number. All such topological…
In this paper we define spherical complexes as simplicial complexes with the property that every subcomplex obtained by a sequence of links and deletions either has trivial homology, or has the homology of a sphere. Examples of such…
A hyperbolic reflection group is a discrete group generated by reflections in the faces of an $n$-dimensional hyperbolic polyhedron. This survey article is dedicated to the study of arithmetic hyperbolic reflection groups with an emphasis…
We study objects in triangulated categories which have a two-dimensional graded endomorphism algebra. Given such an object, we show that there is a unique maximal triangulated subcategory, in which the object is spherical. This general…
Recently, Balogh, Kostochka and Liu in [Packing chromatic number of cubic graphs, Discrete Math.~341 (2018) 474--483] answered in negative the question that was posed in several earlier papers whether the packing chromatic number is bounded…
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…
We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…
Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. Such packings can be described in terms of the Descartes configurations they contain. It observed…
We prove that every family of isospectral surfaces with discrete length spectrum arising from Sunada's method is finite. Furthermore, by introducing the topological notion of surfaces with self-duplicating ends, we show that every finite…
A one parameter set of noncommutative complex algebras is given. These may be considered deformation quantisation algebras. The commutative limit of these algebras correspond to the algebra of polynomial functions over a manifold or…
We introduce the bounded packing property for a subgroup of a countable discrete group G. This property gives a finite upper bound on the number of left cosets of the subgroup that are pairwise close in G. We establish basic properties of…
Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…
We show that any infinite-type surface without planar ends admits arbitrarily large families of length isospectral hyperbolic structures. If the surface has infinite genus and its space of ends is self-similar, we construct an uncountable…
The fractal dimension of large-scale galaxy clustering has been demonstrated to be roughly $D_F \sim 2$ from a wide range of redshift surveys. If correct, this statistic is of interest for two main reasons: fractal scaling is an implicit…
If the n-dimensional unit sphere is covered by finitely many spherically convex bodies, then the sum of the inradii of these bodies is at least {\pi}. This bound is sharp, and the equality case is characterized.
Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…
We show the existence of generalized clusters of a finite or even infinite number of sets, with minimal total perimeter and given total masses, in metric measure spaces homogeneous with respect to a group acting by measure preserving…
We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…
A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…
Spiral Galaxies is a pencil-and-paper puzzle played on a grid of unit squares: given a set of points called centers, the goal is to partition the grid into polyominoes such that each polyomino contains exactly one center and is 180{\deg}…