Search arXivSearch

arXiv · 2012.01358

An extension of the Wilf conjecture to semimodules over a numerical semigroup

Abstract

The aim of this paper is to propose an extension of the Wilf conjecture to semimodules over a numerical semigroup through a new approach toward the solution of the Wilf conjecture on numerical semigroups. The key point is the introduction of a new invariant that we call Wilf function of a semigroup that can be also defined for a semimodule over the semigroup. We also study the relation of the Wilf function of a semigroup and the Wilf function of certain semimodules associated to a gap of the semigroup. As a consequence, we obtain an alternative conjecture which also implies the Wilf conjecture. Finally, we show that the natural generalization of Wilf conjecture to semimodules over the semigroup does not work unless we used the Wilf function of the semimodule. In this direction, we propose several questions regarding the possible extensions of Wilf-type inequalities for semimodules.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patricio Almirón, Julio José Moyano-Fernández. 2021-06-17. An extension of the Wilf conjecture to semimodules over a numerical semigroup. https://arxiv.org/abs/2012.01358

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