Related papers: Indispensable binomials in semigroup ideals

In 2019, V. A. Roman'kov introduced the concept of marginal sets for groups. He developed a theory of marginal sets and demonstrated how these sets can be applied to improve some key exchange schemes. In this paper, we extend his ideas and…

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

This work obtains all the right ideals, radicals, congruences and ideals of the affine near-semirings over Brandt semigroups.

The purpose of this article is to give, for any commutative ring A, an explicit minimal set of generators for the ring of multisymmetric functions TS^d_A(A[x_1,...,x_r]) as an A-algebra. In characteristic zero, i.e. when A is an algebra…

A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…

Let G be a finite abelian group and F a field such that char(F) does not divide |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I and J of FG are G-equivalent if there exists an…

We give a positive answer to the Huneke-Wiegand Conjecture for monomial ideals over free numerical semigroup rings, and for two generated monomial ideals over complete intersection numerical semigroup rings.

The necessary and sufficient condition of separability of a mixed state of any systems is presented, which is practical in judging the separability of a mixed state. This paper also presents a method of finding the disentangled…

A semiring is uniserial if its ideals are totally ordered by inclusion. First, we show that a semiring $S$ is uniserial if and only if the matrix semiring $M_n(S)$ is uniserial. As a generalization of valuation semirings, we also…

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 study the existence of minimal supersolutions of BSDEs under a family of mutually singular probability measures. We consider generators that are jointly lower semicontinuous, positive, and either convex in the control variable and…

In this paper, we introduce the concept of Arf special gaps of an Arf numerical semigroup, and an algorithm for computing all Arf special gaps of a given Arf numerical semigroup. We introduce the concept of Arf-irreducible numerical…

Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…

The main achievement of this paper is to provide a structure theorem for Artinian, Gorenstein local rings with the property that the square of the maximal ideal is generated by two elements. The moduli problem for this class of local…

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we…