Results 41 to 50 of about 73,359 (215)

On Correlation Polynomials and Subword Complexity [PDF]

Discrete Mathematics & Theoretical Computer Science, 2007
We consider words with letters from a $q-ary$ alphabet $\mathcal{A}$. The kth subword complexity of a word $w ∈\mathcal{A}^*$ is the number of distinct subwords of length $k$ that appear as contiguous subwords of $w$.
Irina Gheorghiciuc, Mark Daniel Ward
doaj   +1 more source

Subexponential estimations in Shirshov's height theorem (in English) [PDF]

, 2012
In 1993 E. I. Zelmanov asked the following question in Dniester Notebook: "Suppose that F_{2, m} is a 2-generated associative ring with the identity x^m=0.
, A. A. Lopatin, A. G. Kolotov, A. I. Shirshov, A. I. Shirshov, A. Kanel-Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, Aleksei Ya Belov, C. Procesi, E. N. Kuz'min, E. S. Chibrikov, G. P. Chekanu (Ciocanu), G. P. Chekanu (Ciocanu), Gh. Ciocanu, Gh. P. Ciocanu, Gh. P. Ciocanu, I. I. Bogdanov, M. I. Kharitonov, M. I. Kharitonov, M. Kharitonov, M. Lothaire, M. Lothaire, Mikhail I Kharitonov, S. P. Mishchenko, S. V. Pchelintsev, S. V. Pchelintsev, V. A. Ufnarovskij, V. A. Ufnarovskiĭ, V. A. Ufnarovskiĭ, V. A. Ufnarovskiĭ, V. Drensky, V. N. Latyshev, Yu. P. Razmyslov   +38 more
core   +2 more sources

On the Entropy and Letter Frequencies of Powerfree Words

Entropy, 2008
We review the recent progress in the investigation of powerfree words, with particular emphasis on binary cubefree and ternary squarefree words. Besides various bounds on the entropy, we provide bounds on letter frequencies and consider their empirical ...
Manuela Heuer, Uwe Grimm
doaj   +1 more source

Protected node profile of Tries [PDF]

Discrete Mathematics & Theoretical Computer Science, 2018
In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some practical motivations, e.g., in organizational schemes, security models and social-network models.
Mehri Javanian
doaj   +1 more source

Doubled patterns are $3$-avoidable [PDF]

, 2015
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern $p$ is said to
Ochem, Pascal
core   +2 more sources

Information theory: Sources, Dirichlet series, and realistic analyses of data structures [PDF]

Electronic Proceedings in Theoretical Computer Science, 2011
Most of the text algorithms build data structures on words, mainly trees, as digital trees (tries) or binary search trees (bst). The mechanism which produces symbols of the words (one symbol at each unit time) is called a source, in information theory ...
Mathieu Roux, Brigitte Vallée
doaj   +1 more source

Transition Property For Cube-Free Words [PDF]

, 2018
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structural property: for every pair $(u,v)$ of $d$-ary cube-free words, if $u$ can be infinitely extended to the right and $v$ can be infinitely extended to the ...
A Carpi, A Carpi, A Restivo, A Thue, A Thue, AM Shur, AM Shur, EA Petrova, EA Petrova, EA Petrova, EA Petrova, IN Tunev, J Karhumäki, J Shallit, JD Currie, JD Currie, N Guglielmi, NJ Fine, P Ochem, R Kolpakov, RM Jungers   +20 more
core   +1 more source

BPS operators in N = 4 $$ \mathcal{N}=4 $$ SO(N) super Yang-Mills theory: plethysms, dominoes and words

Journal of High Energy Physics, 2018
Permutations and associated algebras allow the construction of half and quarter BPS operators in maximally supersymmetric Yang Mills theory with U(N), SO(N) and Sp(N) gauge groups.
Christopher Lewis-Brown, Sanjaye Ramgoolam   +1 more
doaj   +1 more source

Pairwise Well-Formed Modes and Transformations

, 2017
One of the most significant attitudinal shifts in the history of music occurred in the Renaissance, when an emerging triadic consciousness moved musicians towards a new scalar formation that placed major thirds on a par with perfect fifths. In this paper
D Clampitt, J Nielsen, M Lothaire, N Carey, N Carey, T Noll, V Berthé, W Magnus   +7 more
core   +1 more source

Canonical Representatives of Morphic Permutations [PDF]

, 2015
An infinite permutation can be defined as a linear ordering of the set of natural numbers. In particular, an infinite permutation can be constructed with an aperiodic infinite word over $\{0,\ldots,q-1\}$ as the lexicographic order of the shifts of the ...
A Frid, A Valyuzhenich, C Bandt, DG Fon-Der-Flaass, J Amigó, J-M Dumont, J-P Allouche, J-P Allouche, M Lothaire, M Makarov, M Makarov, M Makarov, M Morse, S Elizalde, S Ferenczi, S Widmer, SV Avgustinovich, SV Avgustinovich   +17 more
core   +4 more sources