Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.09274

Geometry of unimodular systems

I. V. Artamkin
View original source ↗Read source document ↗Export metadata ↓

Abstract

A collection of vectors in a real vector space is called a unimodular system if any of its maximal linearly independent subsets generates the same free abelian group. This notion is closely connected with totally unimodular matrices: rows or columns of a totally unimodular matrix form a unimodular system and the matrix of coefficients of expansions of all vectors of a unimodular system with respect to its maximal linearly independent subset is totally unimodular. In this paper we show that a unimodular system defines the following geometric data: a Euclidean space, an integral lattice in it, and a reflexive lattice zonotope. The discriminant of the lattice is equal to the number of maximal linearly independent subsystems, and we call this number the complexity of the unimodular system. For a unimodular system $Ω$ we also define the Gale dual unimodular system $Ω^{\bot}$ which has the same complexity. These notions may be illustrated by the well-known graphic and cographic unimodular systems of a graph. Both graphic and cographic unimodular systems have the same complexity which is equal to the complexity of the graph. For graphs without loops and bridges the graphic and the cographic unimodular systems are Gale dual to each other. We describe this geometric data for certain examples: for the graphic and the cographic unimodular systems of a generalized theta-graph, consisting of two vertices connected by $N$ edges, for the cographic system of the complete graph $K_N$, and for the famous Bixby-Seymour unimodular system, which is neither graphic nor cographic.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

I. V. Artamkin. 2023-10-13. Geometry of unimodular systems. https://arxiv.org/abs/2310.09274

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

KEEP EXPLORING

Related papers

arXiv2026

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO↗
arXiv2026

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO↗
arXiv2026

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO↗