Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Pajor, Ivo"'
The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a binary de Br
Externí odkaz:
http://arxiv.org/abs/2407.17367
Publikováno v:
Discrete Applied Mathematics 357 (2024) 352-364
In 1972 Mykkeltveit proved that the maximum number of vertex-disjoint cycles in the de Bruijn graphs of order $n$ is attained by the pure cycling register rule, as conjectured by Golomb. We generalize this result to the tensor product of the de Bruij
Externí odkaz:
http://arxiv.org/abs/2308.16257
Publikováno v:
In Discrete Applied Mathematics 15 November 2024 357:352-364
