相关论文: On the Structure of Permutation Invariant Parking
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…
Structures of multilinear maps are characterized by invariants. In this paper we introduce two invariants, named the isotropy index and the completeness index. These invariants capture the tensorial structure of the kernel of a multilinear…
We propose and study the following Mirror Principle: certain sequences of multiplicative equivariant characteristic classes on Kontsevich's stable map moduli spaces can be computed in terms of certain hypergeometric type classes. As…
Consider the following simple parking process on $\Lambda_n := \{-n, \ldots, n\}^d,d\ge1$: at each step, a site $i$ is chosen at random in $\Lambda_n$ and if $i$ and all its nearest neighbor sites are empty, $i$ is occupied. Once occupied,…
We illustrate the experimental, empirical, approach to mathematics (that contrary to popular belief, is often rigorous), by using parking functions and their "area" statistic, as a case study. Our methods are purely finitistic and…
We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…
Armstrong, Reiner, and Rhoades defined for all Weyl groups $W$ a natural representation of $W$ called the $W$-parking space. The type $B$ parking space is the representation $\mathbb{C}[(\mathbb{Z}/(2n+1)\mathbb{Z})^n]$ of the $n$th signed…
The action of the symmetric group $S_n$ on the set $Park_n$ of parking functions of size $n$ has received a great deal of attention in algebraic combinatorics. We prove that the action of $S_n$ on $Park_n$ extends to an action of $S_{n+1}$.…
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…
Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…
We consider the problem of comparing several samples of stochastic processes with respect to their second-order structure, and describing the main modes of variation in this second order structure, if present. These tasks can be seen as an…
The technique of in-situ associative permuting is introduced which is an association of in-situ permuting and in-situ inverting. It is suitable for associatively permutable permutations of {1,2,...,n} where the elements that will be…
In this paper we analyze the quantum homological invariants (the Poincar\'e polynomials of the $\mathfrak{sl}_N$ link homology). In the case when the dimensions of homologies of appropriate topological spaces are precisely known, the…
We propose a path integral formulation for scale invariant quantum field theories. We do it by modifying the functional integration measure in such a way that the partition function is always exactly scale invariant, at the cost of having…
When data is sampled from an unknown subspace, principal component analysis (PCA) provides an effective way to estimate the subspace and hence reduce the dimension of the data. At the heart of PCA is the Eckart-Young-Mirsky theorem, which…
We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…
Recent advances in deep learning from probability distributions successfully achieve classification or regression from distribution samples, thus invariant under permutation of the samples. The first contribution of the paper is to extend…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Recently, the authors extended the notion of parking functions to parking sequences, which include cars of different sizes, and proved a product formula for the number of such sequences. We here give a refinement of that result involving…
We study a class of flat bundles, of finite rank $N$, which arise naturally from the Donaldson-Thomas theory of a Calabi-Yau threefold $X$ via the notion of a variation of BPS structure. We prove that in a large $N$ limit their flat…