Related papers: Decomposing conditional independence ideals with h…
We introduce a general constructive method to find a p-basis (and the Ulm invariants) of a finite Abelian p-group M. This algorithm is based on Groebner bases theory. We apply this method to determine the additive structure of…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
In combinatorial group testing problems Questioner needs to find a defective element $x\in [n]$ by testing subsets of $[n]$. In [18] the authors introduced a new model, where each element knows the answer for those queries that contain it…
We consider the model reduction problem for linear time-invariant dynamical systems having nonzero (but otherwise indeterminate) initial conditions. Building upon the observation that the full system response is decomposable as a…
We introduce a two-parameter modification of the cofinality invariant of ideals. This allows us to include the interaction of a pair of ideals in the study of base-like structures. We find the values (cardinal numbers or well-known cardinal…
In this paper the authors prove fundamental decomposition theorems pertaining to the internal structure of monoidal triangulated categories (M$\Delta$Cs). The tensor structure of an M$\Delta$C enables one to view these categories like…
One of the common obstacles for learning causal models from data is that high-order conditional independence (CI) relationships between random variables are difficult to estimate. Since CI tests with conditioning sets of low order can be…
The general decomposition theory of exponential operators is briefly reviewed. A general scheme to construct independent determining equations for the relevant decomposition parameters is proposed using Lyndon words. Explicit formulas of…
We consider the ring of coinvariants for modular representations of cyclic groups of prime order. For all cases for which explicit generators for the ring of invariants are known, we give a reduced Gr\"obner basis for the Hilbert ideal and…
Conditional independence models in the Gaussian case are algebraic varieties in the cone of positive definite covariance matrices. We study these varieties in the case of Bayesian networks, with a view towards generalizing the recursive…
A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…
We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bases or the interpolation method proposed in the first…
A natural candidate for a generating set of the (necessarily prime) defining ideal of an $n$-dimensional monomial curve, when the ideal is an almost complete intersection, is a full set of $n$ critical binomials. In a somewhat modified and…
We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…
A seminal result in the ICA literature states that for $AY = \varepsilon$, if the components of $\varepsilon$ are independent and at most one is Gaussian, then $A$ is identified up to sign and permutation of its rows (Comon, 1994). In this…
Causal inference methods based on conditional independence construct Markov equivalent graphs, and cannot be applied to bivariate cases. The approaches based on independence of cause and mechanism state, on the contrary, that causal…
We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…
Calibration is a conditional property that depends on the information retained by a predictor. We develop decomposition identities for arbitrary proper losses that make this dependence explicit. At any information level $\mathcal A$, the…
In this paper, we study the differential power operation on ideals. We begin with a focus on monomial ideals in characteristic 0 and find a class of ideals whose differential powers are eventually principal. We also study the containment…
A universal Gr\"obner basis of an ideal is the union of all its reduced Gr\"obner bases. It is contained in the Graver basis, the set of all primitive elements. Obtaining an explicit description of either of these sets, or even a sharp…