Related papers: Cluster parking functions
A Herglotz function is a holomorphic map from the open complex unit disk into the closed complex right halfplane. A classical Herglotz function has an integral representation against a positive measure on the unit circle. We prove a free…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
In this paper, we explore parking distributions on caterpillar trees, focusing on two primary statistics: the number of lucky cars and the frequency with which cars prefer specific parking spaces. We use first-return decomposition to reveal…
We establish a purely geometric form of the concentration theorem (also called localization theorem) for actions of a linearly reductive group $G$ on an affine scheme $X$ over an affine base scheme $S$. It asserts the existence of a…
Consider the vector space $\mathbb{K}\mathcal{P}$ spanned by parking functions. By representing parking functions as labeled digraphs, Hivert, Novelli and Thibon constructed a cocommutative Hopf algebra PQSym$^{*}$ on…
Stanley recently introduced the shifted parking function symmetric function $SH_n$, which is the shiftification of Haiman's parking function symmetric function $PF_n$. The function $SH_n$ lives in the subalgebra of symmetric functions…
We study and classify a class of representations (called generalized geometric representations) of a Coxeter group of finite rank. These representations can be viewed as a natural generalization of the geometric representation. The…
Given an undirected graph $G=(V,E)$, and a designated vertex $q\in V$, the notion of a $G$-parking function (with respect to $q$) was independently developed and studied by various authors, and has recently gained renewed attention. This…
We introduce a strategy to study irreducible representations of automorphism groups of finite modules over local rings. We prove that these automorphism groups fit in a hierarchy that facilitates a stratification of their irreducible…
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 slots, before proceedings forward as usual. In our…
Binary clustering systems are closely related to monotone transit functions. An interesting class are pyramidal transit functions defined by the fact that their transit sets form an interval hypergraph. We investigate here properties of…
Monoidal product, braiding, balancing and weak duality are pieces of algebraic information that are well-known to have their origin in oriented genus zero surfaces and their mapping classes. More precisely, each of them correspond to…
We show the existence of generalized clusters of a finite or even infinite number of sets, with minimal total perimeter and given total masses, in metric measure spaces homogeneous with respect to a group acting by measure preserving…
We show that if a complex has free finitely generated reduced homology groups for two consecutive dimensions and trivial homology for all other dimensions, then it must have the homotopy type of a wedge of spheres of two consecutive…
In this paper we study natural reconfiguration spaces associated to the problem of distributing a fixed number of resources to labeled nodes of a tree network, so that no node is left empty. These spaces turn out to be cubical complexes,…
We prove that the Hopf algebra of parking functions and the Hopf algebra of ordered forests are isomorphic, using a rigidity theorem for a particular type of bialgebras.
Unit-interval parking functions are subset of parking functions in which cars park at most one spot away from their preferred parking spot. In this paper, we characterize unit-interval parking functions by understanding how they decompose…
We construct an action of the braid group on $n$ strands on the set of parking functions of $n$ cars such that elementary braids have orbits of length 2 or 3. The construction is motivated by a theorem of Lyashko and Looijenga stating that…
A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…
The parqueting-reflection principle is shown to also work for constructing harmonic Green functions and harmonic Neumann functions for a class of domains, which are bounded by two arcs in $\mathbb{C}$ with a special intersecting angle…