[BOOK][B] Monomial algebras
RH Villarreal - 2001 - api.taylorfrancis.com
The main purpose of this book is to introduce algebraic, combinatorial, and computational
methods to study monomial algebras and their presentation ideals, including Stanley …
methods to study monomial algebras and their presentation ideals, including Stanley …
Siphons in chemical reaction networks
Siphons in a chemical reaction system are subsets of the species that have the potential of
being absent in a steady state. We present a characterization of minimal siphons in terms of …
being absent in a steady state. We present a characterization of minimal siphons in terms of …
Combinatorial mutations and block diagonal polytopes
O Clarke, A Higashitani, F Mohammadi - Collectanea Mathematica, 2021 - Springer
Matching fields were introduced by Sturmfels and Zelevinsky to study certain Newton
polytopes, and more recently have been shown to give rise to toric degenerations of various …
polytopes, and more recently have been shown to give rise to toric degenerations of various …
Multigraded commutative algebra of graph decompositions
The toric fiber product is a general procedure for gluing two ideals, homogeneous with
respect to the same multigrading, to produce a new homogeneous ideal. Toric fiber products …
respect to the same multigrading, to produce a new homogeneous ideal. Toric fiber products …
Decompositions of commutative monoid congruences and binomial ideals
T Kahle, E Miller - Algebra & Number Theory, 2014 - msp.org
Primary decomposition of commutative monoid congruences is insensitive to certain
features of primary decomposition in commutative rings. These features are captured by the …
features of primary decomposition in commutative rings. These features are captured by the …
Chordal networks of polynomial ideals
We introduce a novel representation of structured polynomial ideals, which we refer to as
chordal networks. The sparsity structure of a polynomial system is often described by a …
chordal networks. The sparsity structure of a polynomial system is often described by a …
Parity binomial edge ideals
Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial
edge ideals, they do not have square-free Gröbner bases and are radical if and only if the …
edge ideals, they do not have square-free Gröbner bases and are radical if and only if the …
Decompositions of binomial ideals
T Kahle - Journal of Software for Algebra and Geometry, 2012 - msp.org
Abstract The Macaulay2 package Binomials contains implementations of specialized
algorithms for binomial ideals, including primary decomposition into binomial ideals. The …
algorithms for binomial ideals, including primary decomposition into binomial ideals. The …
Finding the maximizers of the information divergence from an exponential family
J Rauh - IEEE transactions on information theory, 2011 - ieeexplore.ieee.org
This paper investigates maximizers of the information divergence from an exponential family
\calE. It is shown that the rI-projection of a maximizer P to \calE is a convex combination of P …
\calE. It is shown that the rI-projection of a maximizer P to \calE is a convex combination of P …
Efficiently and effectively recognizing toricity of steady state varieties
We consider the problem of testing whether the points in a complex or real variety with non-
zero coordinates form a multiplicative group or, more generally, a coset of a multiplicative …
zero coordinates form a multiplicative group or, more generally, a coset of a multiplicative …