Related papers: Patterns on Numerical Semigroups
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is to…
This paper presents and analysis the common existing sequential pattern mining algorithms. It presents a classifying study of sequential pattern-mining algorithms into five extensive classes. First, on the basis of Apriori-based algorithm,…
It is shown that a group defined by forbidding all patterns of size s+1 that do not appear in a given self-similar group of tree automorphisms is the topological closure of a self-similar, countable, regular branch group, branching over its…
A countable semigroup is $\aleph_0$-categorical if it can be characterised, up to isomorphism, by its first-order properties. In this paper we continue our investigation into the $\aleph_0$-categoricity of semigroups. Our main results are a…
There has been significant recent interest in studying how the number of numerical semigroups of genus $g$ behaves as a function of $g$. Bras-Amor\'os has shown how to organize the collection of numerical semigroups of genus $g$ into a…
The cyclic graph $\Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such…
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…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
Modern order and lattice theory provides convenient mathematical tools for pattern mining, in particular for condensed irredundant representations of pattern spaces and their efficient generation. Formal Concept Analysis (FCA) offers a…
In this work, we study good semigroups of $\mathbb{N}^n$ introducing the definition of length and genus for these objects. We show how to count the local good semigroup with a fixed genus. Furthermore, we study the relationships of these…
The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…
We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…
Starting from the symmetric group $S_n$, we construct two fiat $2$-categories. One of them can be viewed as the fiat "extension" of the natural $2$-category associated with the symmetric inverse semigroup (considered as an ordered semigroup…
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.
A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
Ehresmann semigroups may be viewed as biunary semigroups equipped with domain and range operations satisfying some equational laws. Motivated by some of the main examples, we here define ordered Ehresmann semigroups, and consider their…
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…
In this paper we present a procedure to build the set of irreducible numerical semigroups with a fixed Frobenius number. The construction gives us a rooted tree structure for this set. Furthermore, by using the notion of Kunz-coordinates…