Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin Defant
Person information
- affiliation: MIT, Cambridge, MA, USA
- affiliation (PhD 2022): Princeton University, Department of Mathematics, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Colin Defant, Rupert Li, Evita Nestoridi:
Rowmotion Markov chains. Adv. Appl. Math. 155: 102666 (2024)- [j37]Colin Defant, Valentin Féray, Philippe Nadeau, Nathan Williams:
Wiener Indices of Minuscule Lattices. Electron. J. Comb. 31(1) (2024) - [j36]Colin Defant, Noah Kravitz:
Loops and regions in Hitomezashi patterns. Discret. Math. 347(1): 113693 (2024) - 2023
- [j35]Colin Defant
:
Fertilitopes. Discret. Comput. Geom. 70(3): 713-752 (2023) - [j34]Colin Defant, Noah Kravitz, Bridget Eileen Tenner:
Extensions of hitomezashi patterns. Discret. Math. 346(10): 113555 (2023) - [j33]Noga Alon, Colin Defant, Noah Kravitz:
Typical and extremal aspects of friends-and-strangers graphs. J. Comb. Theory, Ser. B 158(Part): 3-42 (2023) - [j32]Colin Defant, Noah Kravitz:
Promotion Sorting. Order 40(1): 199-216 (2023) - 2022
- [j31]Colin Defant:
Meeting covered elements in ν-Tamari lattices. Adv. Appl. Math. 134: 102303 (2022) - [j30]Noga Alon, Colin Defant, Noah Kravitz:
The runsort permuton. Adv. Appl. Math. 139: 102361 (2022) - [j29]Colin Defant, Nathan Williams:
Crystal pop-stack sorting and type A crystal lattices. Eur. J. Comb. 103: 103514 (2022) - 2021
- [j28]Colin Defant, Kai Zheng:
Stack-sorting with consecutive-pattern-avoiding stacks. Adv. Appl. Math. 128: 102192 (2021) - [j27]Colin Defant, Andrew Elvey Price, Anthony J. Guttmann:
Asymptotics of 3-Stack-Sortable Permutations. Electron. J. Comb. 28(2): 2 (2021) - [j26]Colin Defant:
Enumeration of Stack-Sorting Preimages via a Decomposition Lemma. Discret. Math. Theor. Comput. Sci. 22(2) (2021) - [j25]Colin Defant:
Fertility monotonicity and average complexity of the stack-sorting map. Eur. J. Comb. 93: 103276 (2021) - [c1]Laurent David, Colin Defant, Michael Joseph, Matthew Macauley, Alex McDonough:
Dynamical Algebraic Combinatorics, Asynchronous Cellular Automata, and Toggling Independent Sets. AUTOMATA 2021: 5:1-5:16 - 2020
- [j24]Aaron Berger, Colin Defant:
On anti-powers in aperiodic recurrent words. Adv. Appl. Math. 121: 102104 (2020) - [j23]Colin Defant:
Fertility, strong fertility, and postorder Wilf equivalence. Australas. J Comb. 76: 149-182 (2020) - [j22]Colin Defant, Noah Kravitz:
Stack-sorting for words. Australas. J Comb. 77: 51-68 (2020) - [j21]Stephan Cho, Jay Cummings, Colin Defant, Claire Sonneborn:
Anti-Ramsey theory on complete bipartite graphs. AKCE Int. J. Graphs Comb. 17(3): 948-951 (2020) - [j20]Colin Defant:
Polyurethane Toggles. Electron. J. Comb. 27(2): 2 (2020) - [j19]Colin Defant, Noah Kravitz, Ashwin Sah:
Supertrees. Electron. J. Comb. 27(2): 2 (2020) - [j18]Colin Defant, James Propp:
Quantifying Noninvertibility in Discrete Dynamical Systems. Electron. J. Comb. 27(3): 3 (2020) - [j17]Noga Alon, Colin Defant:
Isoperimetry, stability, and irredundance in direct products. Discret. Math. 343(7): 111902 (2020) - [j16]Amanda Burcroff, Colin Defant:
Pattern-avoiding permutation powers. Discret. Math. 343(11): 112017 (2020) - [j15]Colin Defant:
Counting 3-stack-sortable permutations. J. Comb. Theory, Ser. A 172: 105209 (2020) - [j14]Colin Defant:
Catalan intervals and uniquely sorted permutations. J. Comb. Theory, Ser. A 174: 105250 (2020) - [j13]Colin Defant, Michael Engen, Jordan A. Miller:
Stack-sorting, set partitions, and Lassalle's sequence. J. Comb. Theory, Ser. A 175: 105275 (2020) - [i2]Noga Alon, Colin Defant, Noah Kravitz:
Typical and Extremal Aspects of Friends-and-Strangers Graphs. CoRR abs/2009.07840 (2020)
2010 – 2019
- 2019
- [j12]Colin Defant:
Proofs of Conjectures about Pattern-Avoiding Linear Extensions. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - 2018
- [j11]Colin Defant:
Flexible toggles and symmetric invertible asynchronous elementary cellular automata. Discret. Math. 341(9): 2367-2379 (2018) - [j10]Colin Defant, Sumun Iyer:
Domination and upper domination of direct product graphs. Discret. Math. 341(10): 2742-2752 (2018) - [j9]Colin Defant:
Ranges of Unitary Divisor Functions. Integers 18: A15 (2018) - 2017
- [j8]Colin Defant:
Anti-Power Prefixes of the Thue-Morse Word. Electron. J. Comb. 24(1): 1 (2017) - [j7]Colin Defant:
Postorder Preimages. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j6]Colin Defant:
Binary Codes and Period-2 Orbits of Sequential Dynamical Systems. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j5]Colin Defant:
Preimages Under the Stack-Sorting Algorithm. Graphs Comb. 33(1): 103-122 (2017) - 2016
- [j4]Colin Defant:
Unitary Cayley graphs of Dedekind domain quotients. AKCE Int. J. Graphs Comb. 13(1): 65-75 (2016) - [j3]Colin Defant:
Upper Bounds for Stern's Diatomic Sequence and Related Sequences. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [j2]Colin Defant:
On Sparsely Schemmel Totient Numbers. Integers 15: A18 (2015) - [j1]Colin Defant:
On Arithmetic Functions Related to Iterates of the Schemmel Totient Functions. J. Integer Seq. 18(2): 15.2.1 (2015) - [i1]Colin Defant:
Binary Codes and Period-$2$ Orbits of Sequential Dynamical Systems. CoRR abs/1509.03907 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-03 02:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
