4ti2
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The slice algorithm for irreducible decomposition of monomial ideals
- On the Gröbner complexity of matrices
- Convex integer maximization via Graver bases
- Minimal invariant Markov basis for sampling contingency tables with fixed marginals
- Markov chain Monte Carlo tests for designed experiments
- cdd
- CoCoA
- FEXACT
- IML - Integer Matrix Library
- Macaulay2
- Normaliz
- numericalsgps
- polymake
- StdPairs
- HarmonicBalance.jl
- QEta
- Risa/Asir
- SINGULAR
- Surfer
- AS 51
- lp_solve
- JavaView
- lpSolve
- LattE
- Gfan
- lrs
- Neural ideals and stimulus space visualization
- Computing the integer points of a polyhedron. II: Complexity estimates
- TOPCOM
- barvinok
- Phylogenetic complexity of the Kimura 3-parameter model
- The joint weight enumerator of an LCD code and its dual
- The hypermetric cone and polytope on eight vertices and some generalizations
- KSEG
- An algebraic algorithm for solving parametric integer programs
- Fitness, apprenticeship, and polynomials
- An algorithm to construct candidates to counterexamples to the Zassenhaus conjecture
- Hybrid schemes for exact conditional inference in discrete exponential families
- Finding multiplies solutions for non-linear integer programming
- Representation of multivariate Bernoulli distributions with a given set of specified moments
- Finding multiple solutions in nonlinear integer programming with algebraic test-sets
- Frobby
- Mgfun
- symmChainGens
- Binomials.m2
- NumericalSemigroupsWithGenus
- Poincare_Series
- Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
- Commutative algebra of statistical ranking
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Ideals of graph homomorphisms
- FourTiTwo
- Quantum Calculator
- Restrictions of characters in \(p\)-solvable groups
- The algebra of conformal blocks
- Construction of all polynomial relations among Dedekind eta functions of level \(N\)
- Hypergraph encodings of arbitrary toric ideals
- CaTS
- A polyhedral model for enumeration and optimization over the set of circuits
- CTblLib
- From examples to methods: Two cases from the study of units in integral group rings
- Separoids
- Circuits for robust designs
- GRIN
- On the strongly robust property of toric ideals
- Computing rational powers of monomial ideals
- HnfDecomposition
- Standard pairs for monomial ideals in semigroup rings
- Real-valued group testing for quantitative molecular assays
- isl
- TropLi
- PPLite: zero-overhead encoding of NNC polyhedra
- A method of verifying partition congruences by symbolic computation
- On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm
- Multigraded commutative algebra of graph decompositions
- surfex
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- noether.lib
- Finding modular functions for Ramanujan-type identities
- Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)
- Markov-chain Monte Carlo methods for the Box-Behnken designs and centrally symmetric configurations
- Hilbert bases for orthogonal arrays
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
- Markov chain Monte Carlo test of toric homogeneous Markov chains
- NonAbelianHilbert
- Betti numbers of Stanley-Reisner rings determine hierarchical Markov degrees
- Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
- Computing convex hulls and counting integer points with \texttt{polymake}
- On the possible dimensions of subspace intersections
- On possible dimensions of subspace intersections for five direct summands
- Polyhedra
- VersalDeformations
- On decomposable semigroups and applications.
- SMAPO
- Markov bases for noncommutative Fourier analysis of ranked data
- The generic Gröbner walk
- Cyclotomic polytopes and growth series of cyclotomic lattices
- Toric statistical models: parametric and binomial representations
- Solving thousand-digit Frobenius problems using Gröbner bases
This page was built for software: 4ti2
