Abstract

We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and Frobenius number of random semigroups. Our results follow, surprisingly, from the construction of a very natural shellable simplicial complex whose facets are in bijection with irreducible numerical semigroups of a fixed Frobenius number and whose $h$-vector determines the probability that a particular element lies in the semigroup.

Highlights

  • A numerical semigroup is a subset S ⊂ Z 0 that is closed under addition

  • Part (a) of Theorem 1 follows from standard arguments in probabilistic combinatorics (Theorem 5), parts (b) and (c) follow, surprisingly, from the construction of a very natural shellable simplicial complex (Definition 8) whose facets are in bijection with irreducible numerical semigroups of a fixed Frobenius number (Definition 7)

  • Before proving the remaining parts of Theorem 1, we introduce in Definition 8 a simplicial complex whose combinatorial properties govern several questions arising from the ER-type model for sampling random numerical semigroups

Read more

Summary

Introduction

A numerical semigroup is a subset S ⊂ Z 0 that is closed under addition (we do not require S to have finite complement in Z 0). Part (a) of Theorem 1 follows from standard arguments in probabilistic combinatorics (Theorem 5), parts (b) and (c) follow, surprisingly, from the construction of a very natural shellable simplicial complex (Definition 8) whose facets are in bijection with irreducible numerical semigroups of a fixed Frobenius number (Definition 7). As it turns out, some of the probabilities involved in determining the expected values above require precisely the h-vector (in the sense of algebraic combinatorics [21]) for this simplicial complex. Through the h-vector, we distinguish parts (b) and (c) of Theorem 1 (Corollary 26) and estimate the finite expectations (Theorem 30)

Distribution and cofiniteness
The simplicial complex of irreducible semigroups
Expected number of minimal generators
Findings
Approximations
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.