Steve Butler

Q: What Schools Are Affiliated With Steve Butler

Steve Butler is affiliated with the following schools: Iowa State University, University of California, San Diego, Princeton University, Stanford University, Brigham Young University

Steve Butler 's AcademicInfluence.com Rankings

Steve Butler

Mathematics

#4543

World Rank

#6435

Historical Rank

#1554

USA Rank

Group Theory

#440

World Rank

#511

Historical Rank

#94

USA Rank

Algebra

#566

World Rank

#748

Historical Rank

#103

USA Rank

Measure Theory

#4647

World Rank

#5443

Historical Rank

#1292

USA Rank

mathematics Degrees

Download Badge

Mathematics

Steve Butler 's Degrees

PhD Mathematics Princeton University
Masters Mathematics Stanford University

Why Is Steve Butler Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Steven Kay Butler is an American mathematician specializing in graph theory and combinatorics. He is a Morrill Professor and the Barbara J. Janson Professor in Mathematics at Iowa State University. Education and career Butler earned his master's degree at Brigham Young University in 2003. His master's thesis was titled Bounding the Number of Graphs Containing Very Long Induced Paths. He completed a doctorate at the University of California, San Diego in 2008, authoring the dissertation Eigenvalues and Structures of Graphs, advised by Fan Chung. Upon completing his postdoctoral studies at the University of California, Los Angeles, Butler joined the Iowa State University faculty in 2011. In 2015, Butler became the 512th person to have an Erdős number of 1, when he published a paper with Paul Erdős and Ronald Graham on Egyptian fractions. In 2017, Butler was named the Barbara J. Janson Professor in Mathematics, and to a Morrill Professorship in 2022.

(See a Problem?)

