arXiv subjects
Publications and source records attributed to Mathieu Vallée.
We prove that, up to row and column permutations and complement operations, the only complement minimally non-totally unimodular matrices are the cycle matrices $C_3$ and $C_5$. This settles a conjecture of Chervet, Grappe, and Vall\'ee. As a consequence, every simplicial cone generated by the rows of a totally equimodular matrix admits a regular unimodular Hilbert triangulation.
We introduce a binary matroid framework for the enumeration of mod $2$ toric-colorable seeds of fixed Picard number. Working with binary matroids up to isomorphism, we organize them through their contraction structure and recursively enumerate weak pseudomanifold subcomplexes by a dynamic programming algorithm. The resulting method combines these structural reductions with a Gray-code traversal of the mod $2$ kernel of the ridge--facet incidence matrix. Using this framework, we complete the classification of mod $2$ toric-colorable seeds of dimension four and Picard number five, proving that there are exactly $198{,}846$ isomorphism classes. This case was computationally infeasible for the GPU-based algorithm previously used by Choi, Jang, and Vall\'ee to treat Picard number four. We further verify that each of these seeds admits an integral characteristic map. As a validation of the method, we also reproduce that Picard number four classification: the weak pseudomanifold enumeration stage drops from over ten days on a GPU to ten minutes on a single CPU.
We introduce a systematic method for constructing set-theoretic operads via iterated application of the power set functor, and use it to uncover a hierarchy connecting several classical operads. Starting from the permutative operad, the first iteration recovers the commutative triassociative operad. The second iteration produces the substitution operad and the composition operad on simplicial complexes, two structures introduced by Ayzenberg and Abramyan--Panov in the theory of polyhedral products; we prove that both are infinitely generated. This hierarchy yields a conceptual explanation for the multiplicity of polyhedral product constructions: the arrows of any cocontinuous cocomplete symmetric monoidal category carry natural algebra structures over both operads, recovering the Cartesian, smash, and join polyhedral products as instances for different monoidal structures on topological spaces. Going further, we construct a new operad on relative simplicial complexes, governed by the join polyhedral product, which contains both the composition and the substitution operads as suboperads. As an application, pairs of piecewise-linear balls without interior vertices with their boundary spheres form a suboperad, extending the stability of the $J$-construction on piecewise-linear~spheres.
We classify all complete non-singular toric varieties with Picard number four via a combinatorial framework based on fanlike simplicial spheres and characteristic maps. This classification yields $59$ fanlike seeds with Picard number four, along with all toric manifolds supported by them. As a consequence, we resolve a conjecture of Gretenkort, Kleinschmidt, and Sturmfels by presenting the first known examples of toric manifolds supported by neighborly polytopes. We also answer a question of Batyrev concerning minimal non-faces of such spheres.
Totally equimodular matrices generalize totally unimodular matrices and arise in the context of box-total dual integral polyhedra. This work further explores the parallels between these two classes and introduces foundational building blocks for constructing totally equimodular matrices. Consequently, we present a decomposition theorem for totally equimodular matrices of full row rank. Building on this decomposition theorem, we prove that simplicial cones whose generators form the rows of a totally equimodular matrix sa\-tisfy strong integrality decomposition properties. More precisely, we provide the Hilbert basis for these cones and construct regular unimodular Hilbert triangulations in most cases. We conjecture that cases not covered here do not exist.
Let $K$ be an $(n-1)$-dimensional piecewise linear sphere on $[m]$, where $m\leq n+4$. There are a canonical action of $m$-dimensional torus $T^m$ on the moment-angle complex $\mathcal{Z}_K$, and a canonical action of $\mathbb{Z}_2^m$ on the real moment-angle complex $\mathbb{R}\mathcal{Z}_K$, where $\mathbb{Z}_2$ is the additive group with two elements. We prove that any subgroup of $\mathbb{Z}_2^m$ acting freely on $\mathbb{R}\mathcal{Z}_K$ is induced by a subtorus of $T^m$ acting freely on $\mathcal{Z}_K$. The proof primarily utilizes a suitably modified method of toric wedge induction and the combinatorial structure of a specific binary matroid of rank $4$.
We present a computationally efficient algorithm that is suitable for graphic processing unit implementation. This algorithm enables the identification of all weak pseudo-manifolds that meet specific facet conditions, drawn from a given input set. We employ this approach to enumerate toric colorable seeds. Consequently, we achieve a comprehensive characterization of $(n-1)$-dimensional PL spheres with $n+4$ vertices that possess a maximal Buchstaber number. A primary focus of this research is the fundamental categorization of non-singular complete toric varieties of Picard number $4$. This classification serves as a valuable tool for addressing questions related to toric manifolds of Picard number $4$. Notably, we have determined which of these manifolds satisfy equality within an inequality regarding the number of minimal components in their rational curve space. This addresses a question posed by Chen, Fu, and Hwang in 2014 for this specific case.
The puzzle method was introduced by Choi and Park as an effective method for finding non-singular characteristic maps over wedged simplicial complexes $K(J)$ obtained from a given simplicial complex $K$. We study further the mod 2 case of the puzzle method. We firstly describe it completely in terms of linear algebraic language which allows us to develop a constructive puzzle algorithm. We also analyze our algorithm and compare its performances with other known algorithms including the Garrison and Scott algorithm.