Related papers: A Shifted Parking Function Symmetric Function
The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry. More recently, this theory has been fruitfully extended to…
Some fixed point results are given for a class of functional contractions acting on (reflexive) triangular symmetric spaces. Technical connections with the corresponding theories over (standard) metric and partial metric spaces are also…
The classical parking functions, counted by the Cayley number (n+1)^(n-1), carry a natural permutation representation of the symmetric group S_n in which the number of orbits is the n'th Catalan number. In this paper, we will generalize…
This work builds on the notion of record of rooted trees. We provide an alternative definition of parking functions, derive from it a record-preserving bijection between rooted trees and parking functions, and establish a join…
In this paper, we study shifted Schur functions $S_\mu^\star$, as well as a new family of shifted symmetric functions $\mathfrak{K}_\mu$ linked to Kostka numbers. We prove that both are polynomials in multi-rectangular coordinates, with…
Recent results have placed the classical shuffle conjecture of Haglund et al. in a broader context of an infinite family of conjectures about parking functions in any rectangular lattice. The combinatorial side of the new conjectures has…
Symmetric functions, which take as input an unordered, fixed-size set, are known to be universally representable by neural networks that enforce permutation invariance. These architectures only give guarantees for fixed input sizes, yet in…
In this paper we classify when (row-strict) dual immaculate functions and (row-strict) extended Schur functions, as well as their skew generalizations, are symmetric. We also classify when their natural variants, termed advanced functions,…
An $(m, n)$-parking function can be characterized as function $f:[n] \to [m]$ such that the partition obtained by reordering the values of $f$ fits inside a right triangle with legs of length $m$ and $n$. Recent work by McCammond, Thomas,…
Extending the elementary and complete homogeneous symmetric functions, we introduce the truncated homogeneous symmetric function $h_{\lambda}^{\dd}$ in $(\ref{THSF})$ for any integer partition $\lambda$, and show that the transition matrix…
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…
A classical parking function of length $n$ is a list of positive integers $(a_1, a_2, \ldots, a_n)$ whose nondecreasing rearrangement $b_1 \leq b_2 \leq \cdots \leq b_n$ satisfies $b_i \leq i$. The convex hull of all parking functions of…
We define a q-analog of the modified Bessel and Bessel-Macdonald functions. As for the q-Bessel functions of Jackson there is a couple of functions of the both kind. They are arisen in the Harmonic analysis on quantum symmetric spaces…
Let \bar{M}_{0,n} be the moduli space of pointed, genus 0 curves. Let L_i denote the line bundle on \bar{M}_{0,n} associated to the i-th marked point (the fiber of L_i is the cotangent space of the pointed curve at the i-th point).…
In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we…
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…
A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…
This paper is about a family of symmetric rational functions that form a one-parameter generalization of the classical Hall-Littlewood polynomials. We introduce two sets of (skew and non-skew) functions that are akin to P and Q…
We call an objective function or algorithm symmetric with respect to an input if after swapping two parts of the input in any algorithm, the solution of the algorithm and the output remain the same. More formally, for a permutation $\pi$ of…
We introduce a ring of noncommutative shifted symmetric functions based on an integer-indexed sequence of shift parameters. Using generating series and quasideterminants, this multiparameter approach produces deformations of the ring of…