Jamie Simpson

From MaRDI portal
Person:686459

Available identifiers

zbMath Open simpson.jamieWikidataQ102208320 ScholiaQ102208320MaRDI QIDQ686459

List of research outcomes





PublicationDate of PublicationType
Counting subwords in circular words and their Parikh matrices2024-01-08Paper
https://portal.mardi4nfdi.de/entity/Q51397062020-12-10Paper
https://portal.mardi4nfdi.de/entity/Q51396872020-12-10Paper
More properties of the Fibonacci word on an infinite alphabet2019-10-18Paper
A different approach to the Fraenkel Conjecture for low $n$ values2019-09-25Paper
Palindromes in starlike trees2019-05-23Paper
Solved and unsolved problems about abelian squares2018-02-13Paper
Counting Lyndon factors2017-09-08Paper
https://portal.mardi4nfdi.de/entity/Q52675182017-06-13Paper
An abelian periodicity lemma2017-02-06Paper
Symmetric difference-free and symmetric difference-closed collections of sets2015-01-20Paper
Palindromes in circular words2014-08-26Paper
Corrigendum to: ``The exact number of squares in Fibonacci words2014-07-25Paper
The total run length of a word2014-01-10Paper
Intersecting rational Beatty sequences2013-10-25Paper
More results on overlapping squares2013-06-24Paper
A general two-term recurrence2013-03-06Paper
https://portal.mardi4nfdi.de/entity/Q31660992012-10-21Paper
https://portal.mardi4nfdi.de/entity/Q53935562011-04-18Paper
https://portal.mardi4nfdi.de/entity/Q35658632010-06-07Paper
Incongruent restricted disjoint covering systems2009-12-10Paper
Intersecting periodic words2009-06-22Paper
Words with simple Burrows-Wheeler transforms2009-04-07Paper
https://portal.mardi4nfdi.de/entity/Q55033422009-01-15Paper
How many runs can a string contain?2008-07-31Paper
Combinatorial Pattern Matching2005-12-14Paper
https://portal.mardi4nfdi.de/entity/Q30251982005-07-13Paper
An extension of the periodicity lemma to longer periods2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q48314822005-01-03Paper
https://portal.mardi4nfdi.de/entity/Q44306202003-10-12Paper
On disjoint covering systems with precisely one repeated modulus2003-06-15Paper
Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester2003-02-19Paper
https://portal.mardi4nfdi.de/entity/Q45477382002-08-21Paper
Non-repetitive tilings2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q43307242002-05-14Paper
The subword complexity of a two-parameter family of sequences2001-10-16Paper
Aviezri Fraenkel's work in number theory2001-10-16Paper
Covering systems of homogeneous congruences1999-09-14Paper
The exact number of squares in Fibonacci words1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q43800481998-10-27Paper
How many squares can a string contain?1998-10-18Paper
Edge-disjoint maximal planar graphs1998-01-26Paper
https://portal.mardi4nfdi.de/entity/Q43496111997-11-12Paper
https://portal.mardi4nfdi.de/entity/Q48537161995-11-02Paper
How many squares must a binary sequence contain?1995-04-06Paper
https://portal.mardi4nfdi.de/entity/Q42860721995-01-22Paper
https://portal.mardi4nfdi.de/entity/Q43091081994-10-12Paper
Beatty sequences and Langford sequences1994-06-26Paper
On Infinite Disjoint Covering Systems1994-03-17Paper
https://portal.mardi4nfdi.de/entity/Q42724141994-01-26Paper
Disjoint covering systems of rational Beatty sequences1992-06-28Paper
Necessary conditions for distinct covering systems with square-free moduli1991-01-01Paper
Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions1988-01-01Paper
Exact coverings of the integers by arithmetic progressions1986-01-01Paper
Regular coverings of the integers by arithmetic progressions1985-01-01Paper
Covering the integers with arithmetic progressions1985-01-01Paper
Palindromic PeriodicitiesN/APaper

Research outcomes over time

This page was built for person: Jamie Simpson