Search arXivSearch

arXiv · 2411.05726

Generating trees growing on the left for pattern-avoiding inversion sequences

Abstract

This work concerns a construction of pattern-avoiding inversion sequences from right to left we call the generating tree growing on the left. We first apply this construction to inversion sequences avoiding 201 and 210, resulting in a new way of computing their generating function. We then use a slightly modified construction to compute the generating function of inversion sequences avoiding 010 and 102, which was only conjectured before. These generating functions are algebraic in both instances. We end by discussing how the generating tree growing on the left can be applied in a more general setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Testart. 2025-09-22. Generating trees growing on the left for pattern-avoiding inversion sequences. https://doi.org/10.46298/dmtcs.14716

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