Colin Defant

Orcid: 0000-0002-4910-5765

Affiliations:
  • MIT, Cambridge, MA, USA
  • Princeton University, Department of Mathematics, NJ, USA (PhD 2022)


According to our database1, Colin Defant authored at least 39 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Rowmotion Markov chains.
Adv. Appl. Math., April, 2024

Loops and regions in Hitomezashi patterns.
Discret. Math., January, 2024

Wiener Indices of Minuscule Lattices.
Electron. J. Comb., 2024

2023
Fertilitopes.
Discret. Comput. Geom., October, 2023

Promotion Sorting.
Order, April, 2023

Typical and extremal aspects of friends-and-strangers graphs.
J. Comb. Theory, Ser. B, 2023

Extensions of hitomezashi patterns.
Discret. Math., 2023

2022
Crystal pop-stack sorting and type A crystal lattices.
Eur. J. Comb., 2022

Meeting covered elements in <i>ν</i>-Tamari lattices.
Adv. Appl. Math., 2022

The runsort permuton.
Adv. Appl. Math., 2022

2021
Fertility monotonicity and average complexity of the stack-sorting map.
Eur. J. Comb., 2021

Enumeration of Stack-Sorting Preimages via a Decomposition Lemma.
Discret. Math. Theor. Comput. Sci., 2021

Asymptotics of 3-Stack-Sortable Permutations.
Electron. J. Comb., 2021

Stack-sorting with consecutive-pattern-avoiding stacks.
Adv. Appl. Math., 2021

Dynamical Algebraic Combinatorics, Asynchronous Cellular Automata, and Toggling Independent Sets.
Proceedings of the 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, 2021

2020
Stack-sorting, set partitions, and Lassalle's sequence.
J. Comb. Theory, Ser. A, 2020

Catalan intervals and uniquely sorted permutations.
J. Comb. Theory, Ser. A, 2020

Counting 3-stack-sortable permutations.
J. Comb. Theory, Ser. A, 2020

Pattern-avoiding permutation powers.
Discret. Math., 2020

Isoperimetry, stability, and irredundance in direct products.
Discret. Math., 2020

Quantifying Noninvertibility in Discrete Dynamical Systems.
Electron. J. Comb., 2020

Supertrees.
Electron. J. Comb., 2020

Polyurethane Toggles.
Electron. J. Comb., 2020

Anti-Ramsey theory on complete bipartite graphs.
AKCE Int. J. Graphs Comb., 2020

Stack-sorting for words.
Australas. J Comb., 2020

Fertility, strong fertility, and postorder Wilf equivalence.
Australas. J Comb., 2020

On anti-powers in aperiodic recurrent words.
Adv. Appl. Math., 2020

2019
Proofs of Conjectures about Pattern-Avoiding Linear Extensions.
Discret. Math. Theor. Comput. Sci., 2019

2018
Ranges of Unitary Divisor Functions.
Integers, 2018

Domination and upper domination of direct product graphs.
Discret. Math., 2018

Flexible toggles and symmetric invertible asynchronous elementary cellular automata.
Discret. Math., 2018

2017
Preimages Under the Stack-Sorting Algorithm.
Graphs Comb., 2017

Binary Codes and Period-2 Orbits of Sequential Dynamical Systems.
Discret. Math. Theor. Comput. Sci., 2017

Postorder Preimages.
Discret. Math. Theor. Comput. Sci., 2017

Anti-Power Prefixes of the Thue-Morse Word.
Electron. J. Comb., 2017

2016
Upper Bounds for Stern's Diatomic Sequence and Related Sequences.
Electron. J. Comb., 2016

Unitary Cayley graphs of Dedekind domain quotients.
AKCE Int. J. Graphs Comb., 2016

2015
On Arithmetic Functions Related to Iterates of the Schemmel Totient Functions.
J. Integer Seq., 2015

On Sparsely Schemmel Totient Numbers.
Integers, 2015


  Loading...