T. Tucker

activity

20152019

collaborators

5 papers

math.GR2019

Non-Abelian Simple Groups Act with Almost All Signatures

Mariela Carvacho, Jennifer Paulhus, Tom Tucker +1

The topological data of a group action on a compact Riemann surface is often encoded using a tuple $(h; m_{1}, \dots, m_{s})$ called its signature. There are two easily verifiable arithm…

math.CO2018

Distinguishing locally finite trees

Svenja Hüning, Wilfried Imrich, Judith Kloas +2

The distinguishing number $D (G)$ of a graph $G$ is the smallest number of colors that is needed to color the vertices of $G$ such that the only color preserving automorphism is the…

math.CO2017

Distinguishing graphs of maximum valence 3

Svenja Hüning, Wilfried Imrich, Judith Kloas +2

The distinguishing number $D (G)$ of a graph $G$ is the smallest number of colors that is needed to color $G$ such that the only color preserving automorphism is the identity. We gi…

math.CO2016

Edge-transitive bi-Cayley graphs

Marston Conder, Jin-Xin Zhou, Yan-Quan Feng +1

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$ . Such a graph $\G$ is…

math.CA2015

Root geometry of polynomial sequences II: Type (1,0)

J. L. Gross, T. Mansour, T. W. Tucker +1

We consider the sequence of polynomials $W_{n} (x)$ defined by the recursion $W_{n} (x) = (a x + b) W_{n - 1} (x) + d W_{n - 2} (x)$ , with initial values $W_{0} (x) = 1$ and $W_{1} (x) = t (x - r)$ , where $a,b,d,t,…