Search arXivSearch

arXiv · 1912.09355

Density of Numerical sets associated to a Numerical semigroup

Abstract

A numerical set is a co-finite subset of the natural numbers that contains zero. Its Frobenius number is the largest number in its complement. Each numerical set has an associated semigroup $A(T)=\{t\mid t+T\subseteq T\}$, which has the same Frobenius number as $T$. For a fixed Frobenius number $f$ there are $2^{f-1}$ numerical sets. It is known that there is a number $γ$ close to $0.484$ such that the ratio of these numerical sets that are mapped to $N_f=\{0\}\cup(f,\infty)$ is asymptotically $γ$. We identify a collection of families $N(D,f)$ of numerical semigroups such that for a fixed $D$ the ratio of the $2^{f-1}$ numerical sets that are mapped to $N(D,f)$ converges to a positive limit as $f$ goes to infinity. We denote the limit as $γ_D$, these constants sum up to $1$ meaning that they asymptotically account for almost all numerical sets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Deepesh Singhal, Yuxin Lin. 2020-08-02. Density of Numerical sets associated to a Numerical semigroup. https://doi.org/10.1080/00927872.2021.1918136

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO