اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTrees, parking functions, and standard monomials of skeleton ideals
340
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial ideal in the polynomial ring $S = {mathbb K}[x_1, dots, x_n]$ where a set of generators are indexed by the nonempty subsets of $[n] = {1,2,dots,n}$. Motivated by constructions from the theory of chip-firing on graphs we study generalizations of parking functions determined by $M^{(k)}_n$, a subideal of $M_n$ obtained by allowing only generators corresponding to subsets of $[n]$ of size at most $k$. For each $k$ the set of standard monomials of $M^{(k)}_n$, denoted $text{stan}_n^k$, contains the usual parking functions and has interesting combinatorial properties in its own right. For general $k$ we show that elements of $text{stan}_n^k$ can be recovered as certain vector-parking functions, which in turn leads to a formula for their count via results of Yan. The symmetric group $S_n$ naturally acts on the set $text{stan}_n^k$ and we also obtain a formula for the number of orbits under this action. For the case of $k = n-2$ we study combinatorial interpretations of $text{stan}_n^{n-2}$ and relate them to properties of uprooted trees in terms of root degree and surface
قيم البحث
اقرأ أيضاً
Given a graph $G$, the $G$-parking function ideal $M_G$ is an artinian monomial ideal in the polynomial ring $S$ with the property that a linear basis for $S/M_G$ is provided by the set of $G$-parking functions. It follows that the dimension of $S/M_
G$ is given by the number of spanning trees of $G$, which by the Matrix Tree Theorem is equal to the determinant of the reduced Laplacian of $G$. The ideals $M_G$ and related algebras were introduced by Postnikov and Shapiro where they studied their Hilbert functions and homological properties. The author and Sanyal showed that a minimal resolution of $M_G$ can be constructed from the graphical hyperplane arrangement associated to $G$, providing a combinatorial interpretation of the Betti numbers. Motivated by constructions in the theory of chip-firing on graphs, we study certain `skeleton ideals $M_G^{(k)} subset M_G$ generated by subsets of vertices of $G$ of size at most $k+1$. Here we focus our attention on the case $k=1$, the $1$-skeleton of the $G$-parking functions ideals. We consider standard monomials of $M_G^{(1)}$ and provide a combinatorial interpretation for the dimension of $S/M_G^{(1)}$ in terms of the signless Laplacian for the case $G = K_{n+1}$ is the complete graph. Our main study concerns homological properties of these ideals. We study resolutions of $M_G^{(1)}$ and show that for a certain class of graphs minimal resolution is supported on decompositions of Euclidean space coming from the theory of tropical hyperplane arrangements. This leads to combinatorial interpretations of the Betti numbers of these ideals.
For each skew shape we define a nonhomogeneous symmetric function, generalizing a construction of Pak and Postnikov. In two special cases, we show that the coefficients of this function when expanded in the complete homogeneous basis are given in ter
ms of the (reduced) type of $k$-divisible noncrossing partitions. Our work extends Haimans notion of a parking function symmetric function.
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 nth Catalan number. In this paper, we will generalize this setup to
rational parking functions indexed by a pair (a,b) of coprime positive integers. We show that these parking functions, which are counted by b^(a-1), carry a permutation representation of S_a in which the number of orbits is a rational Catalan number. We compute the Frobenius characteristic of the S_a-module of (a,b)-parking functions. Next we propose a combinatorial formula for a q-analogue of the rational Catalan numbers and relate this formula to a new combinatorial model for q-binomial coefficients. Finally, we discuss q,t-analogues of rational Catalan numbers and parking functions (generalizing the shuffle conjecture for the classical case) and present several conjectures.
We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of (m,n)-parking functions, and associated (q,t)-analogs.
The emph{Shi arrangement} is the set of all hyperplanes in $mathbb R^n$ of the form $x_j - x_k = 0$ or $1$ for $1 le j < k le n$. Shi observed in 1986 that the number of regions (i.e., connected components of the complement) of this arrangement is $(
n+1)^{n-1}$. An unrelated combinatorial concept is that of a emph{parking function}, i.e., a sequence $(x_1, x_2, ..., x_n)$ of positive integers that, when rearranged from smallest to largest, satisfies $x_k le k$. (There is an illustrative reason for the term emph{parking function}.) It turns out that the number of parking functions of length $n$ also equals $(n+1)^{n-1}$, a result due to Konheim and Weiss from 1966. A natural problem consists of finding a bijection between the $n$-dimensional Shi arragnement and the parking functions of length $n$. Stanley and Pak (1996) and Athanasiadis and Linusson 1999) gave such (quite different) bijections. We will shed new light on the former bijection by taking a scenic route through certain mixed graphs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
