Related papers: Bipartite Determinantal Ideals and concurrent vert…
Geometric vertex decomposition and liaison are two frameworks that have been used to produce similar results about similar families of algebraic varieties. In this paper, we establish an explicit connection between these approaches. In…
We survey some of the major results about normal Hilbert polynomials of ideals. We discuss a formula due to Lipman for complete ideals in regular local rings of dimension two, theorems of Huneke, Itoh, Huckaba, Marley and Rees in…
Many classical ring-theoretic results state that an ideal that is maximal with respect to satisfying a special property must be prime. We present a "Prime Ideal Principle" that gives a uniform method of proving such facts, generalizing the…
We introduce deterministic concurrent systems as a subclass of concurrent systems. Deterministic concurrent system are "locally commutative" concurrent systems. We prove that irreducible and deterministic concurrent systems have a unique…
We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…
Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…
We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…
Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
Let $A$ be a commutative algebra equipped with an action of a group $G$. The so-called $G$-primes of $A$ are the equivariant analogs of prime ideals, and of central importance in equivariant commutative algebra. When $G$ is an infinite…
In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…
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…
We study a family of determinantal ideals whose decompositions encode the structural zeros in conditional independence models with hidden variables. We provide explicit decompositions of these ideals and, for certain subclasses of models,…
We present new algorithms for computing adjoint ideals of curves and thus, in the planar case, adjoint curves. With regard to terminology, we follow Gorenstein who states the adjoint condition in terms of conductors. Our main algorithm…
Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant…
This paper presents a bicomplex version of the Spectral Decomposition Theorem on infinite dimensional bicomplex Hilbert spaces. In the process, the ideas of bounded linear operators, orthogonal complements and compact operators on bicomplex…
We define nice partitions of the multicomplex associated to a Stanley ideal. As the main result we show that if the monomial ideal $I$ is a CM Stanley ideal, then $I^p$ is a Stanley ideal as well, where $I^p$ is the polarization of $I$.