#### Filter Results:

#### Publication Year

2012

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In this paper we study several problems concerning the number of homomor-phisms of trees. We begin with an algorithm for the number of homomorphisms from a tree to any graph. By using this algorithm and some transformations on trees, we study various extremal problems about the number of homomorphisms of trees. These applications include a far reaching… (More)

- Robert VanBuren, Ching Man Wai, Jisen Zhang, Jennifer Han, Jie Arro, Zhicong Lin +7 others
- Genome Biology
- 2016

The papaya Y-linked region showed clear population structure, resulting in the detection of the ancestral male population that domesticated hermaphrodite papayas were selected from. The same populations were used to study nucleotide diversity and population structure in the X-linked region. Diversity is very low for all genes in the X-linked region in the… (More)

The (q, r)-Eulerian polynomials are the (maj−exc, fix, exc) enumerative polynomials of permutations. Using Shareshian and Wachs' exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical q-Eulerian identities and asked for bijective proofs. We provide such proofs using Foata and Han's three-variable statistic… (More)

Let hom(H, G) denote the number of homomorphisms from a graph H to a graph G. Sidorenko's conjecture asserts that for any bipartite graph H, and a graph G we have hom(H, G) v(G) v(H) hom(K 2 , G) v(G) 2 e(H) , where v(H), v(G) and e(H), e(G) denote the number of vertices and edges of the graph H and G, respectively. In this paper we prove Sidorenko's… (More)

- Zhicong Lin
- 2016

We prove a conjecture of Gessel, which asserts that the joint distribution of descents and inverse descents on permutations has a fascinating refined γ-positivity.

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract. Let hom(G, H) denote the number of homomorphisms from a graph G to… (More)

We investigate the diagonal generating function of the Jacobi-Stirling numbers of the second kind JS(n + k, n; z) by generalizing the analogous results for the Stir-ling and Legendre-Stirling numbers. More precisely, letting JS(n + k, n; z) = p k,0 (n) + p k,1 (n)z + · · · + p k,k (n)z k , we show that (1 − t) 3k−i+1 n≥0 p k,i (n)t n is a polynomial in t… (More)

- ‹
- 1
- ›