Search arXivSearch

arXiv · 2601.05678

Canonical Lattices of Integer Relations Associated to Rational Fans: Wall Generation and a Two-Step Support Filtration

Abstract

We study the lattice $L_{\mathrm{rel}}(Σ)=\ker\big(\mathbb{Z}^{Σ(1)}\to N\big)$ of integer relations among the primitive ray generators of a rational fan $Σ$, from an intrinsic, coordinate-free point of view. For each cone $τ\inΣ$ we introduce the \emph{star-supported} sublattice $L_{\mathrm{rel}}(\operatorname{Star}(τ))$ of relations whose support lies in the star of $τ$, and we organize these by codimension into a support filtration $F_\bullet L_{\mathrm{rel}}(Σ)$. Our main result is a sharp local generation theorem: for a complete fan the relation lattice is generated \emph{integrally} by the relations supported on the stars of walls (codimension-one cones). Equivalently, the support filtration collapses after a single step, $F_1 L_{\mathrm{rel}}(Σ)=L_{\mathrm{rel}}(Σ)$. This is an intrinsic repackaging of the classical wall (wall-crossing) relations that generate the group of numerically trivial classes on a complete toric variety. We make the resulting two-step structure precise: for simplicial fans one has $0=F_0\subsetneq F_1=L_{\mathrm{rel}}(Σ)$, while for general fans $F_0$ records the intrinsic relations of non-simplicial maximal cones and $F_1$ adds exactly the wall relations. We prove functoriality of $L_{\mathrm{rays}}$ and $L_{\mathrm{rel}}$ under fan isomorphisms and ray-preserving subdivisions, deduce that every primitive collection of size $m$ is wall-generated, and illustrate the theory on $\mathbb{P}^2\times\mathbb{P}^1$, products of projective lines, weighted projective spaces, and the (non-simplicial) fan over a cube. We are careful throughout to distinguish what the filtration does and does not detect, correcting a natural but false expectation that support-codimension yields a strictly increasing multi-step invariant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rizwan Jahangir, Daisuke Ishii. 2026-07-20. Canonical Lattices of Integer Relations Associated to Rational Fans: Wall Generation and a Two-Step Support Filtration. https://arxiv.org/abs/2601.05678

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO