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

推荐订阅源

U
Unit 42
博客园 - Franky
T
Tailwind CSS Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
月光博客
月光博客
人人都是产品经理
人人都是产品经理
雷峰网
雷峰网
Hugging Face - Blog
Hugging Face - Blog
有赞技术团队
有赞技术团队
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
阮一峰的网络日志
阮一峰的网络日志
C
Check Point Blog
爱范儿
爱范儿
T
The Blog of Author Tim Ferriss
aimingoo的专栏
aimingoo的专栏
Stack Overflow Blog
Stack Overflow Blog
博客园 - 聂微东
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
L
LangChain Blog
云风的 BLOG
云风的 BLOG
MyScale Blog
MyScale Blog
Microsoft Security Blog
Microsoft Security Blog
The Cloudflare Blog
博客园 - 三生石上(FineUI控件)

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Structure of kissing arrangements in ${\mathbb R}^{12}$ a...
[Submitted on 17 Jun 2026] · 2026-06-18 · via cs.IT updates on arXiv.org

View PDF HTML (experimental)

Abstract:Most currently known kissing arrangements of size $840$ in $\mathbb R^{12}$ share a common structure. They consist of $60$ vectors supported on $\mathbb R^6\times\{\mathbf 0\}$, another $60$ vectors supported on $\{\mathbf 0\}\times\mathbb R^6$, and $720$ additional \emph{bridge vectors}. The bridge vectors encode the interaction between the two six-dimensional factors and are constructed from the unique $1$-factorization of the complete graph $K_6$.
In this paper we investigate kissing arrangements of this type while keeping the bridge vectors fixed. We show that each $60$-point block admits substantial flexibility: $12$ of its vectors may be chosen as the signed coordinate vectors $\pm e_i$, while the remaining $48$ vectors may vary within a positive-dimensional family of configurations, which we call $48$-systems. As a consequence, we obtain infinitely many pairwise non-isometric kissing arrangements of size $840$ in $\mathbb R^{12}$.
The geometric freedom revealed by these constructions provides new insight into the local structure of extremal configurations. Exploiting this structure, we develop a specialized initialization scheme for logarithmic Riesz energy optimization. Starting from such structurally informed initial configurations, we numerically construct a kissing arrangement of size $841$ in $\mathbb R^{12}$.

Submission history

From: Rustem Takhanov [view email]
[v1] Wed, 17 Jun 2026 12:05:28 UTC (1,088 KB)