Search arXivSearch

arXiv · math/0406418

New results on the peak algebra

Abstract

The peak algebra is a unital subalgebra of the symmetric group algebra, linearly spanned by sums of permutations with a common set of peaks. By exploiting the combinatorics of sparse subsets of [n-1] (and of certain classes of compositions of n called almost-odd and thin), we construct three new linear bases of this algebra. We discuss two peak analogs of the first Eulerian idempotent and construct a basis of semi-idempotent elements. We use these bases to describe the Jacobson radical of the peak algebra and to characterize the elements of this algebra in terms of the canonical action of the symmetric groups on the tensor algebra of a vector space. We define a chain of ideals such that the ideal at the bottom of the chain is the linear span of sums of permutations with a common set of interior peaks and the ideal at the top is the whole algebra. We extend the above results to these ideals, generalizing results of Schocker (the case of the bottom ideal).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcelo Aguiar, Kathryn Nyman, Rosa Orellana. 2004-06-21. New results on the peak algebra. https://arxiv.org/abs/math/0406418

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