Related papers: Combinatorics of binomial primary decomposition
Since for the classification of finite (congruence-)simple semirings it remains to classify the additively idempotent semirings, we progress on the characterization of finite simple additively idempotent semirings as semirings of…
Discrete tomography is concerned with the reconstruction of images that are defined on a discrete set of lattice points from their projections in several directions. The range of values that can be assigned to each lattice point is…
In this note we study the relationship between ideals and congruences of the tropical polynomial and Laurent polynomial semirings. We show that the variety of a non-zero prime ideal of the tropical (Laurent) polynomial semiring consists of…
It is shown that any set of nonzero monomial prime ideals can be realized as the stable set of associated prime ideals of a monomial ideal. Moreover, an algorithm is given to compute the stable set of associated prime ideals of a monomial…
We introduce the subsemigroup complex of a finite semigroup S as a (boolean representable) simplicial complex defined through chains in the lattice of subsemigroups of S. We present a research program for such complexes, illustrated through…
For a central, not necessarily reduced, hyperplane arrangement $f$ equipped with any factorization $f = f_{1} \cdots f_{r}$ and for $f^{\prime}$ dividing $f$, we consider a more general type of Bernstein--Sato ideal consisting of the…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…
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…
Motivated by situations in which the removal of a zero (a.k.a., an absorbing element) from a semigroup yields a subsemigroup with another zero, sets of quasi-zeros (a.k.a., quasi-absorbing elements) are introduced as well as primitive…
In this paper using the connections between some subvarieties of residuated lattices, we investigated some properties of the lattice of ideals in commutative and unitary rings. We give new characterizations for commutative rings $A$ in…
We describe first-degree prime ideals of biquadratic extensions in terms of first-degree prime ideals of two underlying quadratic fields. The identification of the prime divisors is given by numerical conditions involving their ideal norms.…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
In this paper, we prove prime avoidance for ringoids. We also generalize McCoy's and Davis' prime avoidance theorems in the context of semiring theory. Next, we proceed to define and characterize compactly packed semirings and show that a…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…