Equivariant lattice bases
From MaRDI portal
Publication:6582248
DOI10.1090/TRAN/9193zbMATH Open1547.05317MaRDI QIDQ6582248FDOQ6582248
Authors: Dinh Van Le, Tim Römer 
Publication date: 2 August 2024
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Recommendations
- Equivariant lattice generators and Markov bases
- Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
- Equivariant Gröbner bases and the Gaussian two-factor model
- Equivariant Gröbner Bases of Symmetric Toric Ideals
- The largest group of invariance for Markov bases and toric ideals
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Grassmannians, Schubert varieties, flag manifolds (14M15) Symmetric groups (20B30) Group actions on combinatorial structures (05E18)
Cites Work
- Lectures on algebraic statistics
- Polytopes, Rings, and K-Theory
- Title not available (Why is that?)
- Higher Lawrence configurations.
- Representation theory and homological stability.
- Bounded-rank tensors are defined in bounded degree
- On the foundations of linear and integer linear programming I
- Algebraic and geometric ideas in the theory of discrete optimization
- A finiteness theorem for Markov bases of hierarchical models
- Noetherianity up to symmetry
- Finite generation of symmetric ideals
- Finite Gröbner bases in infinite dimensional polynomial rings and applications
- Algebraic algorithms for sampling from conditional distributions
- Graph theory
- Markov bases for decomposable graphical models
- Gröbner bases of lattices, corner polyhedra, and integer programming
- The theory of well-quasi-ordering: a frequently discovered concept
- Ordering by Divisibility in Abstract Algebras
- Markov bases of three-way tables are arbitrarily complicated
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- Finiteness for the \(k\)-factor model and chirality varieties
- Algebraic statistics
- Noetherianity for infinite-dimensional toric varieties
- Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
- Equivariant lattice generators and Markov bases
- Theorems of Carathéodory, Minkowski–Weyl, and Gordan up to Symmetry
- Gröbner Bases for the Polynomial Ring with Infinite Variables and Their Applications
- Equivariant Hilbert series in non-Noetherian polynomial rings
- Invariant chains in algebra and discrete geometry
This page was built for publication: Equivariant lattice bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582248)
