Related papers: Bijection between trees in Stanley character formu…
Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement.…
In 2010, B. Rhoades proved that promotion together with the fake-degree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenomenon. We extend this result to all skew standard Young…
In 1993 Stanley showed that if a simplicial complex is acyclic over some field, then its face poset can be decomposed into disjoint rank $1$ boolean intervals whose minimal faces together form a subcomplex. Stanley further conjectured that…
Goulden-Rattan polynomials give the exact value of the subdominant part of the normalized characters of the symmetric groups in terms of certain quantities ($C_i$) which describe the macroscopic shape of the Young diagram. The…
Let $R$ be a two-dimensional regular local ring. In this paper, we prove that there is a bijection between the set of all valuations of $Quot(R)$ centered at $R$ and valuations of $k(x,y)$ centered at $k[x,y]_{(x,y)}$, where $k$ is the…
The CHY-integrand of bi-adjoint cubic scalar theory is a product of two PT-factors. This pair of PT-factors can be interpreted as defining a permutation. We introduce the cycle representation of permutation in this paper for the…
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
Let $G$ be a finite symmetric, general linear, or general unitary group defined over a field of characteristic coprime to $3$. We construct a canonical correspondence between irreducible characters of degree coprime to $3$ of $G$ and those…
Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The right-hand side can be…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
Determining whether two graphs are isomorphic is an important and difficult problem in graph theory. One way to make progress towards this problem is by finding and studying graph invariants that distinguish large classes of graphs. Stanley…
In this article we study decreasing and increasing factorisations of the cycle, which are decompositions of the cycle $(1~2\dots n)$ into a product of $n-1$ transpositions satisfying monotonicity conditions. We explicit a bijection between…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
We demonstrate a method for proving precise concentration inequalities in uniformly random trees on $n$ vertices, where $n\geq1$ is a fixed positive integer. The method uses a bijection between mappings…
By considering the parity of the degrees and levels of nodes in increasing trees, a new combinatorial interpretation for the coefficients of the Taylor expansions of the Jacobi elliptic functions is found. As one application of this new…
Let e>1 be an integer. Among the finite 3-groups G with bicyclic commutator quotient G/G' ~ C(3^e) * C(3), having one non-elementary component with logarithmic exponent e, there exists a unique pair of coclass trees with distinguished rank…
This paper focuses on the well-known problem due to Stanley of whether two non-isomorphic trees can have the same $U$-polynomial (or, equivalently, the same chromatic symmetric function). We consider the $U_k$-polynomial, which is a…
Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the…