English
Related papers

Related papers: Decomposing conditional independence ideals with h…

200 papers

We study a class of determinantal ideals that are related to conditional independence (CI) statements with hidden variables. Such CI statements correspond to determinantal conditions on a matrix whose entries are probabilities of events…

Commutative Algebra · Mathematics 2023-01-02 Oliver Clarke , Fatemeh Mohammadi , Johannes Rauh

In this paper we describe the method which we applied to successfully compute the primary decomposition of a certain ideal coming from applications in combinatorial algebra and algebraic statistics regarding conditional independence…

Commutative Algebra · Mathematics 2019-07-18 Gerhard Pfister , Andreas Steenpass

We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gr\"obner basis. In this case, the ideal is radical, and we can describe algebraic and numerical…

Commutative Algebra · Mathematics 2019-03-01 Fatemeh Mohammadi , Johannes Rauh

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

alg-geom · Mathematics 2008-02-03 David Eisenbud , Bernd Sturmfels

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

Commutative Algebra · Mathematics 2014-06-18 Johannes Rauh

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…

Commutative Algebra · Mathematics 2009-10-16 Juergen Herzog , Takayuki Hibi , Freyja Hreinsdottir , Thomas Kahle , Johannes Rauh

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama

An explicit lattice point realization is provided for the primary components of an arbitrary binomial ideal in characteristic zero. This decomposition is derived from a characteristic-free combinatorial description of certain primary…

Commutative Algebra · Mathematics 2008-03-28 Alicia Dickenstein , Laura Felicia Matusevich , Ezra Miller

When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…

Commutative Algebra · Mathematics 2014-04-09 Yi-Huang Shen

In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.

Commutative Algebra · Mathematics 2019-01-11 Joydip Saha , Indranath Sengupta , Gaurab Tripathi

We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…

Commutative Algebra · Mathematics 2026-01-27 Fahimeh Khosh-Ahang Ghasr

We consider ideals arising in the context of conditional independence models that generalize the class of ideals considered by Fink [7] in a way distinct from the generalizations of Herzog-Hibi-Hreinsdottir-Kahle-Rauh [13] and Ay-Rauh [1].…

Commutative Algebra · Mathematics 2012-04-13 Irena Swanson , Amelia Taylor

We study zero divisors and minimal prime ideals in semirings of characteristic one. Thereafter we find a counterexample to the most obvious version of primary decomposition, but are able to establish a weaker version. Lastly, we study…

Probability · Mathematics 2013-11-01 Paul Lescot

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

Commutative Algebra · Mathematics 2019-02-20 Thomas Kahle , Ezra Miller , Christopher O'Neill

Taking a ring-theoretic perspective as our motivation, the main aim of this series is to establish a comprehensive theory of ideals in commutative quantales with an identity element. This particular article focuses on an examination of…

Rings and Algebras · Mathematics 2025-07-08 Amartya Goswami

Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences,…

Commutative Algebra · Mathematics 2015-09-11 Thomas Kahle , Ezra Miller

We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we consider are…

Commutative Algebra · Mathematics 2015-01-28 Kent M. Neuerburg , Zach Teitler

Ideals generated by adjacent 2-minors are studied. First, the problem when such an ideal is a prime ideal as well as the problem when such an ideal possesses a quadratic Gr\"obner basis is solved. Second, we describe explicitly a primary…

Commutative Algebra · Mathematics 2011-01-11 Juergen Herzog , Takayuki Hibi

We give a decomposition of the posterior predictive variance using the law of total variance and conditioning on a finite dimensional discrete random variable. This random variable summarizes various features of modeling that are used to…

Methodology · Statistics 2022-09-02 Dean Dustin , Bertrand Clarke

We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…

Machine Learning · Computer Science 2024-07-29 Avrim Blum , Kavya Ravichandran
‹ Prev 1 2 3 10 Next ›