Related papers: Combinatorially rich sets in partial semigroups
In this article, we compare two different notions of partially defined group strutures, namely partial groups and pregroups, as introduced by Chermak and Stallings respectively. In particular we prove that the category of pregroups can be…
A small part of real line which is very close to zero has rich combinatorial properties. The aim of this paper is to express and then prove some locally combinatorial concepts near a virtual idempotent by considering the…
N. Hindman and D. Strauss had shown that, for discrete semigroups, the cartesian product of two central sets are central. They also proved that the product of J- sets and C-sets are also J-set and C-set and characterized when the infnite…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
In this paper we characterize left(right) ideals, bi-ideals and quasi-ideals of an ordered semigroup by an index $m$ and give some important interplays between these ideals. The concept of m-regularity of an ordered semigroups has been…
We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs,…
Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we…
Let R be a class of groups closed under taking semidirect products with finite kernel and fully residually R-groups. We prove that R contains all R-by-{finitely generated residually finite} groups. It follows that a semidirect product of a…
A subset $A$ of $\mathbb{N}$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\in \mathbb{N}} $ of natural numbers. Central sets, first introduced by Furstenberg using notions from…
We investigate ideal-semisimple and congruence-semisimple semirings. We give several new characterizations of such semirings using e-projective and e-injective semimodules. We extend several characterizations of semisimple rings to (not…
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…
This paper demostrates a method for analysing almost CR geometries $(H,J)$, by uniquley defining a partially integrable structure $(H,K)$ from the same data. Thus two almost CR geometries $(H,J)$ and $(H',J')$ are equivalent if and and only…
Various kinds of infinitary operations satisfying forms of associativity have been considered in the literature by various authors, including A. Tarski, C. Karp, J. H. Conway, D. Krob, N. Bedon, and C. Rispal. Applications include the…
Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{P}_{n}$ be the semigroup of partial transformations on $[n]$. Let $\mathcal{CP}_{n}=\{\alpha\in \mathcal{P}_{n}: (for ~all~x,y\in Dom~\alpha)~|x\alpha-y\alpha|\leq|x-y|\}$ be…
Motivated by recent appearance of multivalued structures in categorification, tropical geometry and other areas, we study basic properties of abstract multisemigroups. We give many new and old examples and general constructions for…
In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
Motivated by the change-making problem, we extend the notion of greediness to sets of positive integers not containing the element $1$, and from there to numerical semigroups. We provide an algorithm to determine if a given set (not…
Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…
We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…