A 3D flexible bin packing problem (3D-FBPP) arises from the process of warehouse packing in e-commerce. An online customer's order usually contains several items and needs to be packed as a whole before shipping. In particular, 5% of tens of millions of packages are using plastic wrapping as outer packaging every day, …
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…
CLAMP uses neural manifold packing to improve self-supervised learning.
problem Improving self-supervised learning for vision tasks.
method CLAMP recasts representation learning as a manifold packing problem, introducing a loss function inspired by particle systems.
result CLAMP achieves competitive performance with state-of-the-art models and separates neural manifolds effectively.
Bin Packing problems have been widely studied because of their broad applications in different domains. Known as a set of NP-hard problems, they have different vari- ations and many heuristics have been proposed for obtaining approximate solutions. Specifically, for the 1D variable sized bin packing problem, the two ke…
PackIt creates a virtual space for testing geometric planning skills.
problem Evaluating geometric planning abilities in virtual environments.
method Developed a virtual environment, PackIt, for geometric planning tasks.
result Demonstrated the effectiveness of various methods for geometric planning.
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.
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.
Extremal compact hyperbolic surfaces contain a packing of discs of the largest possible radius permitted by the topology of the surface. It is well known that arithmetic conditions on the uniformizing group are necessary for the existence of a second extremal packing in the same surface, but constructing explicit examp…
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.
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.
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.
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.
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.
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 (−1,1], 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.
Two new algorithms improve robust PCA and Schatten packing.
problem Robustly estimating the top eigenvector of corrupted sub-Gaussian data.
method Two iterative filtering and nearly-linear time algorithms.
result First polynomial-time algorithms for non-trivial covariance estimation.
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.
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.
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.
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.
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.
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.
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 ball(L)≤5cr(L) for any link L. 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.
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.
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.
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.
The paper solves circle packings on surfaces with boundaries.
problem Circle packing on surfaces with boundaries and finite genus.
method Using Thurston's algorithm and discrete Schwarz-Pick lemma.
result A unique solution to the boundary value problem exists.
The paper finds circle packings with specific curvatures in hyperbolic geometry.
problem Finding circle packings with prescribed total geodesic curvatures and discrete Gaussian curvatures.
method Established existence and rigidity via variational principle, introduced combinatorial p-th Calabi flows.
result Introduced combinatorial p-th Calabi flows to find circle packings with prescribed curvatures.
From the geometric study of the elementary cell of hexagonal circle packings --- a flower of 7 circles --- the class of conformally symmetric circle packings is defined. Up to Moebius transformations, this class is a three parameter family, that contains the famous Doyle spirals as a special case. The solutions are giv…
An extremal k-packing is a collection of k mutually disjoint metric discs, embedded in a surface, whose radius is maximal for the given topology. We study compact non-orientable surfaces of genus g≥3 containing extremal k-packings.
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…
Inversive distance circle packing metric was introduced by P Bowers and K Stephenson \cite{BS} as a generalization of Thurston's circle packing metric \cite{T1}. They conjectured that the inversive distance circle packings are rigid. For nonnegative inversive distance, Guo \cite{Guo} proved the infinitesimal rigidity a…
The Andreev-Thurston theorem states that for any triangulation of a closed orientable surface Σ_g of genus g which is covered by a simple graph in the universal cover, there exists a unique metric of curvature 1, 0 or -1 on the surface depending on whether g=0, 1 or \ge 2 such that the surface with this metric admits a…
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…
We study circle packings with the combinatorics of a triangulated disk in the plane and parametrize deformations of circle packings in terms of vertex rotation and cross ratios. We show that there is a Weierstrass representation formula relating infinitesimal deformations of circle packings to discrete minimal surfaces…
This paper investigates several global rigidity issues for polyhedral surfaces including inversive distance circle packings. Inversive distance circle packings are polyhedral surfaces introduced by P. Bowers and K. Stephenson as a generalization of Andreev-Thurston's circle packing. They conjectured that inversive dist…
Pack hyperbolic surfaces with circles or horocycles, noting symmetries.
problem Pack hyperbolic surfaces efficiently.
method Discuss packing with circles or horocycles, noting symmetries.
result Observations on symmetries of packed hyperbolic surfaces.
Solving polynomial equations finds circle packings on surfaces.
problem Finding circle packings on triangulated surfaces.
method Solving a system of polynomial equations associated with surface triangulations.
result Circle packings can be found by solving polynomial equations.
We discuss closed symplectic 4-manifolds which admit full symplectic packings by N equal balls for large N's. We give a homological criterion for recognizing such manifolds. As a corollary we prove that CP2 can be fully packed by N equal balls for every N≥9.
The paper finds hyperbolic metrics on surfaces with boundary using combinatorial curvature flows.
problem Finding hyperbolic metrics on surfaces with totally geodesic boundaries of prescribed lengths.
method Introducing combinatorial Ricci flow and combinatorial Calabi flow for generalized circle packings.
result Proves longtime existence and global convergence of combinatorial curvature flows.
We describe some problems, observations, and conjectures concerning thickness and packing density of knots and links in $\sp^3$ and R3. We prove the thickness of a nontrivial knot or link in $\sp^3$ is no more than 4π, the thickness of a Hopf link. We also give arguments and evidence supporting the conject…