4ti2

swMATH4379MaRDI QIDQ16555FDOQ16555

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• An Overview of the Computational Aspects of Nonunique Factorization Invariants
• Introduction to Computational Algebraic Statistics
• Outliers and Patterns of Outliers in Contingency Tables with Algebraic Statistics
• On decomposable semigroups and applications.
• The joint weight enumerator of an LCD code and its dual
• Markov chain Monte Carlo test of toric homogeneous Markov chains
• Experiments with the site frequency spectrum
• A geometric view on learning Bayesian network structures
• A study of a family of monomial ideals
• Fitness, apprenticeship, and polynomials
• The slice algorithm for irreducible decomposition of monomial ideals
• PPLite: zero-overhead encoding of NNC polyhedra
• An algebraic algorithm for solving parametric integer programs
• Title not available (Why is that?)
• The algebra of conformal blocks
• Title not available (Why is that?)
• Covariant algebra of the binary nonic and the binary decimic
• 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
• Hilbert basis of the Lipman semigroup
• An algorithm to construct candidates to counterexamples to the Zassenhaus conjecture
• Minimal invariant Markov basis for sampling contingency tables with fixed marginals
• Betti numbers of Stanley-Reisner rings determine hierarchical Markov degrees
• Hypergraph encodings of arbitrary toric ideals
• Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities
• A class of statistical models to weaken independence in two-way contingency tables
• 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
• Equivariant Gr\"obner bases
• Hilbert bases for orthogonal arrays
• Syzygies for Metropolis base chains
• Algorithmic Aspects of Units in Group Rings
• \(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
• A generalization of the integer linear infeasibility problem
• On the prime graph question for integral group rings of 4-primary groups I
• On possible dimensions of subspace intersections for five direct summands
• The Smallest Normal Edge Polytopes with No Regular Unimodular Triangulations
• Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
• Neural ideals and stimulus space visualization
• Computing the integer points of a polyhedron. II: Complexity estimates
• Two Algebraic Byways from Differential Equations: Gröbner Bases and Quivers
• Phylogenetic complexity of the Kimura 3-parameter model
• Semigroups --- A Computational Approach
• The hypermetric cone and polytope on eight vertices and some generalizations
• 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
• Running Markov chain without Markov basis
• Normaliz: Algorithms for affine monoids and rational cones
• Existence of unimodular triangulations — positive results
• Exact inference in contingency tables via stochastic approximation Monte Carlo
• 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
• Geometric invariant theory and generalized eigenvalue problem. II
• Voronoi polytopes for polyhedral norms on lattices
• Representation of multivariate Bernoulli distributions with a given set of specified moments
• Graver basis for an undirected graph and its application to testing the beta model of random graphs
• Matrix representations for toric parametrizations
• A characterization of saturated designs for factorial experiments
• Algebraic combinatorics of diametric magic circles
• Comparing Metabolic Pathways through Reactions and Potential Fluxes
• 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
• Restrictions of characters in \(p\)-solvable groups
• 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
• Commutative algebra of statistical ranking
• Hilbert schemes and toric degenerations for low degree Fano threefolds
• Support sets in exponential families and oriented matroid theory
• Tropicalization of classical moduli spaces
• Finitely many smooth \(d\)-polytopes with \(n\) lattice points
• Computing convex hulls and counting integer points with \texttt{polymake}
• Cyclotomic polytopes and growth series of cyclotomic lattices
• Toric ideals of homogeneous phylogenetic models
• Markov bases and subbases for bounded contingency tables
• Three Counter-Examples on Semi-Graphoids
• Border bases for lattice ideals
• An algorithm for solving parametric integer program
• Finite phylogenetic complexity of \(\mathbb{Z}_p\) and invariants for \(\mathbb{Z}_3\)
• On the possible dimensions of subspace intersections
• Markov bases for noncommutative Fourier analysis of ranked data
• Multigraded commutative algebra of graph decompositions
• Sequential importance sampling for multiway tables
• The generic Gröbner walk
• Synthetic two-way contingency tables that preserve conditional frequencies

This page was built for software: 4ti2