相关论文: Parking Functions and Descent Algebras

Parking functions, classically defined in terms of cars with preferred parking spots on a directed path attempting to park there, arise in many combinatorial situations and have seen various generalizations. In particular, parking functions…

Graphical parking functions, or $G$-parking functions, are a generalization of classical parking functions which depend on a connected multigraph $G$ having a distinguished root vertex. Gaydarov and Hopkins characterized the relationship…

We extend some aspects of the Hamilton-Jacobi theory to the category of stochastic Hamiltonian dynamical systems. More specifically, we show that the stochastic action satisfies the Hamilton-Jacobi equation when, as in the classical…

We extend a classical construction on symmetric functions, the superization process, to several combinatorial Hopf algebras, and obtain analogs of the hook-content formula for the (q,t)-specializations of various bases. Exploiting the…

Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…

We introduce the notions of topological entropy of a formal language and of a topological automaton. We show that the entropy function is surjective and bound the entropy of languages accepted by deterministic {\epsilon}-free push-down…

Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…

For a standard graded algebra $R$, we consider embeddings of the the poset of Hilbert functions of quotients of $R$ into the poset of ideals of $R$, as a way of classification of Hilbert functions. There are examples of rings for which such…

The Fuss-Catalan numbers are a generalization of the Catalan numbers. They enumerate a large class of objects and in particular m-Dyck paths and m+1-ary trees. Recently, F. Bergeron defined an analogue for generic m of the Tamari order on…

We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…

Motivated by the fact that the Hopf-cyclic (co)homologies of function algebras over Lie groups and universal enveloping algebras over Lie algebras capture the Lie group and Lie algebra (co)homologies, we hereby upgrade the classical van Est…

A parking function is a sequence of N nonnegative integers majorated by a permutation of the set {0, ..., N-1}. We provide a way to encode parking functions by data suggested by J.Haglund and N.Loehr. This coding is compared with another…

Classical parking functions are a generalization of permutations that appear in many combinatorial structures. Prime parking functions are indecomposable components such that any classical parking function can be uniquely described as a…

A family of partial functions of a class of algebras $\mathsf{K}$ is said to be an implicit operation of $\mathsf{K}$ when it is defined by a first order formula and it is preserved by homomorphisms. In this work, we develop the theory of…

We settle a conjecture of B\'ona regarding the log-concavity of a certain statistic on parking functions by utilizing recent log-concavity results on matroids. This result allows us to also prove that connected, labeled graphs graded by…

We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time more general and simpler. We introduce the concept of a…

We clarify the relation between the `bosonisation' construction (due to the author) which can be used to turn a Hopf algebra $B$ in the category of $H$-modules or $H$-comodules into an equivalent ordinary Hopf algebra, and a version of…

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

We enumerate interlaced pairs of parking functions whose underlying Dyck path has a bounded height. We obtain an explicit formula for this enumeration in the form of a quotient of analogs of Chebicheff polynomials having coefficients in the…

We develop a formalism of cohomological descent encoding adelic points and obstructions to local-global principle on algebraic stacks. As an application, by constructing new obstructions using the formalism, we obtain some comparison…