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

推荐订阅源

D
DataBreaches.Net
有赞技术团队
有赞技术团队
Jina AI
Jina AI
H
Help Net Security
D
Docker
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Blog — PlanetScale
Blog — PlanetScale
Hugging Face - Blog
Hugging Face - Blog
罗磊的独立博客
MyScale Blog
MyScale Blog
N
Netflix TechBlog - Medium
B
Blog RSS Feed
Martin Fowler
Martin Fowler
WordPress大学
WordPress大学
T
The Blog of Author Tim Ferriss
U
Unit 42
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
MongoDB | Blog
MongoDB | Blog
美团技术团队
M
MIT News - Artificial intelligence
阮一峰的网络日志
阮一峰的网络日志
博客园 - 司徒正美
Microsoft Security Blog
Microsoft Security Blog
IT之家
IT之家

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}}$
Universal minima of discrete potentials for sharp spheric...
Peter Boyvalenkov, Peter Dragnev, Douglas Hardin, Edward Saff, M · 2022-11-01 · via math.CO updates on arXiv.org

This article is devoted to the study of discrete potentials on the sphere in $\mathbb{R}^n$ for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical $τ$-designs previously derived by the authors, where ``universal'' is meant in the sense of applying to a large class of potentials that includes absolutely monotone functions of inner products. We also extend our universal bounds to $T$-designs and the associated polynomial subspaces determined by the vanishing moments of spherical configurations and thus obtain the minima for the icosahedron, dodecahedron, and sharp codes coming from $E_8$ and the Leech lattice. For this purpose, we investigate quadrature formulas for certain subspaces of Gegenbauer polynomials $P^{(n)}_j$ which we call PULB subspaces, particularly those having basis $\{P_j^{(n)}\}_{j=0}^{2k+2}\setminus \{P_{2k}^{(n)}\}.$ Furthermore, for potentials with $h^{(τ+1)}<0$ we prove that the strong sharp codes and the antipodal sharp codes attain the universal bounds and their minima occur at points of the codes. The same phenomenon is established for the $600$-cell when the potential $h$ satisfies $h^{(i)}\geq 0$, $i=1,\dots,15$, and $h^{(16)}\leq 0.$