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

推荐订阅源

M
MIT News - Artificial intelligence
阮一峰的网络日志
阮一峰的网络日志
爱范儿
爱范儿
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
宝玉的分享
宝玉的分享
博客园 - 三生石上(FineUI控件)
博客园 - 【当耐特】
雷峰网
雷峰网
酷 壳 – CoolShell
酷 壳 – CoolShell
美团技术团队
The GitHub Blog
The GitHub Blog
Microsoft Security Blog
Microsoft Security Blog
量子位
D
DataBreaches.Net
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
博客园_首页
Martin Fowler
Martin Fowler
有赞技术团队
有赞技术团队
Hugging Face - Blog
Hugging Face - Blog
人人都是产品经理
人人都是产品经理
N
Netflix TechBlog - Medium
Jina AI
Jina AI
D
Docker
Y
Y Combinator Blog

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}}$
Kissing number in hyperbolic space
Maria Dostert, Alexander Kolpakov · 2019-06-30 · via math.CO updates on arXiv.org

This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in $\mathbb{H}^n$, for $n\geq 2$. For that purpose, the kissing number is replaced by the kissing function $κ(n, r)$ which depends on the radius $r$. After we obtain some theoretical lower and upper bounds for $κ(n, r)$, we study their asymptotic behaviour and show, in particular, that $\lim_{r\to \infty} \frac{\log κ(n,r)}{r} = n-1$. Finally, we compare them with the numeric upper bounds obtained by solving a suitable semidefinite program.