186 citations
- Chalmers University of TechnologySE40 papers
- The Open UniversityGB11 papers
- Heriot-Watt UniversityGB7 papers
- B. Verkin Institute for Low Temperature Physics and Engineering of the National Academy of Sciences of UkraineUA5 papers
- Konkuk UniversityKR5 papers
- Friedrich-Alexander-Universität Erlangen-NürnbergDE3 papers
- KTH Royal Institute of TechnologySE3 papers
- Nicolaus Copernicus Astronomical CenterPL3 papers
- Silesian University in OpavaCZ3 papers
- TU Dortmund UniversityDE3 papers
- Boston UniversityUS2 papers
- Indiana University – Purdue University IndianapolisUS2 papers
4 papers · 1 filter
Permutations all of whose patterns of a given length are distinct
Peter Hegarty
For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation σ\in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lflo…
Finite automata and pattern avoidance in words
Petter Brändén, Toufik Mansour
We say that a word on a totally ordered alphabet avoids the word if there are no subsequences in order-equivalent to . In this paper we suggest a new approach to the…
The problem of the pawns
S. Kitaev, T. Mansour
In this paper we study the number of ways to place nonattacking pawns on an chessboard. We find an upper bound for and analyse its asymptotic behavi…
There are no iterated morphisms that define the Arshon sequence and the -sequence
Sergey Kitaev
Berstel proved that the Arshon sequence cannot be obtained by iteration of a morphism. An alternative proof of this fact is given here. The -sequence was constructed by Evdokimo…