Counting edges in factorization graphs of numerical semigroup elements
From MaRDI portal
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Free semigroups, generators and relations, word problems (20M05) Commutative semigroups (20M14)
Cites work
- A Walk Through Combinatorics
- Algebraic algorithms for sampling from conditional distributions
- Algebraic and geometric ideas in the theory of discrete optimization
- AN ALGORITHMIC METHOD TO COMPUTE A MINIMAL RELATION FOR ANY NUMERICAL SEMIGROUP
- An Overview of the Computational Aspects of Nonunique Factorization Invariants
- Computing the Continuous Discretely
- Distances between factorizations in the Chicken McNugget monoid
- Factoring in the Chicken McNugget monoid
- Factorization invariants in numerical monoids
- scientific article; zbMATH DE number 3163858 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Markov bases in algebraic statistics.
- On factorization invariants and Hilbert functions
- On the relative size of toric bases
- On the universal Gröbner bases of varieties of minimal degree
- Semigroup rings and simplicial complexes
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- The catenary and tame degree in finitely generated commutative cancellative monoids.
- The computation of factorization invariants for affine semigroups
This page was built for publication: Counting edges in factorization graphs of numerical semigroup elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869826)
