arXiv subjects

Sergio Cristancho

Publications and source records attributed to Sergio Cristancho.

4 recordsLinked to original sources

arXiv2026

Toric vector bundles with trivial Chern class and flag decorations

We study toric vector bundles on complete toric varieties whose total equivariant Chern classes are trivial. Our approach is tropical, using the notion of tropical toric vector bundles as piecewise linear maps introduced by Kaveh and Manon. We prove that any toric vector bundle of rank $r$ with trivial Chern class and affinely independent equivariant Chern roots is equivariantly isomorphic to a toric vector bundle pulled back from one of a finite set of varieties with dimension at most $r-1$ after twisting by a character. This extends a theorem of Payne about toric vector bundles of rank $r\leq 3$ with trivial Chern class. As an application, we construct examples of complete toric varieties of dimension $n$ that admit no nontrivial toric vector bundles of rank $r\leq n+1$ with the aforementioned properties. We also introduce combinatorial gadgets we call flag decorations of permutohedra, whose convexity properties are key for our results.

math.AG↗

arXiv2026

Extremal Graphs for the Lights Out Problem

Lights Out is a game played on a graph $G$ where every vertex has a light bulb that is either on or off, and pressing a vertex $v$ toggles the state of every vertex in the closed neighborhood of $v$. The goal is to find a subset of vertices $S$ such that pressing every vertex in $S$ results in all light bulbs being turned off. We study the extremal graphs for which pressing every vertex is the unique solution to the lights out problem given an initial configuration of all lights on. We show that a graph is extremal if and only if it is even and has an odd number of matchings. Furthermore, there is a bijection between the set of labeled $n$-vertex extremal graphs and the set of symmetric invertible matrices of size $n-2$ over $\mathbb{F}_2$. We prove that any even graph with no cycle of length $0\pmod 3$ must be extremal. We also demonstrate operations that build larger extremal graphs from smaller ones. Along the way, we prove using the polynomial method that in any even graph, the number of matchings of a fixed size covering an odd subset of vertices is even.

math.CO↗

arXiv2026

Tree metrics and log-concavity for matroids

We show that a set function $ν$ satisfies the gross substitutes property if and only if its homogeneous generating polynomial $Z_{q,ν}$ is a Lorentzian polynomial for all positive $q \le 1$, answering a question of Eur-Huh. We achieve this by giving a rank 1 upper bound for the distance matrix of an ultrametric tree, refining a classical result of Graham-Pollak. This characterization enables us to resolve two open problems that strengthen Mason's log-concavity conjectures for the number of independent sets of a matroid: one posed by Giansiracusa-Rincón-Schleis-Ulirsch for valuated matroids, and two posed by Dowling in 1980 and Zhao in 1985 for ordinary matroids.

math.CO↗

arXiv2022

Harmonic Hierarchies for Polynomial Optimization

We introduce novel polyhedral approximation hierarchies for the cone of nonnegative forms on the unit sphere in $\mathbb{R}^n$ and for its (dual) cone of moments. We prove computable quantitative bounds on the speed of convergence of such hierarchies. We also introduce a novel optimization-free algorithm for building converging sequences of lower bounds for polynomial minimization problems on spheres. Finally some computational results are discussed, showcasing our implementation of these hierarchies in the programming language Julia.

math.OC↗