arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.09274math.CO
收藏

单模系统的几何

Geometry of unimodular systems

I. V. Artamkin

AI总结:

本文证明单模系统可定义欧氏空间、整数格与自反格带状多面体,其复杂度等于极大线性无关子系统数,并引入Gale对偶,以图形、余图形及Bixby-Seymour系统为例说明。

摘要:

实向量空间中的一组向量被称为单模系统,如果它的任何极大线性无关子集都生成同一个自由交换群。这一概念与全单模矩阵密切相关:全单模矩阵的行或列构成一个单模系统,并且一个单模系统的所有向量相对于其极大线性无关子集的展开系数矩阵是全单模的。在本文中,我们证明一个单模系统定义了以下几何数据:一个欧几里得空间、其中的一个整数格,以及一个自反格带状多面体。该格的判别式等于极大线性无关子系统的数目,我们称这个数目为单模系统的复杂度。对于单模系统 $\Omega$,我们还定义了Gale对偶单模系统 $\Omega^{\bot}$,它具有相同的复杂度。这些概念可以通过一个图的众所周知的图形单模系统和余图形单模系统来说明。图形和余图形单模系统具有相同的复杂度,该复杂度等于图的复杂度。对于没有环和桥的图,图形和余图形单模系统互为Gale对偶。我们针对某些例子描述了这种几何数据:对于广义theta图(由$N$条边连接两个顶点)的图形和余图形单模系统,对于完全图$K_N$的余图形系统,以及对于著名的Bixby-Seymour单模系统(它既不是图形的也不是余图形的)。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