default search action
James D. Currie
Person information
- affiliation: University of Winnipeg, Department of Mathematics and Statistics, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j61]James D. Currie, Narad Rampersad:
A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2. RAIRO Theor. Informatics Appl. 58: 14 (2024) - [i35]James D. Currie, Lucas Mol, Jarkko Peltomäki:
The repetition threshold for ternary rich words. CoRR abs/2409.12068 (2024) - 2023
- [j60]James D. Currie
, Pascal Ochem
Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. 57: 1 (2023) - [i34]James D. Currie:
The analogue of overlap-freeness for the period-doubling sequence. CoRR abs/2303.14539 (2023) - [i33]James D. Currie, Narad Rampersad:
The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold. CoRR abs/2310.07010 (2023) - [i32]James D. Currie, Narad Rampersad:
The analogue of overlap-freeness for the Fibonacci morphism. CoRR abs/2311.12962 (2023) - [i31]James D. Currie, Narad Rampersad:
A small morphism giving Abelian repetition threshold less than 2. CoRR abs/2312.16665 (2023) - 2022
- [i30]James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Properties of a Ternary Infinite Word. CoRR abs/2206.01776 (2022) - [i29]Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Antisquares and Critical Exponents. CoRR abs/2209.09223 (2022) - [i28]James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Complement Avoidance in Binary Words. CoRR abs/2209.09598 (2022) - 2021
- [j59]James D. Currie, Jesse T. Johnson:
Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101. Theor. Comput. Sci. 850: 30-39 (2021) - [j58]James D. Currie, Lucas Mol
The undirected repetition threshold and undirected pattern avoidance. Theor. Comput. Sci. 866: 56-69 (2021) - [i27]James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR abs/2111.07857 (2021) - 2020
- [j57]James D. Currie, Lucas Mol, Narad Rampersad:
The repetition threshold for binary rich words. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j56]James D. Currie, Lucas Mol, Narad Rampersad:
The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27. J. Integer Seq. 23(3): 20.3.1 (2020) - [i26]James D. Currie, Lucas Mol:
The undirected repetition threshold and undirected pattern avoidance. CoRR abs/2006.07474 (2020)
2010 – 2019
- 2019
- [j55]James D. Currie, Lucas Mol, Narad Rampersad:
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture. Electron. J. Comb. 26(2): 2 (2019) - [j54]James D. Currie:
Finite Test Sets for Morphisms That Are Squarefree on Some of Thue's Squarefree Ternary Words. J. Integer Seq. 22(8): 19.8.2 (2019) - [j53]James D. Currie, Tero Harju
Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. 799: 140-148 (2019) - [c7]James D. Currie
The Undirected Repetition Threshold. WORDS 2019: 145-158 - [i25]James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad:
Some further results on squarefree arithmetic progressions in infinite words. CoRR abs/1901.06351 (2019) - [i24]James D. Currie:
Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words. CoRR abs/1902.05651 (2019) - [i23]James D. Currie, Lucas Mol:
The undirected repetition threshold. CoRR abs/1904.10029 (2019) - [i22]James D. Currie, Lucas Mol, Narad Rampersad:
The repetition threshold for binary rich words. CoRR abs/1908.03169 (2019) - [i21]James D. Currie, Lucas Mol, Narad Rampersad:
The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27. CoRR abs/1911.05779 (2019) - 2018
- [j52]James D. Currie, Lucas Mol
Avoidance bases for formulas with reversal. Theor. Comput. Sci. 738: 25-41 (2018) - [j51]James D. Currie, Florin Manea, Dirk Nowotka, Kamellia Reshadi
Unary patterns under permutations. Theor. Comput. Sci. 743: 72-82 (2018) - [i20]James D. Currie, Lucas Mol, Narad Rampersad:
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture. CoRR abs/1803.08145 (2018) - 2017
- [j50]James D. Currie, Lucas Mol
A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. 27(5): 477-493 (2017) - [j49]James D. Currie, Lucas Mol
On avoidability of formulas with reversal. RAIRO Theor. Informatics Appl. 51(4): 181-189 (2017) - 2016
- [j48]James D. Currie, Philip Lafrance:
Avoidability Index for Binary Patterns with Reversal. Electron. J. Comb. 23(1): 1 (2016) - [j47]James D. Currie:
A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$. Electron. J. Comb. 23(2): 2 (2016) - [j46]James D. Currie
Growth rate of binary words avoiding xxxR. Theor. Comput. Sci. 609: 456-468 (2016) - [i19]James D. Currie:
A ternary square-free sequence avoiding factors equivalent to abcacba. CoRR abs/1603.03059 (2016) - 2015
- [j45]James D. Currie, Narad Rampersad:
Binary Words Avoiding x xR x and Strongly Unimodal Sequences. J. Integer Seq. 18(10): 15.10.3 (2015) - [c6]James D. Currie, Florin Manea, Dirk Nowotka:
Unary Patterns with Permutations. DLT 2015: 191-202 - [i18]James D. Currie, Narad Rampersad:
Growth rate of binary words avoiding xxxR. CoRR abs/1502.07014 (2015) - [i17]James D. Currie, Philip Lafrance:
Avoidability index for binary patterns with reversal. CoRR abs/1508.02101 (2015) - [i16]James D. Currie, Narad Rampersad:
Binary words avoiding xx^Rx and strongly unimodal sequences. CoRR abs/1508.02964 (2015) - 2014
- [j44]James D. Currie, Kalle Saari:
Square-free Words with Square-free Self-shuffles. Electron. J. Comb. 21(1): 1 (2014) - [j43]James D. Currie, Narad Rampersad
Extremal words in morphic subshifts. Discret. Math. 322: 53-60 (2014) - [j42]Francine Blanchet-Sadri, James D. Currie, Narad Rampersad, Nathan Fox:
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1. Integers 14: A11 (2014) - [j41]Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit:
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. J. ACM 61(2): 10:1-10:17 (2014) - [j40]James D. Currie:
The Least Self-Shuffle of the Thue-Morse Sequence. J. Integer Seq. 17(10): 14.10.2 (2014) - [i15]Maxime Crochemore, James D. Currie, Gregory Kucherov, Dirk Nowotka:
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111). Dagstuhl Reports 4(3): 28-46 (2014) - 2013
- [j39]James D. Currie:
Infinite ternary square-free words concatenated from permutations of a single word. Theor. Comput. Sci. 482: 1-8 (2013) - [c5]James D. Currie, Narad Rampersad, Kalle Saari:
Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). WORDS 2013: 95-106 - [c4]James D. Currie, Narad Rampersad, Kalle Saari:
Extremal Words in the Shift Orbit Closure of a Morphic Sequence. Developments in Language Theory 2013: 143-154 - [i14]James D. Currie, Narad Rampersad, Kalle Saari:
Extremal words in the shift orbit closure of a morphic sequence. CoRR abs/1301.4972 (2013) - [i13]James D. Currie, Narad Rampersad, Kalle Saari:
Suffix conjugates for a class of morphic subshifts. CoRR abs/1307.5329 (2013) - 2012
- [j38]Bastian Bischoff, James D. Currie, Dirk Nowotka:
Unary Patterns with involution. Int. J. Found. Comput. Sci. 23(8): 1641-1652 (2012) - [j37]James D. Currie, Narad Rampersad:
Fixed points avoiding Abelian k-powers. J. Comb. Theory A 119(5): 942-948 (2012) - [i12]James D. Currie:
Infinite ternary square-free words concatenated from permutations of a single word. CoRR abs/1207.3445 (2012) - 2011
- [j36]James D. Currie, Narad Rampersad:
Recurrent words with constant Abelian complexity. Adv. Appl. Math. 47(1): 116-124 (2011) - [j35]James D. Currie, Narad Rampersad:
A proof of Dejean's conjecture. Math. Comput. 80(274): 1063-1070 (2011) - [j34]James D. Currie:
Lexicographically least words in the orbit closure of the Rudin-Shapiro word. Theor. Comput. Sci. 412(35): 4742-4746 (2011) - [i11]James D. Currie:
Pattern avoidance with involution. CoRR abs/1105.2849 (2011) - [i10]James D. Currie, Narad Rampersad:
Fixed points avoiding Abelian $k$-powers. CoRR abs/1106.1842 (2011) - [i9]Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit:
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. CoRR abs/1106.5204 (2011) - 2010
- [j33]James D. Currie, Narad Rampersad:
Cubefree words with many squares. Discret. Math. Theor. Comput. Sci. 12(3): 29-34 (2010) - [j32]James D. Currie, Narad Rampersad:
Infinite words containing squares at every position. RAIRO Theor. Informatics Appl. 44(1): 113-124 (2010)
2000 – 2009
- 2009
- [j31]James D. Currie, Narad Rampersad:
There are k-uniform cubefree binary morphisms for all k>=0. Discret. Appl. Math. 157(11): 2548-2551 (2009) - [j30]James D. Currie, Kalle Saari:
Least Periods of Factors of Infinite Words. RAIRO Theor. Informatics Appl. 43(1): 165-178 (2009) - [j29]James D. Currie, Narad Rampersad:
Dejean's conjecture holds for $\sf {N\ge 27}$. RAIRO Theor. Informatics Appl. 43(4): 775-778 (2009) - [j28]James D. Currie, Ali Aberkane:
A cyclic binary morphism avoiding Abelian fourth powers. Theor. Comput. Sci. 410(1): 44-52 (2009) - [j27]James D. Currie, Narad Rampersad:
Dejean's conjecture holds for n>=30. Theor. Comput. Sci. 410(30-32): 2885-2888 (2009) - [i8]James D. Currie, Narad Rampersad:
Dejean's conjecture holds for n>=27. CoRR abs/0901.3188 (2009) - [i7]James D. Currie, Narad Rampersad:
A proof of Dejean's conjecture. CoRR abs/0905.1129 (2009) - [i6]James D. Currie:
The lexicographically least word in the orbit closure of the Rudin-Shapiro word. CoRR abs/0905.4923 (2009) - 2008
- [j26]James D. Currie, Narad Rampersad:
For each α > 2 there is an Infinite Binary Word with Critical Exponent α. Electron. J. Comb. 15(1) (2008) - [j25]James D. Currie:
Palindrome positions in ternary square-free words. Theor. Comput. Sci. 396(1-3): 254-257 (2008) - [j24]James D. Currie, Terry I. Visentin:
Long binary patterns are Abelian 2-avoidable. Theor. Comput. Sci. 409(3): 432-437 (2008) - [i5]James D. Currie, Narad Rampersad:
For each $α$ > 2 there is an infinite binary word with critical exponent $α$. CoRR abs/0802.4095 (2008) - [i4]James D. Currie, Narad Rampersad:
Infinite words containing squares at every position. CoRR abs/0803.1189 (2008) - [i3]James D. Currie, Narad Rampersad:
Dejean's conjecture holds for n >= 30. CoRR abs/0806.0043 (2008) - [i2]James D. Currie, Narad Rampersad:
Cubefree words with many squares. CoRR abs/0811.3233 (2008) - [i1]James D. Currie, Narad Rampersad:
There are k-uniform cubefree binary morphisms for all k >= 0. CoRR abs/0812.4470 (2008) - 2007
- [j23]James D. Currie, Terry I. Visentin:
On Abelian 2-avoidable binary patterns. Acta Informatica 43(8): 521-533 (2007) - [j22]Morteza Mohammad Noori, James D. Currie:
Dejean's conjecture and Sturmian words. Eur. J. Comb. 28(3): 876-890 (2007) - 2006
- [j21]James D. Currie, Narad Rampersad, Jeffrey O. Shallit:
Binary Words Containing Infinitely Many Overlaps. Electron. J. Comb. 13(1) (2006) - 2005
- [j20]Ali Aberkane, James D. Currie:
The Thue-Morse word contains circular 5/2+ power free words of every length. Theor. Comput. Sci. 332(1-3): 573-581 (2005) - [j19]James D. Currie:
Pattern avoidance: themes and variations. Theor. Comput. Sci. 339(1): 7-18 (2005) - 2004
- [j18]Ali Aberkane, James D. Currie:
There Exist Binary Circular 5/2+ Power Free Words of Every Length. Electron. J. Comb. 11(1) (2004) - [j17]James D. Currie:
The number of binary words avoiding abelian fourth powers grows exponentially. Theor. Comput. Sci. 319(1-3): 441-446 (2004) - 2003
- [j16]James D. Currie, Erica Moodie:
A word on 7 letters which is non-repetitive up to mod 5. Acta Informatica 39(6-7): 451-468 (2003) - [j15]James D. Currie, Cameron W. Pierce:
The Fixing Block Method in Combinatorics on Words. Comb. 23(4): 571-584 (2003) - [j14]James D. Currie, Robert O. Shelton:
The set of k-power free words over sigma is empty or perfect, . Eur. J. Comb. 24(5): 573-580 (2003) - [c3]James D. Currie:
What Is the Abelian Analogue of Dejean's Conjecture? Grammars and Automata for String Processing 2003: 237-242 - 2002
- [j13]James D. Currie:
There Are Ternary Circular Square-Free Words of Length n for n >= 18. Electron. J. Comb. 9(1) (2002) - [j12]James D. Currie, Jamie Simpson:
Non-Repetitive Tilings. Electron. J. Comb. 9(1) (2002) - [j11]James D. Currie:
No iterated morphism generates any Arshon sequence of odd order. Discret. Math. 259(1-3): 277-283 (2002) - [j10]James D. Currie, Terry I. Visentin:
Counting Endomorphisms of Crown-like Orders. Order 19(4): 305-317 (2002) - [c2]James D. Currie, D. Sean Fitzpatrick:
Circular Words Avoiding Patterns. Developments in Language Theory 2002: 319-325
1990 – 1999
- 1999
- [j9]Julien Cassaigne, James D. Currie:
Words Strongly Avoiding Fractional Powers. Eur. J. Comb. 20(8): 725-737 (1999) - [j8]James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit:
Separating Words with Small Grammars. J. Autom. Lang. Comb. 4(2): 101-110 (1999) - 1998
- [j7]Jean-Paul Allouche
Extremal Infinite Overlap-Free Binary Words. Electron. J. Comb. 5 (1998) - 1996
- [j6]James D. Currie:
Non-Repetitive Words: Ages and Essences. Comb. 16(1): 19-40 (1996) - [j5]James D. Currie, Robert O. Shelton:
Cantor Sets and Dejean's Conjecture. J. Autom. Lang. Comb. 1(2): 113-127 (1996) - 1995
- [j4]James D. Currie:
A Note on Antichains of Words. Electron. J. Comb. 2 (1995) - [j3]James D. Currie:
On the structure and extendibility of k-power free words. Eur. J. Comb. 16(2): 111-124 (1995) - [c1]James D. Currie, Robert O. Shelton:
Cantor Sets and Dejean's Conjecture. Developments in Language Theory 1995: 35-43 - 1992
- [j2]James D. Currie:
Connectivity of distance graphs. Discret. Math. 103(1): 91-94 (1992) - 1991
- [j1]James D. Currie:
Which graphs allow infinite nonrepetitive walks? Discret. Math. 87(3): 249-260 (1991)
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-10-22 21:14 CEST 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: