Related papers: On arithmetical numerical monoids with some genera…
Entwined modules over cowreaths in a monoidal category are introduced. They can be identified to coalgebras in an appropriate monoidal category. It is investigated when such coalgebras are Frobenius (resp. separable), and when the forgetful…
Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then any graph product is, of course, a group.…
We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing…
It is known that the Frobenius algebra of the injective hull of the residue field of a complete Stanley--Reisner ring (i.e. a formal power series ring modulo a squarefree monomial ideal) can be only principally generated or infinitely…
In this paper we study numerical semigroups generated by three elements. We give a characterization of pseudo-symmetric numerical semigroups. Also, we will give a simple algorithm to get all the pseudo-symmetric numerical semigroups with…
A numerical set is a co-finite subset of the natural numbers that contains zero. Its Frobenius number is the largest number in its complement. Each numerical set has an associated semigroup $A(T)=\{t\mid t+T\subseteq T\}$, which has the…
We study commutative algebra arising from generalised Frobenius numbers. The $k$-th (generalised) Frobenius number of natural numbers $(a_1,\dots,a_n)$ is the largest natural number that cannot be written as a non-negative integral…
A semidomain is a subsemiring of an integral domain. We call a semidomain $S$ additively reduced if $0$ is the only invertible element of the monoid $(S, +)$, while we say that $S$ is additively Furstenberg if every non-invertible element…
We study monoids generated by Zariski-van Kampen generators in the 17 fundamental groups of the complement of logarithmic free divisors in C^3 listed by Sekiguchi (Theorem 1). Five of them are Artin monoids and eight of them are free…
We investigate various connections between the 0-Hecke monoid, Catalan monoid, and pattern avoidance in permutations, providing new tools for approaching pattern avoidance in an algebraic framework. In particular, we characterize…
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…
A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…
Existence of long arithmetic progression in sumsets and subset sums has been studied extensively in the field of additive combinatorics. These additive combinatorics results play a central role in the recent progress of fundamental problems…
The well-known expansion of rational integers in an arbitrary integer base different from $0, 1, -1$ is exploited to study relations between numerical monoids and certain subsemigroups of the multiplicative semigroup of nonzero integers.
Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…
This work investigates the Frobenius morphism on derived categories associated with algebraic stacks in positive characteristic. Particularly, we show that in many cases sufficiently many Frobenius pushforwards of a compact generator…
Studying ceratin combinatorial properties of non-unique factorizations have been a subject of recent literatures. Little is known about two combinatorial invariants, namely the catenary degree and the tame degree, even in the case of…
The Frobenius number for a set of relatively prime positive integers, where the smallest integer in the set is at least 2, is the largest integer that cannot be expressed as a nonnegative linear combination of those integers. We analyze the…
This paper explores whether or not a complete ternary full adder, whose input variables can independently be '0', '1', or '2', is indispensable in the arithmetic blocks of adder, subtractor, and multiplier. Our investigations show that none…
In the Frobenius problem we are given a set of coprime, positive integers $a_1, a_2,...,a_k$, and are interested in the set of positive numbers NR that have no representation by the linear form $\sum_i a_ix_i$ in nonnegative integers $x_1,…