Related papers: Graver bases of shifted numerical semigroups with …
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
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…
In this paper, we enumerate two families of pattern-avoiding permutations: those avoiding the vincular pattern $2-41-3$, which we call semi-Baxter permutations, and those avoiding the vincular patterns $2-41-3$, $3-14-2$ and $3-41-2$, which…
Let $K\langle X\rangle =K\langle X_1,...,X_n\rangle$ be the free algebra of $n$ generators over a field $K$, and let $R\langle X\rangle =R\langle X_1,...,X_n\rangle$ be the free algebra of $n$ generators over an arbitrary commutative ring…
Rewriting for semigroups is a special case of Groebner basis theory for noncommutative polynomial algebras. The fact is a kind of folklore but is not fully recognised. The aim of this paper is to elucidate this relationship, showing that…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
Graph Neural Networks (GNNs) have received increasing attention due to their ability to learn from graph-structured data. To open the black-box of these deep learning models, post-hoc instance-level explanation methods have been proposed to…
We introduce two families of generators (functions) $\mathcal{G}$ that consist of entire and meromorphic functions enjoying a certain periodicity property and contain the classical Gaussian and hyperbolic secant generators. Sharp results…
A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…
Several physics-based algorithms for factorizing large number were recently published. A notable recent one by Schleich et al. uses Gauss sums for distinguishing between factors and non-factors. We demonstrate two NMR techniques that…
For a positive integer $m$, a finite set of integers is said to be equidistributed modulo $m$ if the set contains an equal number of elements in each congruence class modulo $m$. In this paper, we consider the problem of determining when…
The purpose of this note is to revisit the proof of the Gearhardt-Pr\"uss-Hwang-Greiner theorem for a semigroup S(t), following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on the norm…
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…
For numerical semigroups with a specified list of (not necessarily minimal) generators, we describe the asymptotic distribution of factorization lengths with respect to an arbitrary modulus. In particular, we prove that the factorization…
We construct $2$-generator non-Hopfian groups $G_m, m=3, 4, 5, \dots$, where each $G_m$ has a specific presentation $G_m=\langle a, b \, | \, u_{r_{m,0}}=u_{r_{m,1}}=u_{r_{m,2}}= \cdots =1 \rangle$ which satisfies small cancellation…
For any $n\geq 1$, let $T_n$ be the complete binary rooted tree of height $n$, and $f(x)=(x+a)^2-a-1$ such that $a\neq \pm b^2$ for any $b\in \mathbb{Z}$. In \cite{Settled}, Jones and Boston empirically observed that iteratively applying a…
A Generalized Numeration Base is defined in this paper, and then particular cases are presented, such as Prime Base, Square Base, m-Power Base, Factorial Base, and operations in these bases. These bases are important for partitions of…
Value semigroups of non irreducible singular algebraic curves and their fractional ideals are submonoids of $\mathbb Z^n$ that are closed under infimums, have a conductor and fulfill a special compatibility property on their elements.…
In our previous papers we used the Hilbert scheme of points on $C^2$ in order to construct a triply graded link homology and its $gl(m)$ version. Here we extend the $gl(m)$ construction to super-algebras $gl(m|k)$.
We found Groebner-Shirshov basis for the braid semigroup $B^+_{n+1}$. It gives a new algorithm for the solution of the word problem for the braid semigroup and so for the braid group.