English
Related papers

Related papers: Decomposing conditional independence ideals with h…

200 papers

Representation learning assumes that real-world data is generated by a few semantically meaningful generative factors (i.e., sources of variation) and aims to discover them in the latent space. These factors are expected to be causally…

Machine Learning · Computer Science 2023-10-27 Xiaoyu Liu , Jiaxin Yuan , Bang An , Yuancheng Xu , Yifan Yang , Furong Huang

In the article "Non-commutative Grobner bases for commutative algebras", Eisenbud-Peeva-Sturmfels proved a number of results regarding Grobner bases and initial ideals of those ideals in the free associative algebra which contain the…

Commutative Algebra · Mathematics 2007-05-23 Andreas Nilsson , Jan Snellman

In this paper, binomial difference ideals are studied. Three canonical representations for Laurent binomial difference ideals are given in terms of the reduced Groebner basis of Z[x]-lattices, regular and coherent difference ascending…

Symbolic Computation · Computer Science 2016-03-15 Xiao-Shan Gao , Zhang Huang , Chun-Ming Yuan

The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…

Commutative Algebra · Mathematics 2013-08-09 Juan Ignacio García-García , M. Ángeles Moreno-Frías , Alberto Vigneron-Tenorio

We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.

Commutative Algebra · Mathematics 2013-10-15 Jürgen Herzog , Marius Vladoiu

In this paper we introduce the concept of a prime radical of an ideal of an L-ring L(mu,R) . Among various results pertaining to this concept, we prove here that prime radicals of an ideal eta, its radical , its semiprime radical S(eta) and…

Rings and Algebras · Mathematics 2025-08-22 Naseem Ajmal , Anand Swaroop Prajapati

We show that there can be no finite list of conditional independence relations which can be used to deduce all conditional independence implications among Gaussian random variables. To do this, we construct, for each $n> 3$ a family of $n$…

Probability · Mathematics 2007-05-23 Seth Sullivant

This paper propose a novel decomposable graphical model to accommodate skew Gaussian graphical models. We encode conditional independence structure among the components of the multivariate closed skew normal random vector by means of a…

Methodology · Statistics 2013-09-23 Hamid Zareifard , Havard Rue , Majid Jafari Khaledi , Finn Lindgren

Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. These mesoprimary…

Commutative Algebra · Mathematics 2018-08-15 Christopher O'Neill

We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…

Combinatorics · Mathematics 2026-02-03 João Dias , Bruno Dinis , Carlos Correia Ramos

For a joint probability density function f(x) of a random vector X the mixed partial derivatives of log f(x) can be interpreted as limiting cumulants in an infinitesimally small open neighborhood around x. Moreover, setting them to zero…

Statistics Theory · Mathematics 2011-02-11 Daniel Bruynooghe , Henry P. Wynn

We introduce a novel framework for decomposing interventional causal effects into synergistic, redundant, and unique components, building on the intuition of Partial Information Decomposition (PID) and the principle of M\"obius inversion.…

Artificial Intelligence · Computer Science 2025-09-22 Abel Jansma

A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…

Symbolic Computation · Computer Science 2017-03-01 Dongming Wang , Rina Dong , Chenqi Mou

We develop a functorial framework for the ideal theory of commutative semirings using coherent frames and spectral spaces. Two central constructions-the radical ideal functor and the $k$-radical ideal functor-are shown to yield coherent…

Rings and Algebras · Mathematics 2025-06-17 Pronay Biswas , Amartya Goswami , Sujit Kumar Sardar

Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…

Probability · Mathematics 2025-06-24 Matthias Georg Mayer

Conditional independence in a multivariate normal (or Gaussian) distribution is characterized by the vanishing of subdeterminants of the distribution's covariance matrix. Gaussian conditional independence models thus correspond to algebraic…

Statistics Theory · Mathematics 2009-10-29 Mathias Drton , Han Xiao

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

Representation Theory · Mathematics 2024-10-28 Marko Čmrlec

Let I be either the ideal of maximal minors or the ideal of 2-minors of a row graded or column graded matrix of linear forms L. In two previous papers we showed that I is a Cartwright-Sturmfels ideal, that is, the multigraded generic…

Commutative Algebra · Mathematics 2016-09-01 Aldo Conca , Emanuela De Negri , Elisa Gorla

We propose a new class of models for random permutations, which we call log-linear models, by the analogy with log-linear models used in the analysis of contingency tables. As a special case, we study the family of all Luce-decomposable…

Statistics Theory · Mathematics 2007-11-19 V. Csiszár

This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…

Data Structures and Algorithms · Computer Science 2019-08-01 Richard Kueng , Joel A. Tropp
‹ Prev 1 3 4 5 6 7 10 Next ›