Related papers: Quasi-ordinarization transform of a numerical semi…
Our aim is to show the way we pass from the results of ordered semigroups (or semigroups) to ordered $\Gamma$-semigroups (or $\Gamma$-semigroups). The results of this note have been transferred from ordered semigroups. The concept of…
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…
Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…
We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…
In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…
Over the past decade, random forest models have become widely used as a robust method for high-dimensional data regression tasks. In part, the popularity of these models arises from the fact that they require little hyperparameter tuning…
We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…
Let $G$ be a finite group acting transitively on a set $\Omega$. We study what it means for this action to be {\it quasirandom}, thereby generalizing Gowers' study of quasirandomness in groups. We connect this notion of quasirandomness to…
A quasi-semiregular element in a permutation group is an element that has a unique fixed point and acts semiregularly on the remaining points. Such elements were first studied in the context of automorphisms of graphs and occur naturally in…
Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…
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 investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…
We introduce a preorder on an inverse semigroup $S$ associated to any normal inverse subsemigroup $N$, that lies between the natural partial order and Green's ${\mathscr J}$-relation. The corresponding equivalence relation $\simeq_N$ is not…
We provide a new and much simpler structure for quasi-ideal adequate transversals of abundant semigroups in terms of spined products, which is similar in nature to that given by Saito for weakly multiplicative inverse transversals of…
We suggest a natural approach that leads to a modification of classical quasispecies models and incorporates the possibility of population extinction in addition to growth. The resulting modified models are called open. Their essential…
Dlab and Ringel showed that algebras being quasi-hereditary in all total orders for indices of primitive idempotents becomes hereditary. So, we are interested in for which orders a given quasi-hereditary algebra is again quasi-hereditary.…
This paper investigates the use of quasigroups, Hadamard transforms and Number Theoretic Transforms for use in sequence randomization. This can also be used to generate hash functions for sequence encryption.
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…
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
This paper introduces hierarchical quasi-clustering methods, a generalization of hierarchical clustering for asymmetric networks where the output structure preserves the asymmetry of the input data. We show that this output structure is…