2025/10/07 by Matan Seidel, Seidel, Matan
Mathematics · #13C10 #16Z05 (Primary) 16S34 (Secondary) #20E05 #20c07 #Advanced Topics in Algebra #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #Homotopy and Cohomology in Algebraic Topology #Rings and Algebras (math.RA)
paper · pdf · doi:10.48550/arxiv.2510.05906
openalex publication_date 2025/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/03
Consider the free group algebra K[F], where F is a free group and K a field. A well-order \prec on F is called an exposure order if words are greater than their proper prefixes. We show that every one-sided ideal I in K[F] admits a Schreier transversal, a basis, and a Gröbner basis -- each minimal in a natural sense with respect to \prec. When I is finitely generated and \prec is computable, we provide an algorithm for computing these minimal structures from a finite generating set. This extends the foundational works of Lewin and Rosenmann, which relied on the shortlex order, to both a broader class of orders on F and to infinitely generated ideals, while retaining algorithmic capabilities for such orders in case I is finitely generated. General exposure orders lack a form of compatibility with products which we call suffix-invariance, that shortlex enjoys, and which prior Gröbner basis constructions in K[F] relied on. In its absence, reductions may strictly increase the support of elements, requiring nontrivial conceptual adaptations to definitions and algorithms. These adaptations clarify the notion of minimality underlying prior constructions and demonstrate that algorithmic Gröbner theory in K[F] does not fundamentally require suffix-invariance, although its presence -- as in shortlex -- results in a simpler theory. Our framework further illuminates the flexibility of exposure orders: with a suitable choice of \prec, any Schreier transversal for I can be realized as minimal, and any basis for I arising from the constructions of Lewin or Rosenmann can likewise be realized as its minimal basis, unifying both approaches under a single framework.