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

推荐订阅源

WordPress大学
WordPress大学
酷 壳 – CoolShell
酷 壳 – CoolShell
小众软件
小众软件
Vercel News
Vercel News
Last Week in AI
Last Week in AI
H
Help Net Security
The Cloudflare Blog
L
LangChain Blog
Microsoft Security Blog
Microsoft Security Blog
B
Blog RSS Feed
云风的 BLOG
云风的 BLOG
I
InfoQ
U
Unit 42
美团技术团队
人人都是产品经理
人人都是产品经理
雷峰网
雷峰网
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 叶小钗
Y
Y Combinator Blog
Hugging Face - Blog
Hugging Face - Blog
A
About on SuperTechFans
宝玉的分享
宝玉的分享
量子位
博客园_首页

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}}$
Trace spectra of simplices in large sets
Michael Björklund, Alexander Fish, Shrey Sanadhya · 2026-06-11 · via math.CO updates on arXiv.org

Given an ordered tuple $\mathbf v=(v_0,\ldots,v_d)$ of vectors in $\mathbb{R}^d$, let $A_{\mathbf v}=[\,v_1-v_0\ \cdots\ v_d-v_0\,]$ be its edge matrix. We prove that, in every finite colouring of $\mathbb{R}^d$, one colour class realizes every prescribed value of the higher characteristic coefficients \[ (c_2(A_{\mathbf v}),\ldots,c_d(A_{\mathbf v})). \] This extends Graham's theorem on volumes, which corresponds to the last coefficient $c_d(A_{\mathbf v})=\det(A_{\mathbf v})$. We also prove a discrete analogue: if $E\subseteq\mathbb{Z}^d$ has positive upper Banach density, then, for some $q\geq 1$, the set of coefficient tuples realized by ordered tuples in $E$ contains \[ q^2\mathbb{Z}\times q^3\mathbb{Z}\times\cdots\times q^d\mathbb{Z}. \] Finally, we show that the ordinary trace $c_1(A_{\mathbf v})$ cannot be added to these conclusions. The proof combines a quantitative directional expansion result for ergodic actions of free abelian groups with a trace calculation for a family of model edge matrices.