Related papers: Constructing Numerical Semigroups of a Given Genus

In this paper we give a survey of recent methods for the asymptotic and exact enumeration of number fields with given Galois group of the Galois closure. In particular, the case of fields of degree up to 4 is now almost completely solved,…

The adjoint action of a finite group of Lie type on its Lie algebra is studied. A simple formula is conjectured for the number of split semisimple orbits of a given genus. This conjecture is proved for type A, and partial results are…

Let $\mathcal C \subset \mathbb N^p$ be a finitely generated integer cone and $S\subset \mathcal C$ be an affine semigroup such that the real cones generated by $\mathcal C$ and by $S$ are equal. The semigroup $S$ is called $\mathcal…

In this paper we study numerical semigroups of Sally type of multiplicity $e$ and embedding dimension $\nu \ge e-2$. We construct the minimal resolutions for these semigroup rings when they are symmetric and compute their Betti numbers. We…

Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…

We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new…

In this memoir, we seek to construct a constructive theory that is as complete as possible to describe the algebraic properties of the real number field in constructive mathematics without a dependent choice axiom. To this purpose, we use a…

We study suitable parameters and relations in a numerical semigroup S. When S is the Weierstrass semigroup at a rational point P of a projective curve C, we evaluate the Feng-Rao order bound of the associated family of Goppa codes. Further…

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…

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…

Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic…

A numerical semigroup is a submonoid of ${\mathbb Z}_{\ge 0}$ whose complement in ${\mathbb Z}_{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality…

We consider numerical semigroups $S_3 = \langle d_1,d_2,d_3\rangle$, minimally generated by three positive integers. We revisit the Wilf question in $S_3$ and, making use of identities for degrees of syzygies of such semigroups, give a…

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…

There is a well-known combinatorial definition, based on ordered set partitions, of the semigroup of faces of the braid arrangement. We generalize this definition to obtain a semigroup Sigma_n^G associated with G wr S_n, the wreath product…

Let 0 < a < b be two relatively prime integers and let <a,b> be the numerical semigroup generated by a and b with Frobenius number g(a,b)=ab-a-b. In this note, we prove that there exists a prime number p in <a,b> with p < g(a,b) when the…

We give an explicit set of generators for the semigroup of the Gr\"obner degeneration of a toric ideal. This set of generators is used to study algebraic properties of the semigroup it generates: approximation of semigroups,…

We introduce a new class of numerical semigroups, which we call the class of {\it acute} semigroups and we prove that they generalize symmetric and pseudo-symmetric numerical semigroups, Arf numerical semigroups and the semigroups generated…

The conception of multi-alphabetical genetics is represented. Matrix forms of the representation of the multi-level system of molecular-genetic alphabets have revealed algebraic properties of this system. These properties are connected with…