swMATH4379MaRDI QIDQ16555FDOQ16555
Author name not available (Why is that?)
Official website: https://4ti2.github.io/
Cited In (only showing first 100 items - show all)
- Computing rational powers of monomial ideals
- An Overview of the Computational Aspects of Nonunique Factorization Invariants
- DiscreteStatisticalModelsWithRationalMLE
- Equivariant Gröbner bases
- Outliers and Patterns of Outliers in Contingency Tables with Algebraic Statistics
- Applying CEGAR to the Petri net state equation
- The joint weight enumerator of an LCD code and its dual
- Algorithmic aspects of units in group rings
- Construction of all polynomial relations among Dedekind eta functions of level \(N\)
- The smallest normal edge polytopes with no regular unimodular triangulations
- Standard pairs for monomial ideals in semigroup rings
- Fitness, apprenticeship, and polynomials
- An algebraic algorithm for solving parametric integer programs
- Noetherianity for infinite-dimensional toric varieties
- Markov bases and generalized Lawrence liftings
- An algorithm to construct candidates to counterexamples to the Zassenhaus conjecture
- Hypergraph encodings of arbitrary toric ideals
- Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities
- Corrigendum to: ``Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
- Hybrid schemes for exact conditional inference in discrete exponential families
- Finding multiplies solutions for non-linear integer programming
- Saturation points on faces of a rational polyhedral cone
- Hilbert bases for orthogonal arrays
- Real-valued group testing for quantitative molecular assays
- \(R\) symmetries and a heterotic MSSM
- A note on minimal zero-sum sequences over Z
- Finding multiple solutions in nonlinear integer programming with algebraic test-sets
- On the strongly robust property of toric ideals
- The status of the Zassenhaus conjecture for small groups
- Markov-chain Monte Carlo methods for the Box-Behnken designs and centrally symmetric configurations
- On the prime graph question for integral group rings of 4-primary groups I
- On possible dimensions of subspace intersections for five direct summands
- On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm
- A polyhedral model for enumeration and optimization over the set of circuits
- From examples to methods: Two cases from the study of units in integral group rings
- Computing holes in semi-groups and its applications to transportation problems
- Finding modular functions for Ramanujan-type identities
- HarmonicBalance.jl
- StdPairs
- QEta
- A method of verifying partition congruences by symbolic computation
- The computation of factorization invariants for affine semigroups
- Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
- On the prime graph question for almost simple groups with an alternating socle
- Covariant algebra of the binary nonic and the binary decimic
- Neural ideals and stimulus space visualization
- Computing the integer points of a polyhedron. II: Complexity estimates
- Phylogenetic complexity of the Kimura 3-parameter model
- The hypermetric cone and polytope on eight vertices and some generalizations
- Circuits for robust designs
- Normaliz: Algorithms for affine monoids and rational cones
- Voronoi polytopes for polyhedral norms on lattices
- A characterization of saturated designs for factorial experiments
- Random sampling in computational algebra: Helly numbers and violator spaces
- A finiteness theorem for Markov bases of hierarchical models
- Polymake and Lattice Polytopes
- String-derived MSSM vacua with residual R symmetries
- \(N\)-fold integer programming
- Sagbi bases of Cox-Nagata rings
- Toric Ideals of Phylogenetic Invariants
- Lattice polly cracker cryptosystems
- On the Gröbner complexity of matrices
- Fractions of permutations. An application to Sudoku
- Natural gradient flow in the mixture geometry of a discrete exponential family
- Computing generating sets of lattice ideals and Markov bases of lattices
- Hilbert schemes and toric degenerations for low degree Fano threefolds
- Support sets in exponential families and oriented matroid theory
- Finitely many smooth \(d\)-polytopes with \(n\) lattice points
- Computing convex hulls and counting integer points with \texttt{polymake}
- On the possible dimensions of subspace intersections
- cdd
- CoCoA
- FEXACT
- IML - Integer Matrix Library
- Macaulay2
- Sequential importance sampling for multiway tables
- Normaliz
- numericalsgps
- polymake
- Risa/Asir
- SINGULAR
- Surfer
- AS 51
- lp_solve
- JavaView
- lpSolve
- LattE
- Gfan
- lrs
- barvinok
- TOPCOM
- KSEG
- Frobby
- Mgfun
- Binomials.m2
- NumericalSemigroupsWithGenus
- symmChainGens
- Poincare_Series
- FourTiTwo
- Quantum Calculator
This page was built for software: 4ti2
