Related papers: A braid group action on parking functions

We prove that the expected number of braid moves in the commutation class of the reduced word $(s_1 s_2 \cdots s_{n-1})(s_1 s_2 \cdots s_{n-2}) \cdots (s_1 s_2)(s_1)$ for the long element in the symmetric group $\mathfrak{S}_n$ is one. This…

Let $\sigma_i$ be the braid actions on infinite Grassmannian cluster algebras induced from Fraser's braid group actions. Let $\mathsf{T}_i$ be the braid group actions on (quantum) Grothendieck rings of Hernandez-Leclerc category ${\mathscr…

We deduce that the fundamental groups of the orbit configuration spaces of an effective and properly discontinuous action of a discrete group on a connected aspherical 2-manifold, with isolated fixed points, fit into a four-term exact…

We study the action of $S_n$ on the set of break divisors on complete multigraphs $K_{n}^m$. We provide an alternative characterization for these divisors, by virtue of which we show that orbits of this action are enumerated by the…

This article explores the novel notion of gyrogroup actions, which is a natural generalization of the usual notion of group actions. As a first step toward the study of gyrogroup actions from the algebraic viewpoint, we prove three…

There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of…

The displacement of a car with respect to a parking function is the number of spots it must drive past its preferred spot in order to park. An $\ell$-interval parking function is one in which each car has displacement at most $\ell$. Among…

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…

We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…

Suppose that $n$ drivers each choose a preferred parking space in a linear car park with $m$ spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with larger number (if…

We recall the occupancy problem introduced by Konheim & Weiss in 1966 and we consider parking functions as hash maps. Each car $c_i$ prefers parking space $p_i$ (the hash map $c_i \mapsto p_i$ with $c_i$ is a key and $p_i$ an index into an…

Let $X$ be a smooth scheme with an action of a reductive algebraic group $G$ over an algebraically closed field $k$ of characteristic zero. We construct an action of the extended affine Braid group on the $G$-equivariant absolute derived…

We construct an action of the braid group B_N on the twisted quantized enveloping algebra U'_q(o_N) where the elements of B_N act as automorphisms. In the classical limit q -> 1 we recover the action of B_N on the polynomial functions on…

This paper provides an exploration of parking functions, a classical combinatorial object. We present two viewpoints on their structure and properties: through poset of noncrossing partitions and polytopes.

We establish an Excision type theorem for niceness of group structure on the orbit space of unimodular rows of length $n$ modulo elementary action. This permits us to establish niceness for relative versions of results for the cases when $n…

We give an algorithm to decide if a given braid is a product of two factors which are conjugates of given powers of standard generators of the braid group. The same problem is solved in a certain class of Garside groups including Artin-Tits…

We present a bijection between two well-known objects in the ubiquitous Catalan family: non-decreasing parking functions and {\L}ukasiewicz paths. This bijection maps the maximal displacement of a parking function to the height of the…

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…

In the paper, we prove that there exists a braid group action on the extended crystal $\widehat{B}(\infty)$ of finite type. The extended crystal $\widehat{B}(\infty)$ and its braid group action are investigated from the viewpoint of crystal…

Parking functions were classically defined for $n$ cars attempting to park on a one-way street with $n$ parking spots, where cars only drive forward. Subsequently, parking functions have been generalized in various ways, including allowing…