Results 41 to 50 of about 67,579,596 (150)

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

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

1000 Words

, 2020
1000 Words is a leading online contemporary photography magazine. It commissions and publishes exhibition and photo book reviews, essays and interviews in response to the visual culture of our present moment.
Clark, Tim, 1000 Words
core   +6 more sources

Constructing Words with High Distinct Square Densities [PDF]

Electronic Proceedings in Theoretical Computer Science, 2017
Fraenkel and Simpson showed that the number of distinct squares in a word of length n is bounded from above by 2n, since at most two distinct squares have their rightmost, or last, occurrence begin at each position.
F. Blanchet-Sadri, S. Osborne
doaj   +1 more source

Finite-Repetition threshold for infinite ternary words [PDF]

Electronic Proceedings in Theoretical Computer Science, 2011
The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at most r(a ...
Golnaz Badkobeh, Maxime Crochemore
doaj   +1 more source

Mixed Steiner Triple Systems With Shortest Length

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley   +1 more source

Some combinatorics of rhomboid-shaped fully packed loop configurations [PDF]

Discrete Mathematics & Theoretical Computer Science, 2014
The study of rhomboid-shaped fully packed loop configurations (RFPLs) is inspired by the work of Fischer and Nadeau on triangular fully packed loop configurations (TFPLs).
Sabine Beil
doaj   +1 more source

On Fork‐Free t‐Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source

Tree Independence Number III. Thetas, Prisms and Stars

Journal of Graph Theory, EarlyView.
ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky, Sepehr Hajebi, Nicolas Trotignon   +2 more
wiley   +1 more source