Related papers: Combinatorially rich sets in partial semigroups
Semiuniform semigroups provide a natural setting for the convolution of generalized finite measures on semigroups. A semiuniform semigroup is said to be ambitable if each uniformly bounded uniformly equicontinuous set of functions on the…
We extend the usual notion of fully commutative elements from the Coxeter groups to the complex reflection groups. Then we decompose the sets of fully commutative elements into natural subsets according to their combinatorial properties,…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
Let $H$ be a numerical semigroup. We give effective bounds for the multiplicity $e(H)$ when the associated graded ring $\operatorname{gr}_\mathfrak{m} K[H]$ is defined by quadrics. We classify Koszul complete intersection semigroups in…
Let $X(G)=GC$ be a group, where $G$ is a semi dihedral group and $C$ is a cyclic group such that $G\cap C=1$. In this paper, $X(G)$ will be characterized.
As a common non-trivial generalization of the concept of a proper generalized Bassian group, we introduce the notion of a semi-generalized Bassian group and initiate its comprehensive investigation. Precisely, we give a satisfactory…
We study definable J-sets for definable groups and compare them with weakly generic sets. We show that the property that J-sets coincide with weakly generic sets is invariant on enough saturated models, and hence a model-theoretical…
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…
This paper determines almost symmetric numerical semigroups with maximal reduced type completely. In addition, this paper classifies MED-semigroups with maximal reduced type.
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
This paper studies a subset of the free semi-group $F_k$ with letters in a field $k$ which has some interesting arithmetic and combinatorial properties.
Multiplicative matrix semigroups with constant spectral radius (c.s.r.) are studied and applied to several problems of algebra, combinatorics, functional equations, and dynamical systems. We show that all such semigroups are characterized…
In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…
Cross-connection theory provides the construction of a semigroup from its ideal structure using small categories. A concordant semigroup is an idempotent-connected abundant semigroup whose idempotents generate a regular subsemigroup. We…
In the first section of the present work, we introduce the concept of pseudocomplementation for semirings and show semiring version of some known results in lattice theory. We also introduce semirings with pc-functions and prove some…
A description of all subsemigroups of $M_2(\mathbb{C})$ which are given by a countable intersection of constructible sets is given. Furthermore, it is shown that they are intersections of constructible semigroups.
Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…
Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.
Ideal series of semigroups play an important role in the examination of semigroups which have proper two-sided ideals. But the corresponding theorems cannot be used when left simple (or right simple or simple) semigroups are considered. So…