Related papers: On the Structure of Permutation Invariant Parking

One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…

in this article a multilayer parking system of size n=3 is studied. We prove that the asymptotic limit of the particle density in the center approaches a maximum of 1/2 in higher layers. This means a significant increase of capacity…

We describe the implications of permutation symmetry for the state space and dynamics of quantum mechanical systems of matrices of general size $N$. We solve the general 11- parameter permutation invariant quantum matrix harmonic oscillator…

We construct polynomial conformal invariants, the vanishing of which is necessary and sufficient for an $n$-dimensional suitably generic (pseudo-)Riemannian manifold to be conformal to an Einstein manifold. We also construct invariants…

We define two symmetric $q,t$-Catalan polynomials in terms of the area and depth statistic and in terms of the dinv and dinv of depth statistics. We prove symmetry using an involution on plane trees. The same involution proves symmetry of…

The cluster complex on one hand, parking functions on the other hand, are two combinatorial (po)sets that can be associated to a finite real reflection group. Cluster parking functions are obtained by taking an appropriate fiber product…

We revisit the problem of permuting an array of length $n$ according to a given permutation in place, that is, using only a small number of bits of extra storage. Fich, Munro and Poblete [FOCS 1990, SICOMP 1995] obtained an elegant…

Consider a uniform rooted Cayley tree $T_{n}$ with $n$ vertices and let $m$ cars arrive sequentially, independently, and uniformly on its vertices. Each car tries to park on its arrival node, and if the spot is already occupied, it drives…

We study symmetries of bases and spanning sets in finite element exterior calculus, using representation theory. We want to know which vector-valued finite element spaces have bases invariant under permutation of vertex indices. The…

We establish a symmetry in a variety of integrable stochastic systems: Certain multi-point distributions of natural observables are unchanged under a shift of a subset of observation points. The property holds for stochastic vertex models,…

We adapt the vertical and horizontal insertion encodings of Cayley permutations to enumerate restricted growth functions, which are in bijection with unordered set partitions. For both insertion encodings, we fully classify the classes for…

The rapid growth of private car ownership has worsened the urban parking predicament, underscoring the need for accurate and effective parking availability prediction to support urban planning and management. To address key limitations in…

We find an explicit $S_n$-equivariant bijection between the integral points in a certain zonotope in $\mathbb{R}^n$, combinatorially equivalent to the permutahedron, and the set of $m$-parking functions of length $n$. This bijection…

Let $\Delta$ be an integer $n \times n$-matrix which satisfies the conditions: $\det \Delta\neq 0$, $\Delta_{ij}\leq 0\text{ for }i\neq j,$ and there exists a vector ${\bf r}=(r_1,\ldots,r_n)>0$ such that ${\bf r}\Delta \geq 0$. Here the…

We prove that given a fixed finite tree $P$, almost all trees contain $P$ as a subtree. Moreover, the inclusion can be made so that it induces an embedding of the corresponding (quantum) automorphism groups, thereby providing generic…

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…

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…

We introduce a class of permutation centralizer algebras which underly the combinatorics of multi-matrix gauge invariant observables. One family of such non-commutative algebras is parametrised by two integers. Its Wedderburn-Artin…

For a labeled, rooted tree with edges oriented towards the root, we consider the vertices as parking spots and the edge orientation as a one-way street. Each driver, starting with her preferred parking spot, searches for and parks in the…

A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all…