We study lattices in free abelian groups of infinite rank that are invariant under the action of the infinite symmetric group, with emphasis on finiteness of their equivariant bases. Our framework provides a new method for proving finiteness results in algebraic statistics. As an illustration, we show that every invariant lattice in $\mathbb{Z}^{(\mathbb{N}\times[c])}$, where $c\in\mathbb{N}$, has a finite equivariant Graver basis. This result generalizes and strengthens several finiteness results about Markov bases in the literature.Comment: 31 page
The generalized Nottingham group was introduced over finite fields in 95 by Shalev, aiming to find...
The generalized Nottingham group was introduced over finite fields in 95 by Shalev, aiming to find...
AbstractBy means of combinatorics on finite distributive lattices, lexicographic quadratic Gröbner b...
AbstractWe introduce the theory of monoidal Gröbner bases, a concept which generalizes the familiar ...
AbstractWe introduce the theory of monoidal Gröbner bases, a concept which generalizes the familiar ...
This paper is devoted to the study of lattices generated by finite Abelian groups. Special species o...
Unimodular fans are central to toric algebraic geometry, where they correspond to non-singular toric...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
We investigate finitary functions from $\mathbb{Z}_{n}$ to $\mathbb{Z}_{n}$ for a squarefree number ...
A subset {g1,.., gd} of a finite group G invariably generates {g1x1,..,gdxd} generates G for every c...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
AbstractWe apply the machinery of Gröbner bases to finitely presented groups. This allows for comput...
The generalized Nottingham group was introduced over finite fields in 95 by Shalev, aiming to find...
The generalized Nottingham group was introduced over finite fields in 95 by Shalev, aiming to find...
AbstractBy means of combinatorics on finite distributive lattices, lexicographic quadratic Gröbner b...
AbstractWe introduce the theory of monoidal Gröbner bases, a concept which generalizes the familiar ...
AbstractWe introduce the theory of monoidal Gröbner bases, a concept which generalizes the familiar ...
This paper is devoted to the study of lattices generated by finite Abelian groups. Special species o...
Unimodular fans are central to toric algebraic geometry, where they correspond to non-singular toric...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
We investigate finitary functions from $\mathbb{Z}_{n}$ to $\mathbb{Z}_{n}$ for a squarefree number ...
A subset {g1,.., gd} of a finite group G invariably generates {g1x1,..,gdxd} generates G for every c...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from...
AbstractWe apply the machinery of Gröbner bases to finitely presented groups. This allows for comput...
The generalized Nottingham group was introduced over finite fields in 95 by Shalev, aiming to find...
The generalized Nottingham group was introduced over finite fields in 95 by Shalev, aiming to find...
AbstractBy means of combinatorics on finite distributive lattices, lexicographic quadratic Gröbner b...