相关论文: Parking Functions and Descent Algebras

This paper has two parts. The first part is a review and extension of the methods of integration of Leibniz algebras into Lie racks, including as new feature a new way of integrating 2-cocycles (see Lemma 3.9). In the second part, we use…

This article studies the construction of Hopf algebras $H$ acting on a given algebra $K$ in terms of algebra morphisms $ \sigma \colon K \rightarrow \mathrm{M}_n(K)$. The approach is particularly suited for controlling whether these actions…

A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…

A parking function $(c_1,\ldots,c_n)$ can be viewed as having $n$ cars trying to park on a one-way street with $n$ parking spots, where car $i$ tries to park in spot $c_i$, and otherwise he parks in the leftmost available spot after $c_i$.…

In this expository article I describe classical results in the combinatorics of parking functions. Its English-Spanish translation is included. -- -- En este art\'iculo de difusi\'on matem\'atica describo resultados cl\'asicos en la…

A criterion for subcoalgebras to be invariant under the adjoint action is given generalizing Masuoka's criterion for normal Hopf subalgebras. At the level of characters, the image of the induction functor from a normal Hopf subalgebra is…

The Lambek calculus provides a foundation for categorial grammar in the form of a logic of concatenation. But natural language is characterized by dependencies which may also be discontinuous. In this paper we introduce the displacement…

The notion of parking sequences is a new generalization of parking functions introduced by Ehrenborg and Happ. In the parking process defining the classical parking functions, instead of each car only taking one parking space, we allow the…

The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the…

Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous spots, before proceeding forward as usual. In this work…

Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…

Partial actions of Hopf algebras can be considered as a generalization of partial actions of groups on algebras. Among important properties of partial Hopf actions, it is possible to assure the existence of enveloping actions. This allows…

In parking problems, a given number of cars enter a one-way street sequentially, and try to park according to a specified preferred spot in the street. Various models are possible depending on the chosen rule for collisions, when two cars…

Interval parking functions are a generalization of parking functions in which cars have an interval preference for their parking. We generalize this definition to parking functions with $n$ cars and $m\geq n$ parking spots, which we call…

A pair $(G,K)$ of a group and its subgroup is called a Gelfand pair if the induced trivial representation of $K$ on $G$ is multiplicity free. Let $(a_j)$ be a sequence of positive integers of length $n$, and let $(b_i)$ be its…

A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. In this paper we obtain some new results…

We develop a unified approach to the classical Hopf Decomposition (also known as the conservative--dissipative decomposition) for actions of locally compact second countable groups. While the decomposition is well understood for free…

We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…

In this report, we introduce observation algebras, constructed by considering the downclosed subsets of a coherence space ordered by reverse inclusion. These may be interpreted as specifications of sets of events via some predicates with…

We define an action of words in $[m]^n$ on $\mathbb{R}^m$ to give a new characterization of rational parking functions -- they are exactly those words whose action has a fixed point. We use this viewpoint to give a simple definition of…