Related papers: On the Structure of Permutation Invariant Parking

We define a new algebraic structure called a \emph{pointed rack} and use it to construct ambient isotopy invariants of $ n $-braids. We first introduce an integer-valued invariant of braids using pointed racks. This is then strengthened by…

We introduce the vertical and horizontal insertion encodings for Cayley permutations which naturally generalise the insertion encoding for permutations. In both cases, we fully classify the Cayley permutation classes for which these…

The displacement of a parking function measures the total difference between where cars want to park and where they ultimately park. In this article, we prove that the set of parking functions of length $n$ with displacement one is in…

We introduce type C parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type C parking functions to regions of the Shi arrangement of type C, encoded as diagonally…

We present an integral formulation of classical Yang-Mills theory coupled to fermionic and scalar matter fields in (1+1)-dimensional Minkowski spacetime. By reformulating the local dynamics in terms of loop-space holonomies, we demonstrate…

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…

When a category $\mathcal{C}$ satisfies certain conditions, we define the notion of rank invariant for arbitrary poset-indexed functors $F:\mathbf{P} \rightarrow \mathcal{C}$ from a category theory perspective. This generalizes the standard…

We investigate integrable fermionic models within the scheme of the graded Quantum Inverse Scattering Method, and prove that any symmetry imposed on the solution of the Yang-Baxter Equation reflects on the constants of motion of the model;…

In this paper we investigate the shape invariance property of a potential in one dimension. We show that a simple ansatz allows us to reconstruct all the known shape invariant potentials in one dimension. This ansatz can be easily extended…

Parking problems derive from works in combinatorics by Konheim and Weiss in the 1960s. In a memorable contribution, Lackner and Panholzer (2016) studied parking on a random tree and established a phase transition for this process when \(m…

We develop the theory of the discrete periodic Pitman transform, first introduced by Corwin, Gu, and the fifth author. We prove that the discrete periodic Pitman transform satisfies the same braid relations that are satisfied for the…

In this work, we propose to study noncommutative geometry using the language of categories of sheaves of algebras with polynomial identities and their properties, introducing new (graded) noncommutative geometries. These include, for…

For a connected graph $G$ with sink vertex $q$, a $G$-parking function is a vector of nonnegative integers whose entries are determined by cut-sets in $G$. Such objects also arise as the superstable configurations in the context of…

Given a feature set for the shape of a closed loop, it is natural to ask which features in that set do not change when the starting point of the path is moved. For example, in two dimensions, the area enclosed by the path does not depend on…

We introduce a generalization of parking functions in which cars are limited in their movement backwards and forwards by two nonnegative integer parameters $k$ and $\ell$, respectively. In this setting, there are $n$ spots on a one-way…

We consider the $U(1)$ Chern-Simons gauge theory defined in a general closed oriented 3-manifold $M$; the functional integration is used to compute the normalized partition function and the expectation values of the link holonomies. The…

We describe all linear operators on spaces of multivariate polynomials preserving the property of being non-vanishing in open circular domains. This completes the multivariate generalization of the classification program initiated by…

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…

We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…

A parking function of length n is a sequence (b_1, b_2,..., b_n) of nonnegative integers whose nondecreasing rearrangement (a_1, a_2,...,a_n) has the property that a_i < i for every i. A well-known result about parking functions is that the…