惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园 - 叶小钗
雷峰网
雷峰网
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Martin Fowler
Martin Fowler
MyScale Blog
MyScale Blog
博客园 - 聂微东
有赞技术团队
有赞技术团队
The Cloudflare Blog
T
Tailwind CSS Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
月光博客
月光博客
T
The Blog of Author Tim Ferriss
D
Docker
L
LangChain Blog
Vercel News
Vercel News
C
Check Point Blog
博客园 - Franky
博客园 - 三生石上(FineUI控件)
Recent Announcements
Recent Announcements
H
Hackread – Cybersecurity News, Data Breaches, AI and More
量子位
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
V
V2EX
人人都是产品经理
人人都是产品经理

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
On compact packings of Euclidean space with spheres of fi...
Eder Kikianty, Miek Messerschmidt · 2023-05-01 · via math.CO updates on arXiv.org

For $d\in\mathbb{N}$, a compact sphere packing of Euclidean space $\mathbb{R}^{d}$ is a set of spheres in $\mathbb{R}^{d}$ with disjoint interiors so that the contact hypergraph of the packing is the vertex scheme of a homogeneous simplicial $d$-complex that covers all of $\mathbb{R}^{d}$. We are motivated by the question: For $d,n\in\mathbb{N}$ with $d,n\geq2$, how many configurations of numbers $0<r_{0}<r_{1}<\ldots<r_{n-1}=1$ can occur as the radii of spheres in a compact sphere packing of $\mathbb{R}^{d}$ wherein there occur exactly $n$ sizes of sphere? We introduce what we call `heteroperturbative sets' of labeled triangulations of unit spheres and we discuss the existence of non-trivial examples of heteroperturbative sets. For a fixed heteroperturbative set, we discuss how a compact sphere packing may be associated to the heteroperturbative set or not. We proceed to show, for $d,n\in\mathbb{N}$ with $d,n\geq2$ and for a fixed heteroperturbative set, that the collection of all configurations of $n$ distinct positive numbers that can occur as the radii of spheres in a compact packing is finite, when taken over all compact sphere packings of $\mathbb{R}^{d}$ which have exactly $n$ sizes of sphere and which are associated to the fixed heteroperturbative set.