Related papers: Generic numerical semigroups
Let $\mathbb{N}^{d}$ be the $d$-dimensional monoid of non-negative integers. A generalized numerical semigroup is a submonoid $ S\subseteq \mathbb{N}^d$ such that $H(S)=\mathbb{N}^d \setminus S$ is a finite set. We introduce irreducible…
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…
Let $I=[0,1)$ and $\mathcal{PC}(I)$ [resp. $\mathcal{PC}^+(I)$] be the quotient group of the group of all piecewise continuous [resp. piecewise continuous and orientation preserving] bijections of $I$ by its normal subgroup consisting in…
A classical result about unit equations says that if $\Gamma_1$ and $\Gamma_2$ are finitely generated subgroups of $\mathbb C^\times$, then the equation $x+y=1$ has only finitely many solutions with $x\in\Gamma_1$ and $y\in \Gamma_2$. We…
Answering a question of Geoff Robinson, we compute the large n limiting proportion of i(n,q)/q^[n^2/2], where i(n,q) denotes the number of involutions in GL(n,q). We give similar results for the finite unitary, symplectic, and orthogonal…
Let $\mathcal{C}\subseteq \mathbb{N}^p$ be an integer cone. A $\mathcal{C}$-semigroup $S\subseteq \mathcal{C}$ is an affine semigroup such that the set $\mathcal{C}\setminus S$ is finite. Such $\mathcal{C}$-semigroups are central to our…
We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…
For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier…
Let A be a set of positive integers with gcd(A) = 1, and let p_A(n) be the partition function of A. Let c = \pi \sqrt(2/3). Let \alpha > 0. It is proved that log p_A(n) ~ c\sqrt(\alpha n) if and only if the set A has asymptotic density…
Three conjectures #1999--8, #1999--9 and #1999--10 which were posed by V. Arnold [2] and devoted to the statistics of the numerical semigroups are refuted for the case of semigroups generated by three positive integers d_1,d_2,d_3 with…
The goal of this note is to show how recent results on the theory of quasi-stationary distributions allow to deduce effortlessly general criteria for the geometric convergence of normalized unbounded semigroups.
In this paper, we derive an asymptotic formula for the number of conjugacy classes of elements in a class of statistically convex-cocompact actions with contracting elements. Denote by $\mathcal C(o, n)$ (resp. $\mathcal C'(o, n)$) the set…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
It is a remarkable fact that for many statistics on finite sets of combinatorial objects, the roots of the corresponding generating function are each either a complex root of unity or zero. These and related polynomials have been studied…
We derive polynomial identities of arbitrary degree $n$ for syzygies degrees of numerical semigroups S_m=<d_1,...,d_m> and show that for n>=m they contain higher genera G_r=\sum_{s\in Z_>\setminus S_m}s^r of S_m. We find a number…
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…
We give an example of a non-trivial asymptotic representation of the reduced C*-algebra of a free group. This example allows to evaluate the asymptotic tensor C*-norm of some elements in tensor product C*-algebras and to show…
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…
The finite symplectic group Sp(2g) over the field of two elements has a natural representation on the vector space of Siegel modular forms of given weight for the principal congruence subgroup of level two. In this paper we decompose this…
A simple way of computing the Ap\'ery set of a numerical semigroup (or monoid) with respect to a generator, using Groebner bases, is presented, together with a generalization for affine semigroups. This computation allows us to calculate…