We show that any subgroup of a (virtually) nilpotent-by-polycyclic group satisfies the bounded packing property of Hruska-Wise. In particular, the same is true about metabelian groups and linear solvable groups. However, we find an example of a finitely generated solvable group of derived length 3 which admits a finite…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “bounded packing property”
A game of packingsmath.MG
Study generates infinite circle packings with a specific property.
problem Generating infinite circle packings with a unique property.
method Investigates an infinite family of circle packings and uses them to create Apollonian packings.
result Created an infinite set of circle packings with the Apollonian property.
The main result of this paper is that given a group acting geometrically by isometries on a CAT(0) space and a cyclic subgroup of generated by a rank-1 isometry of , has bounded packing in . We give two proofs of this result. The first one is by a characterization of rank- isometries by Ham…
On Freedman's link packingsmath.GT
Recently, Freedman [arXiv:2301.00295] introduced the idea of packing a maximal number of links into a bounded region subject to geometric constraints, and produced upper bounds on the packing number in some cases, while commenting that these bounds seemed far too large. We show that the smallest of these "extravagantly…
Analyzes packing of circles in bounded and unbounded planes using mathematical formulas.
problem Finding optimal radii for packing circles in various plane regions.
method Deterministic analytic formulae and recurrence relations.
result Formulated analytic formulae for 2D circle packing on various plane shapes.
The traditional Riemann Mapping Theorem can be proved with circle packing techniques. We prove the Combinatorial Riemann Mapping Theorem for tilings of bounded size using circle packings.
The paper connects Apollonian packings to knot theory and improves link representations.
problem Realizing algebraic links in Apollonian packings.
method Introducing new representations of links in tangency graphs of sphere packings, proving link realizability, and improving upper bounds.
result Any algebraic link can be realized in the cubic section of the orthoplicial Apollonian packing.
The Tits alternative applies to groups acting on specific CAT(0) spaces.
problem Understanding the structure of groups acting on CAT(0) spaces.
method Proving the Tits alternative for groups acting on visibility CAT(0) spaces with bounded packing property.
result Groups either almost nilpotent or contain a free nonabelian subgroup of rank 2.
The paper studies circle packings using renormalization and subdivision rules.
problem Characterizing and proving properties of circle packings with specific subdivision rules.
method Iterations of skinning maps on Teichmüller spaces, renormalization theory, subdivision rules.
result Uniformly contracting renormalization operator and geometric inflexibility of circle packings.
Packing Meets Topologymath.GT
Study on packing links with geometric constraints.
problem Maximizing link density in space with geometric restrictions.
method Investigates packing essential links within Euclidean space.
result Upper bounds on maximal density are found, but are large.
We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of quasimorphisms on hyperbolically embedded subgroups that can be to simultaneously extended to…
We propose a new approach to the value distribution theory of entire holomorphic curves. We define a ``packing density'' of an entire holomorphic curve, and show that it has various non-trivial properties. We prove a ``gap theorem'' for holomorphic maps from elliptic curves to the complex projective space, and study th…
For any given natural number , this paper gives upper bounds on the radius of a packing of a complete hyperbolic surface of finite area by equal-radius disks in terms of the surface's topology. We show that the bounds given here are sharp in some cases and not sharp in others.
Paper proves rigidity of Doyle spirals in hexagonal lattice circle packings.
problem Proving Doyle conjecture for hexagonal lattice circle packings.
method Using Liouville theorem of discrete harmonic functions based on logarithmic radii ratio observation.
result Proves rigidity of Doyle spirals in hexagonal lattice circle packings with bounded radii ratios.
We obtain an asymptotic formula for the number of circles of curvature at most T in any given bounded Apollonian circle packing. For an integral packing, we obtain the upper bounds for the number of circles with prime curvature as well as of pairs of circles with prime curvatures, which are sharp up constant multiples.…
Circle packings on translation surfaces are consistent across different surfaces.
problem Existence and consistency of circle packings on translation surfaces.
method Analysis of circle packings on translation surfaces, including strata with varying genus.
result Same circle packing can be realized on varying translation surfaces in a certain stratum.
New algorithm for learning functions with bounds on error and sample complexity.
problem Learning -valued functions in a prediction model.
method General-purpose algorithm with upper and lower bounds on expected error and sample complexity.
result Improved bounds on sample complexity and agnostic learning conditions.
The Wasserstein metric is an important measure of distance between probability distributions, with applications in machine learning, statistics, probability theory, and data analysis. This paper provides upper and lower bounds on statistical minimax rates for the problem of estimating a probability distribution under W…
After having investigated the regular prisms and prism tilings in the $\SLR$ space in the previous work \cite{Sz13-1} of the second author, we consider the problem of geodesic ball packings related to those tilings and their symmetry groups . $\SLR$ is one of the eight Thurston geometries that can be de…
New graph feedback model for bandits with improved regret bounds.
problem Understanding how graph structure affects regret in bandit problems.
method Introduced fractional weak domination number and -packing independence number to capture upper and lower bounds on regret. Used strong duality theorem to derive upper and lower bounds.
result Proved general upper and lower bounds on regret for various graph structures, showing tightness up to a logarithmic factor.
In this paper, we study a certain class of online optimization problems, where the goal is to maximize a function that is not necessarily concave and satisfies the Diminishing Returns (DR) property under budget constraints. We analyze a primal-dual algorithm, called the Generalized Sequential algorithm, and we obtain t…
Upper and lower bounds for hyperbolic rod complements in 3-torus volumes.
problem Understanding geometric properties of hyperbolic rod complements in 3-torus.
method Provided upper and lower bounds for volumes in terms of rod parameters.
result Volume bounds for hyperbolic rod complements in 3-torus depend on rod parameters.
P. Buser and P. Sarnak showed in 1994 that the maximum, over the moduli space of Riemann surfaces of genus s, of the least conformal length of a nonseparating loop, is logarithmic in s. We present an application of (polynomially) dense Euclidean packings, to estimates for an analogous 2-dimensional conformal systolic i…
New bounds on hyperbolic surfaces' properties using linear programming.
problem Finding bounds on various geometric and spectral properties of hyperbolic surfaces.
method Adapted linear programming methods from sphere packings to hyperbolic surfaces.
result Obtained new upper and lower bounds on multiple properties of hyperbolic surfaces.
Develops Kleinian Sphere Packings and Bugs, proving their arithmetic origins.
problem Understanding sphere packings and their arithmetic origins in various dimensions.
method Introduces Kleinian Sphere Packings and Bugs, extending Arithmeticity Theorem.
result Kleinian packings and Bugs come from Q-arithmetic lattices of simplest type.
Study counts and equidistributes tori in Kleinian group self-joinings.
problem Counting and equidistribution of tori in Kleinian group self-joinings.
method Analyzes -dimensional torus packings invariant under a self-joining of a Kleinian group.
result Equidistribution results for tori with small volume in a class of -dimensional torus packings.
Proves rigidity of circle packings in the plane, generalizing previous work.
problem Rigidity of infinite inversive distance circle packings in the plane.
method Maximal principle for generic weighted Delaunay inversive distance circle packings and ring lemma for inversive distance circle packings in hexagonal triangulated plane.
result Proves Bowers-Stephenson's conjecture for inversive distance circle packings.
The paper studies rigidity of sphere packings on 3D manifolds with boundary.
problem Rigidity of sphere packings on 3D manifolds with boundary.
method Introduced generalized Thurston's sphere packings and proved their rigidity properties.
result Generalized Thurston's sphere packings are locally determined by combinatorial scalar curvatures and cannot be deformed while keeping combinatorial Ricci curvatures fixed.
Packed-Ensembles improve uncertainty estimation in constrained hardware.
problem Hardware limitations restrict the size of ensembles and network capacity, degrading performance.
method Packed-Ensembles (PE) design and train lightweight structured ensembles by modulating encoding space and parallelizing into a single backbone.
result PE accurately preserves diversity and maintains performance on key metrics like accuracy, calibration, and out-of-distribution detection.
Paper proves circle packings converge to Riemann mapping for Jordan domains.
problem Proving discrete conformal maps converge to Riemann mapping.
method Establishing solvability theorem for inversive distance circle packings.
result Bowers-Stephenson's conjecture for Jordan domains is proven.
Paper introduces new flows to find circle packings with specific curvature.
problem Finding circle packings with prescribed total geodesic curvatures.
method Introduces combinatorial Calabi flow, fractional combinatorial Calabi flow, and combinatorial p-th Calabi flow.
result Establishes conditions for the longtime behaviors of these flows.
The main result of this paper is an effective count for Apollonian circle packings that are either bounded or contain two parallel lines. We obtain this by proving an effective equidistribution of closed horospheres in the unit tangent bundle of a geometrically finite hyperbolic 3-manifold of infinite volume, whose fun…
Boundary Value Problem and Discrete Schwarz-Pick Lemma for Generalized Hyperbolic Circle Packingsmath.DG
Paper proves a discrete Schwarz-Pick lemma for generalized circle packings.
problem Comparing geometric quantities of circle packings with different boundary values.
method Combinatorial Calabi flows and maximum principle.
result Discrete Schwarz-Pick lemma proven for generalized circle packings.
The paper extends the Discrete Schwarz-Pick Lemma to circle packings with obtuse intersections and disjoint packings.
problem Proving the Discrete Schwarz-Pick Lemma for circle packings with various inversive distances.
method Using a variational principle for circle packings with inversive distances, the paper extends the lemma to a broader range of packings.
result The Discrete Schwarz-Pick Lemma holds for circle packings with inversive distances in , provided an additional condition on triangle weights.
The paper solves the existence problem of sphere packings in higher dimensions.
problem Existence of crystallographic sphere packings in certain higher dimensions.
method Geometric doubling procedure and computations with Lorentzian quadratic forms.
result Solves the existence problem of crystallographic sphere packings in higher dimensions.
Projective rigidity of circle packings on complex surfaces proved.
problem Proving rigidity of circle packings on complex projective surfaces.
method Proved projective rigidity through triangulations and complex projective structures.
result Space of circle packings is projectively rigid on complex projective surfaces.
Rigidity and deformation of generalized sphere packings on 3-dimensional manifolds with boundarymath.DG
The paper studies rigid sphere packings on 3D manifolds with boundary.
problem Investigating rigid sphere packings on 3D manifolds with boundary.
method Introducing generalized sphere packings, proving rigidity, introducing combinatorial curvature flows.
result Generalized sphere packing metrics are determined by combinatorial scalar curvature.
3D Ricci flows have bounded diameter before Type I singularities.
problem Bounding the diameter of 3D Ricci flows before Type I singularities.
method Introduced a neck-region concept and proved packing measure Ahlfors regularity.
result Uniformly bounded diameter up to Type I singular time.
Thurston's sphere packing on a 3-dimensional manifold is a generalization of Thusrton's circle packing on a surface, the rigidity of which has been open for many years. In this paper, we prove that Thurston's Euclidean sphere packing is locally determined by combinatorial scalar curvature up to scaling, which generaliz…
The paper studies circle packings on surfaces with boundary and their total geodesic curvatures.
problem Existence and rigidity of circle packings with conical singularities.
method Variational principle and combinatorial Ricci flow.
result Existence and rigidity of circle packings with prescribed total geodesic curvature.
Study of rod packings in 3-torus using 3-manifold geometry.
problem Understanding crystal structures in crystallography through rod packings in 3-torus.
method Use of 3-manifold geometry and topology to analyze complements of rod packings.
result Find families of complements that are hyperbolic and Seifert fibred.
Paper studies degenerated circle packings in hyperbolic geometry and finds conditions for their existence.
problem Whether a prescribed total geodesic curvature can be realized by a degenerated circle packing.
method Introduced combinatorial Ricci flow to find the desired degenerated circle packed surface, analogous to Chow-Luo and Takatsu methods.
result Fully characterized sufficient and necessary conditions for the existence of degenerated circle packings and showed their uniqueness.
As neural networks are increasingly employed in machine learning practice, how to efficiently share limited training resources among a diverse set of model training tasks becomes a crucial issue. To achieve better utilization of the shared resources, we explore the idea of jointly training multiple neural network model…
Kernel sparsity ("dying ReLUs") and lack of diversity are commonly observed in CNN kernels, which decreases model capacity. Drawing inspiration from information theory and wireless communications, we demonstrate the intersection of coding theory and deep learning through the Grassmannian subspace packing problem in CNN…
Paper constructs hyperbolic metrics using circle packings and curvature parameters.
problem Creating polyhedral metrics for surfaces of various topologies.
method Using circle packings and curvature parameters, the paper constructs hyperbolic polyhedral metrics.
result Unified approach to producing polyhedral metrics for surfaces of broader topological types.
Confirms unique eigenfunction in hyperbolic packing has maximal spectral gap.
problem Sarnak's spectral gap question for hyperbolic packings.
method Analysis of Patterson-Sullivan base eigenfunctions and spectral gaps.
result Unique square-integrable eigenfunction has maximal spectral gap.
Ball packings for linksmath.CO
Paper calculates ball number of links using Lorentz geometry and circle packing.
problem Calculating the minimum number of balls needed to represent a link.
method Lorentz geometry and circle packing theorem applied to ball packings.
result Shows for any link .
New theorem proves rigidity of circle packings in hyperbolic geometry.
problem Rigidity of circle packings in hyperbolic geometry.
method Established maximum principles and applied them to prove rigidity.
result Proved infinite rigidity of weighted Delaunay triangulations in the Poincaré disk.