For an indifference graph $G$ we define a symmetric function of increasing spanning forests of $G$. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function and unicellular LLT polynomials. As a consequence we give a combinatorial interpretation of the coefficients of the LLT polynomial in the elementary basis (up to a factor of a power of $(q-1)$), strengthening the description given by Alexandersson and Sulzgruber.
Let G be a graph with vertex set {1,...,n}. A spanning forest F of G is increasing if the sequence of labels on any path starting at the minimum vertex of a tree of F form an increasing sequence. Hallam and Sagan showed that the generating function ISF(G,t) for increasing spanning forests of G has all nonpositive integral roots. Furthermore they proved that, up to a change of sign, this polynomial equals the chromatic polynomial of G precisely when 1,...,n is a perfect elimination order for G. We give new, purely combinatorial proofs of these results which permit us to generalize them in sever…
We consider conjugation action of symmetric group on the semigroup of all partial functions and develop a machinery to investigate character formulas and multiplicities. In particular, we determine nilpotent matrices whose orbit under symmetric group afford the sign representation. Applications to rook theory are offered.
In this work, we expose four bijections each allowing to increase (or decrease) one parameter in either uniform random forests with a fixed number of edges and trees, or quadrangulations with a boundary having a fixed number of faces and a fixed boundary length. In particular, this gives a way to sample a uniform quadrangulation with n + 1 faces from a uniform quadrangulation with n faces or a uniform forest with n+1 edges and p trees from a uniform forest with n edges and p trees.
We give an explicit combinatorial proof of a weighted version of strong log-concavity for the generating polynomial of increasing spanning forests of a finite simple graph equipped with a total ordering of the vertices. In contrast to similar proofs in the literature, our injection is local in the sense that it proceeds by moving a single edge from one forest to the other. In the particular case of the complete graph, this gives a new combinatorial proof of log-concavity of unsigned Stirling numbers of the first kind where a pair of permutations is transformed into a new pair by breaking a sin…
In 1995, Stanley introduced the well-known chromatic symmetric function $X_{G}(x_{1},x_{2},\ldots)$ of a graph $G$. It is a sum of monomial symmetric functions such that for each vertex coloring of $G$ there is exactly one of these summands. The question, whether $X_{G}(x_1,x_{2},\ldots)$ distinguishes nonisomorphic trees with the same number of vertices, is still open in general. For special trees it has already been shown. In 2008, Martin, Morin and Wagner proved it for spiders and some caterpillars. We decompose a tree by separating the leafs and their neighbors and do the same to the remai…
This paper has two main parts. First, we consider the Tutte symmetric function $XB$, a generalization of the chromatic symmetric function. We introduce a vertex-weighted version of $XB$ and show that this function admits a deletion-contraction relation. We also demonstrate that the vertex-weighted $XB$ admits spanning-tree and spanning-forest expansions generalizing those of the Tutte polynomial by connecting $XB$ to other graph functions. Second, we give several methods for constructing nonisomorphic graphs with equal chromatic and Tutte symmetric functions, and use them to provide specific e…
We introduce the generic Lah polynomials $L_{n,k}(ϕ)$, which enumerate unordered forests of increasing ordered trees with a weight $ϕ_i$ for each vertex with $i$ children. We show that, if the weight sequence $ϕ$ is Toeplitz-totally positive, then the triangular array of generic Lah polynomials is totally positive and the sequence of row-generating polynomials $L_n(ϕ,y)$ is coefficientwise Hankel-totally positive. Upon specialization we obtain results for the Lah symmetric functions and multivariate Lah polynomials of positive and negative type. The multivariate Lah polynomials of positive typ…
We prove that the dimension of the Specht module of a forest $G$ is the same as the normalized volume of the matching polytope of $G$. We also associate to $G$ a symmetric function $s_G$ (analogous to the Schur symmetric function $s_λ$ for a partition $λ$) and investigate its combinatorial and representation-theoretic properties in relation to the Specht module and Schur module of $G$. We then use this to define notions of standard and semistandard tableaux for forests.
Let $A$ be a commutative $k$-algebra over a field of $k$ and $Ξ$ a linear operator defined on $A$. We define a family of $A$-valued invariants $Ψ$ for finite rooted forests by a recurrent algorithm using the operator $Ξ$ and show that the invariant $Ψ$ distinguishes rooted forests if (and only if) it distinguishes rooted trees $T$, and if (and only if) it is {\it finer} than the quantity $α(T)=|\text{Aut}(T)|$ of rooted trees $T$. We also consider the generating function $U(q)=\sum_{n=1}^\infty U_n q^n$ with $U_n =\sum_{T\in \bT_n} \frac 1{α(T)} Ψ(T)$, where $\bT_n$ is the set of rooted trees …
Generalizing the notion of a vexillary permutation, we introduce a filtration of S_infinity by the number of Schur function terms in the Stanley symmetric function, with the kth filtration level called the k-vexillary permutations. We show that for each k, the k-vexillary permutations are characterized by avoiding a finite set of patterns. A key step is the construction of a Specht series, in the sense of James and Peel, for the Specht module associated to the diagram of a permutation. As a corollary, we prove a conjecture of Liu on diagram varieties for certain classes of permutation diagrams…
Let $A$ be an acyclic symmetric matrix of order $n$. There is a weighted forest $F$ whose adjacency matrix is $A$. In this paper, using some results on matching polynomials, we provide an explicit formula for eigenvectors of $A$.
Let $\CRF_S$ denote the category of $S$-colored rooted forests, and $\H_{\CRF_S}$ denote its Ringel-Hall algebra as introduced in \cite{KS}. We construct a homomorphism from a $K^+_0 (\CRF_S)$--graded version of the Hopf algebra of noncommutative symmetric functions to $\H_{\CRF_S}$. Dualizing, we obtain a homomorphism from the Connes-Kreimer Hopf algebra to a $K^+_0 (\CRF_S)$--graded version of the algebra of quasisymmetric functions. This homomorphism is a refinement of one considered by W. Zhao in \cite{Z}.
An essential spanning forest of an infinite graph $G$ is a spanning forest of $G$ in which all trees have infinitely many vertices. Let $G_n$ be an increasing sequence of finite connected subgraphs of $G$ for which $\bigcup G_n=G$. Pemantle's arguments imply that the uniform measures on spanning trees of $G_n$ converge weakly to an $\operatorname {Aut}(G)$-invariant measure $μ_G$ on essential spanning forests of $G$. We show that if $G$ is a connected, amenable graph and $Γ\subset \operatorname {Aut}(G)$ acts quasitransitively on $G$, then $μ_G$ is the unique $Γ$-invariant measure on essential…
In this paper, we construct explicitly a noncommutative symmetric (${\mathcal N}$CS) system over the Grossman-Larson Hopf algebra of labeled rooted trees. By the universal property of the ${\mathcal N}$CS system formed by the generating functions of certain noncommutative symmetric functions, we obtain a specialization of noncommutative symmetric functions by labeled rooted trees. Taking the graded duals, we also get a graded Hopf algebra homomorphism from the Connes-Kreimer Hopf algebra of labeled rooted forests to the Hopf algebra of quasi-symmetric functions. A connection of the coefficient…
Using the Berele/Remmel/Kerov/Vershik variation of the Robinson-Schensted-Knuth correspondence, we study the cycle and increasing subsequence structure after various methods of shuffling. One consequence is a cycle index for shuffles like: cut a deck into roughly two equal piles, thoroughly mix the first pile and then riffle it with the second pile. Conclusions are drawn concerning the distribution of fixed points and the asymptotic distribution of cycle structure. An upper bound on the convergence rate is given. Connections are made with extended Schur functions and with work of Baik and Rain…
