相关论文: Adjoining identities and zeros to semigroups
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
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…
Motivated by appearance of multisemigroups in the study of additive $2$-categories, we define and investigate the notion of a multisemigroup with multiplicities. This notion seems to be better suitable for applications in higher…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
New notions are introduced in algebra in order to better study the congruences in number theory. For example, the <special semigroups> makes an important such contribution.
The semigroup $B_0$ is the only, up to isomorphism, 4-element subsemigroup of the 5-element Brandt semigroup $B_2$. Being an inverse semigroup, the semigroup $B_2$ can naturally be considered an additively idempotent semiring and $B_0$ is…
In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…
We develop a theory of ordered *-vector spaces with an order unit. We prove fundamental results concerning positive linear functionals and states, and we show that the order (semi)norm on the space of self-adjoint elements admits multiple…
Uninorms play a prominent role both in the theory and the applications of Aggregations and Fuzzy Logic. In this paper the class of group-like uninorms is introduced and characterized. First, two variants of a general construction -- called…
We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…
Let K be a field of positive characteristic p, let R be either a group algebra K[G] or a restricted enveloping algebra u(L), and let I be the augmentation ideal of R. We first characterize those R for which I satisfies a polynomial identity…
In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…
A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a…
In this work we present a new class of numerical semigroups called GSI-semigroups. We see the relations between them and others families of semigroups and we give explicitly their set of gaps. Moreover, an algorithm to obtain all the…
Pre-trained word embeddings learned from unlabeled text have become a standard component of neural network architectures for NLP tasks. However, in most cases, the recurrent network that operates on word-level representations to produce…
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…
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…