Peter M. Tian

most citedSymmetric Chromatic Polynomial of Trees

12 citations · 19 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2019★ 2 cited

Formations and generalized Davenport-Schinzel sequences

Jesse Geneson, Peter Tian, Katherine Tung

Let $u p (r, t) = (a_{1} a_{2} \dots a_{r})^{t}$ . We investigate the problem of determining the maximum possible integer $n (r, t)$ for which there exist $2 t - 1$ permutations $π_1, π_2, \dots,…

math.CO2015

Extremal Functions of Forbidden Multidimensional Matrices

Jesse T. Geneson, Peter M. Tian

Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion pla…

math.CO2015★ 12 cited

Symmetric Chromatic Polynomial of Trees

Isaac Smith, Zane Smith, Peter Tian

In a 1995 paper Richard Stanley defined $X_{G}$ , the symmetric chromatic polynomial of a Graph $G = (V, E)$ . He then conjectured that $X_{G}$ distinguishes trees; a conjecture which still…

cs.DM2015★ 5 cited

Sequences of formation width $4$ and alternation length $5$

Jesse Geneson, Peter Tian

Sequence pattern avoidance is a central topic in combinatorics. A sequence $s$ contains a sequence $u$ if some subsequence of $s$ can be changed into $u$ by a one-to-one renaming o…

Formations and generalized Davenport-Schinzel sequences

Extremal Functions of Forbidden Multidimensional Matrices

Symmetric Chromatic Polynomial of Trees

Sequences of formation width 4 and alternation length 5

Sequences of formation width $4$ and alternation length $5$