Steve Butler 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Mathematics of Paul Erdős II (1997) (113)
Eigenvalues and structures of graphs (2008) (85)
Hat Guessing Games (2008) (75)
Forest-Like Permutations (2006) (64)
Interlacing for weighted graphs using the normalized Laplacian (2007) (53)
A Construction of Cospectral Graphs for the Normalized Laplacian (2010) (53)
Small Spectral Gap in the Combinatorial Laplacian Implies Hamiltonian (2010) (44)
Spectra of families of matrices described by graphs, digraphs, and sign patterns (2006) (43)
Algebraic aspects of the normalized Laplacian (2016) (42)
Throttling zero force propagation speed on graphs (2013) (36)
A note about cospectral graphs for the adjacency and normalized Laplacian matrices (2010) (33)
A Note on Nested Sums (2010) (25)
The inverse eigenvalue problem of a graph: Multiplicities and minors (2017) (24)
Stability and efficiency of CO2 capture using linear amine polymer modified carbon nanotubes (2017) (21)
Induced-Universal Graphs for Graphs with Bounded Maximum Degree (2009) (21)
Rainbow arithmetic progressions (2014) (19)
Using discrepancy to control singular values for nonnegative matrices (2006) (18)
Enumerating (Multiplex) Juggling Sequences (2008) (17)
The principal rank characteristic sequence over various fields (2014) (16)
Finding Patterns Avoiding Many Monochromatic Constellations (2010) (16)
The Enhanced Principal Rank Characteristic Sequence (2016) (14)
Ordered multiplicity inverse eigenvalue problem for graphs on six vertices (2017) (14)
Using twins and scaling to construct cospectral graphs for the normalized Laplacian (2014) (13)
Parking distributions on trees (2017) (13)
A cospectral family of graphs for the normalized Laplacian found by toggling (2015) (13)
Using variants of zero forcing to bound the inertia set of a graph (2015) (12)
Zero forcing propagation time on oriented graphs (2017) (11)
Irreducible Apollonian Configurations and Packings (2010) (10)
ORIGAMI RINGS (2010) (9)
Relating singular values and discrepancy of weighted directed graphs (2006) (9)
Tiling Polygons with Lattice Triangles (2010) (8)
Enumerating Parking Completions Using Join and Split (2019) (8)
Graph switching, 2-ranks, and graphical Hadamard matrices (2018) (7)
Hypercube orientations with only two in-degrees (2010) (7)
Edge flipping in the complete graph (2015) (7)
Eigenvalues of 2-edge-coverings (2010) (7)
Iterated Triangle Partitions (2010) (7)
Rudiments of Ramsey Theory: Second Edition (2015) (7)
The maximum nullity of a complete subdivision graph is equal to its zero forcing number (2014) (7)
Tiling a Strip with Triangles (2014) (6)
Juggling card sequences (2015) (6)
The Enhanced Principal Rank Characteristic Sequence for Hermitian Matrices (2017) (6)
Computing Kemeny's constant for a barbell graph (2019) (5)
A note on marking lines in [k]n (2012) (5)
Cospectral graphs for both the adjacency and normalized Laplacian matrices (2008) (4)
Knight’s tours on boards with odd dimensions (2015) (4)
Constructing Points through Folding and Intersection (2013) (3)
Counting Prime Juggling Patterns (2015) (3)
Subdivision by bisectors is dense in the space of all triangles (2010) (3)
Tangent Line Transformations (2003) (3)
Symmetric 0–1 matrices with inverses having two distinct values and constant diagonal (2016) (3)
Computing inertia sets using atoms (2012) (3)
The Mathematics of the Flip and Horseshoe Shuffles (2014) (3)
On the genus of a quotient of a numerical semigroup (2018) (3)
The Inverse Eigenvalue Problem of a Graph (2019) (3)
How to Play the Majority Game with Liars (2007) (2)
Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors (2015) (2)
De Bruijn Sequences with Varying Combs (2014) (2)
A forest building process on simple graphs (2016) (2)
A generalization of Eulerian numbers via rook placements (2015) (2)
How to play the Majority game with a liar (2010) (2)
Optimal jumping patterns (2008) (2)
Enumerating Multiplex Juggling Patterns (2017) (2)
Unrolling Residues to Avoid Progressions (2012) (2)
Constructing cospectral graphs for the normalized Laplacian (2010) (2)
Collapsing numbers in bases 2, 3, and beyond (2012) (2)
The art of juggling with two balls or A proof for a modular condition of Lucas numbers (2010) (1)
Graphs with at most two trees in a forest-building process (2018) (1)
Subdivision Using Angle Bisectors Is Dense in the Space of Triangles (2013) (1)
The lost daughters of Gergonne Steve Butler (2008) (1)
Complements of coalescing sets (2022) (1)
The lost daughters of Gergonne Steve Butler (2008) (1)
Permutations Resilient to Deletions (2018) (1)
Counting Tilings by Taking Walks in a Graph (2020) (1)
Inserting Plus Signs and Adding (2016) (1)
Hadamard Diagonalizable Graphs of Order at Most 36 (2020) (1)
Spectral properties of the exponential distance matrix (2019) (1)
TANGENT LINE TRANSFORMATIONS : OR THERE AND BACK AGAIN (0)
Three views of Ramsey theory (1981) (0)
Eigenvalues of the normalized Laplacian (2010) (0)
van der Waerden’s theorem (1981) (0)
Title Irreducible Apollonian Configurations and Packings Permalink (2010) (0)
Rado’s theorem (1981) (0)
Proof Without Words: Independent Sets in Grid graphs and Tilings of Aztec Diamonds (2019) (0)
On permutations which are 1324 and 2143 avoiding (2005) (0)
An interstice relationship for flowers with four petals (2013) (0)
Spectral graph theory : Applications of Courant-Fischer ∗ (2006) (0)
C O ] 1 4 O ct 2 01 9 Spectral properties of the exponential distance matrix (2019) (0)
Ramsey’s theorem (1981) (0)
The Hales-Jewett theorem (1981) (0)
Eigenvalues and Structures of Graphs A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Mathematics (2008) (0)
Apollonian ring packings Dedicated to Ron Graham (2016) (0)
Bounding the Number of Graphs Containing Very Long Induced Paths (2003) (0)
Recovering permutations over a deletion channel (2017) (0)
Spectral graph theory : Three common spectra ∗ Steve Butler (2006) (0)
Graphs with Few Edges, All in Short Cycles: 11265 (2009) (0)
Paperclip graphs (2019) (0)
Spectral graph theory : Cheeger constants and discrepancy ∗ Steve Butler (2006) (0)
Properties of a q-Analogue of Zero Forcing (2020) (0)
GRAPH IS EQUAL TO ITS ZERO FORCING NUMBER, M( G) = Z( G) (2013) (0)
Correction to: Properties of a q-Analogue of Zero Forcing (2018) (0)
More on random graphs and discrepancy for directed graphs Prepared by : Steven Butler November (2005) (0)
Zero forcing for inertia sets (2012) (0)
The theorems of Schur, Folkman, and Hindman (1981) (0)
Cospectral graphs for the normalized Laplacian by “ toggling ” (2016) (0)
The Mathematical Life of Fan Chung Steve Butler (2020) (0)
Numerical Tic-Tac-Toe on the 4×4 Board (2014) (0)
Szemerédi’s theorem (1981) (0)
The Passing of Ron Graham (2020) (0)
Cospectral Bipartite Graphs for the Normalized Laplacian Table of Contents (0)
A new proof for a modular condition of Lucas numbers (2010) (0)
THE MAXIMUM NULLITY OF A COMPLETE SUBDIVISION (2013) (0)
Graph Ramsey theory (1981) (0)
Spectral faux trees (2022) (0)
Jumping sequences (2008) (0)
ABSTRACTS OF TALKS PRESENTED TO THE ILLINOIS, INDIANA, AND MICHIGAN SECTIONS OF THE MAA 1. Introduction The Spring 2018 Tri-Section Meeting of the Illinois, Indiana, and Michigan Sections of the Mathemat- (2018) (0)
Furstenberg ’ s proof of long arithmetic progressions : Introduction to Roth ’ s Theorem (2004) (0)
Partition and sum is fast (2015) (0)
Estimating the number of graphs containing very long induced paths (2008) (0)
An interstice relationship for flowers with four petals (2013) (0)
A Jaunt in Spectral Graph Theory (2019) (0)
Shuffling with ordered cards (2010) (0)

This paper list is powered by the following services:

Other Resources About Steve Butler

What Schools Are Affiliated With Steve Butler ?

Steve Butler is affiliated with the following schools:

Steve Butler 's Academic­Influence.com Rankings

Steve Butler 's Degrees

Why Is Steve Butler Influential?

Steve Butler 's Published Works

Published Works

Other Resources About Steve Butler

What Schools Are Affiliated With Steve Butler ?

Steve Butler 's AcademicInfluence.com Rankings