Related papers: A generalization of Wilf's conjecture for Generali…
In this paper, we systematically study generalized Markov numbers arising from semigroups of reduced integer matrices. This construction allows us to find these numbers by counting perfect matchings of a new family of bipartite graphs,…
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…
Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…
We prove the semisimplicity conjecture for A-motives over finitely generated fields K. This conjecture states that the rational Tate modules V_p(M) of a semisimple A-motive M are semisimple as representations of the absolute Galois group of…
In this work, the notion of a quantum inverse semigroup is introduced as a linearized generalization of inverse semigroups. Beyond the algebra of an inverse semigroup, which is the natural example of a quantum inverse semigroup, several…
By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on…
In this article, we study the quotients of numerical semigroups, generated by two coprime positive numbers, named (a,b) over d. We give formulae for the usual invariants of these semigroups, expressed in terms of continued fraction…
For a prime number $p$ and a number field $k$, let $\tilde{k}$ be the compositum of all $\mathbb{Z}_p$-extensions of $k$. Greenberg's Generalized Conjecture (GGC) claims the pseudo-nullity of the unramified Iwasawa module $X(\tilde{k})$ of…
We give a graphical reinterpretation of the seeds algorithm to explore the tree of numerical semigroups. We then exploit the seeds algorithm to find all the Eliahou semigroups of genus up to 65. Since all these semigroups satisfy the Wilf…
Let $\mathsf{r}_k$ be the unique positive root of $x^k - (x+1)^{k-1} = 0$. We prove the best known bounds on the number $n_{g,d}$ of $d$-dimensional generalized numerical semigroups, in particular that \[n_{g,d} > C_d^{g^{(d-1)/d}}…
We prove a natural generalization of Szep's conjecture. Given an almost simple group $G$ with socle not isomorphic to an orthogonal group having Witt defect zero, we classify all possible group elements $x,y\in G\setminus\{1\}$ with $G={\bf…
Given two numerical semigroups $S$ and $T$ we say that $T$ is a multiple of $S$ if there exists an integer $d \in \mathbb{N} \setminus \{0\}$ such that $S = \{x \in \mathbb{N} \mid d x \in T\}$. In this paper we study the family of…
In this paper we give an algorithm for the computation of all the Arf numerical semigroups with a given genus. Moreover, we generalize the concept of genus of a numerical semigroup to good semigroups of $\mathbb{N}^r$ and we give a…
In this paper we introduce the new concepts of supersymmetric and self-symmetric gaps of a numerical semigroup with two generators. Those concepts are based on certain symmetries of the gaps of the semigroup with respect to their Wilf…
Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…
An $\mathcal{A}$-semigroup is a numerical semigroup without consecutive small elements. This work generalizes this concept to finite-complement submonoids of an affine cone $\mathcal{C}$. We develop algorithmic procedures to compute all…
We study the structure of the family of numerical semigroups with fixed multiplicity and Frobenius number. We give an algorithmic method to compute all the semigroups in this family. As an application we compute the set of all numerical…
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…
Let $G$ be a finite group and $G'$ its commutator subgroup. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered…
We prove Carlos Simpson's "semi-strictification" (or "weak unit") conjecture in the case of infinity-groupoids. More precisely, we introduce two precise versions of the conjecture, the "general" and the "regular" conjecture, involving two…