Recherche
Voici les éléments 51-60 de 84
Avoiding three consecutive blocks of the same size and same sum
(Association of Computing Machinery, 2014-04)
We show that there exists an infinite word over the alphabet {0,1,3,4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of Pirillo and Varricchio from1994.
There Exist Binary Circular 5/2+ Power Free Words of Every Length
(The Electronic Journal of Combinatorics, 2004-01-23)
We show that there exist binary circular 5/2+ power free words of every length.
Non repetitive walks in graphs and digraphs
(The University of Calgary, 1987-06)
A word $w$ over alphabet $\Sigma$ is {\em non-repetitive} if we cannot write $w=abbc$, $a,b,c\in\Sigma^*$, $b\ne\epsilon$. That is, no subword of $w$ appears twice in a row in $w$. In 1906, Axel Thue, the Norwegian number ...
A Characterization of Fractionally Well-Covered Graphs
(Ars Combinatoria, 1991)
A graph is called well-covered if every maximal independent set has the same size. One generalization of independent sets in graphs is that of a fractional cover -- attach nonnegative weights to the vertices and require ...
Binary Words Containing Infinitely Many Overlaps
(The Electronic Journal of Combinatorics, 2006-09-22)
We characterize the squares occurring in infinite overlap-free binary words and construct various α power-free binary words containing infinitely many overlaps.
Latent Profile Analysis of Manitoban Teachers' Burnout during the COVID-19 Pandemic
(University of Winnipeg, 2021-03)
The Number of Ternary Words Avoiding Abelian Cubes Grows Exponentially
(2004-06-19)
We show that the number of ternary words of length n avoiding abelian cubes grows
faster than r^n, where r = 2^{1/24}
It’s okay to be okay too. Why calling out teachers’ “toxic positivity” may backfire
(Canadian Education Network, 2020)
Automaticity of Primitive Words and Irreducible Polynomials
(Discrete Mathematics and Theoretical Computer Science, 2013)
If L is a language, the automaticity function AL(n) (resp. NL(n)) of L counts the number of states of a smallest deterministic (resp. non-deterministic) finite automaton that accepts a language that agrees with L on all ...
Constructing Regular Self-complementary Uniform Hypergraphs
(Journal of Combinatorial Designs, 2011-02-17)
In this paper, we examine the possible orders of t-subset-regular self-complementary k-uniform hypergraphs, which form examples of large sets of two isomorphic t-designs. We reformulate Khosrovshahi and Tayfeh-Rezaie's ...