Related papers: Computation of dominant ideals
We find an explicit expression of the associated primes of monomial ideals as a colon by an element $v$, using the unique irredundant irreducible decomposition whose irreducible components are monomial ideals (Theorem 3.1). An algorithm to…
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…
Although being a crucial question for the development of machine learning algorithms, there is still no consensus on how to compare classifiers over multiple data sets with respect to several criteria. Every comparison framework is…
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 goal of this paper is to present examples of families of homogeneous ideals in the polynomial ring over a field that satisfy the following condition: every product of ideals of the family has a linear free resolution. As we will see,…
Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph…
We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.
Non-deterministic measurements are common in real-world scenarios: the performance of a stochastic optimization algorithm or the total reward of a reinforcement learning agent in a chaotic environment are just two examples in which…
We present a probabilistic algorithm to test if a homogeneous polynomial ideal $I$ defining a scheme $X$ in $\mathbb{P}^n$ is radical using Segre classes and other geometric notions from intersection theory. Its worst case complexity…
Bipartite determinantal ideals are introduced by Illian and the author as a vast generalization of the classical determinantal ideals intensively studied in commutative algebra, algebraic geometry, representation theory and combinatorics.…
An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…
We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical…
A cover by left ideals of an associative (not necessarily commutative or unital) ring $R$ is a collection of proper left ideals whose set-theoretic union equals $R$. If such a cover exists, then $\eta_\ell(R)$ is the cardinality of a…
This paper studies decision theoretic properties of benchmarked estimators which are of some importance in small area estimation problems. Benchmarking is intended to improve certain aggregate properties (such as study-wide averages) when…
We present a coherent Bayesian framework for selection of the most likely model from the five genetic models (genotypic, additive, dominant, co-dominant, and recessive) commonly used in genetic association studies. The approach uses a…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
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.
We study the number of generators of ideals in regular rings and ask the question whether $\mu(I)<\mu(I^2)$ if $I$ is not a principal ideal, where $\mu(J)$ denotes the number of generators of an ideal $J$. We provide lower bounds for the…
In this paper we study the equations of the elimination ideal associated with $n+1$ generic multihomogeneous polynomials defined over a product of projective spaces of dimension $n$. We first prove a duality property and then make this…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…