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

推荐订阅源

Last Week in AI
Last Week in AI
有赞技术团队
有赞技术团队
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
人人都是产品经理
人人都是产品经理
博客园 - 司徒正美
博客园 - 聂微东
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 叶小钗
罗磊的独立博客
IT之家
IT之家
博客园 - 三生石上(FineUI控件)
V
Visual Studio Blog
T
Tailwind CSS Blog
大猫的无限游戏
大猫的无限游戏
Hugging Face - Blog
Hugging Face - Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
N
Netflix TechBlog - Medium
MyScale Blog
MyScale Blog
J
Java Code Geeks
L
LangChain Blog
S
SegmentFault 最新的问题
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Apple Machine Learning Research
Apple Machine Learning Research
G
Google Developers 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}}$
Linear relations between face numbers of levels in arrang...
Elizaveta Streltsova, Uli Wagner · 2025-04-10 · via math.CO updates on arXiv.org

We study linear relations between face numbers of levels in arrangements. Let $V = \{ v_1, \ldots, v_n \} \subset \mathbf{R}^{r}$ be a vector configuration in general position, and let $\mathcal{A}(V)$ be polar dual arrangement of hemispheres in the $d$-dimensional unit sphere $S^d$, where $d=r-1$. For $0\leq s \leq d$ and $0 \leq t \leq n$, let $f_{s,t}(V)$ denote the number of faces of \emph{level} $t$ and dimension $d-s$ in the arrangement $\mathcal{A}(V)$ (these correspond to partitions $V=V_-\sqcup V_0 \sqcup V_+$ by linear hyperplanes with $|V_0|=s$ and $|V_-|=t$). We call the matrix $f(V):=[f_{s,t}(V)]$ the \emph{$f$-matrix} of $V$. Completing a long line of research on linear relations between face numbers of levels in arrangements, we determine, for every $n\geq r \geq 1$, the affine space $\mathfrak{F}_{n,r}$ spanned by the $f$-matrices of configurations of $n$ vectors in general position in $\mathbf{R}^r$; moreover, we determine the subspace $\mathfrak{F}^0_{n,r} \subset \mathfrak{F}_{n,r}$ spanned by all \emph{pointed} vector configurations (i.e., such that $V$ is contained in some open linear halfspace), which correspond to point sets in $\mathbf{R}^d$. This generalizes the classical fact that the Dehn--Sommerville relations generate all linear relations between the face numbers of simple polytopes (the faces at level $0$) and answers a question posed by Andrzejak and Welzl in 2003. The key notion for the statements and the proofs of our results is the $g$-matrix of a vector configuration, which determines the $f$-matrix and generalizes the classical $g$-vector of a polytope. By Gale duality, we also obtain analogous results for partitions of vector configurations by sign patterns of nontrivial linear dependencies, and for \emph{Radon partitions} of point sets in $\mathbf{R}^d$.