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
- 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
- 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
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- \(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
- Evaluating and tuning \(n\)-fold integer programming
- 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
- Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)
- 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
- Markov chain Monte Carlo methods for the regular two-level fractional factorial designs and cut ideals
- Markov chains on the reference set of contingency tables with upper bounds
- Exact inference in contingency tables via stochastic approximation Monte Carlo
- Outliers and Patterns of Outliers in Contingency Tables with Algebraic Statistics
- On decomposable semigroups and applications.
- Markov chain Monte Carlo tests for designed experiments
- Markov complexity of monomial curves
- Positive margins and primary decomposition
- Semigroups of \(sl_3(\mathbb C)\) tensor product invariants
- Representation of multivariate Bernoulli distributions with a given set of specified moments
- Challenging computations of Hilbert bases of cones associated with algebraic statistics
- Markov chain Monte Carlo test of toric homogeneous Markov chains
- Experiments with the site frequency spectrum
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Matrix representations for toric parametrizations
- Algebraic combinatorics of diametric magic circles
- A geometric view on learning Bayesian network structures
- Restrictions of characters in \(p\)-solvable groups
- A study of a family of monomial ideals
- Markov bases of conditional independence models for permutations
- The slice algorithm for irreducible decomposition of monomial ideals
- Commutative algebra of statistical ranking
- PPLite: zero-overhead encoding of NNC polyhedra
- Symbolic Rees algebras
- Semigroups -- a computational approach
- Cyclotomic polytopes and growth series of cyclotomic lattices
- The algebra of conformal blocks
- Toric ideals of homogeneous phylogenetic models
- Title not available (Why is that?)
- Markov bases and subbases for bounded contingency tables
- Distance-reducing Markov bases for sampling from a discrete sample space
- An improved test set approach to nonlinear integer problems with applications to engineering design
- Noetherianity for infinite-dimensional toric varieties
- Markov bases and generalized Lawrence liftings
- Three Counter-Examples on Semi-Graphoids
- Hilbert basis of the Lipman semigroup
- Markov bases for noncommutative Fourier analysis of ranked data
- Multigraded commutative algebra of graph decompositions
- Minimal invariant Markov basis for sampling contingency tables with fixed marginals
- Betti numbers of Stanley-Reisner rings determine hierarchical Markov degrees
- A class of statistical models to weaken independence in two-way contingency tables
- Synthetic two-way contingency tables that preserve conditional frequencies
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
- Exact algorithms and software in optimization and polyhedral computation
- Two algebraic byways from differential equations: Gröbner bases and quivers
- The three-state toric homogeneous Markov chain model has Markov degree two
- Syzygies for Metropolis base chains
- An algebraic approach to integer portfolio problems
- Properties of cut ideals associated to ring graphs
- A generalization of the integer linear infeasibility problem
This page was built for software: 4ti2
