Search arXivSearch

arXiv · 1707.00336

On the combinatorics of Riordan arrays and Sheffer polynomials: monoids, operads and monops

Abstract

We introduce a new algebraic construction, {\em monop}, that combines monoids (with respect to the product of species), and operads (monoids with respect to the substitution of species) in the same algebraic structure. By the use of properties of cancellative set-monops we construct a family of partially ordered sets whose prototypical examples are the Dowling lattices. They generalize the partition posets associated to a cancellative operad, and the subset posets associated to a cancellative monoid. Their generalized Withney numbers of the first and second kind are the entries of a Riordan matrix and its inverse. Equivalently, they are the connecting coefficients of two umbral inverse Sheffer sequences with the family of powers $\{x^n\}_{n=0}^{\infty}$. We study algebraic monops, their associated algebras and the free monop-algebras, as part of a program in progress to develop a theory of Koszul duality for monops.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miguel Méndez, Rafael Sánchez. 2017-07-02. On the combinatorics of Riordan arrays and Sheffer polynomials: monoids, operads and monops. https://arxiv.org/abs/1707.00336

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