Zobrazeno 1 - 8
of 8
pro vyhledávání: '"68R15, 68W32"'
Autor:
Woryna, Adam
We investigate the ratio $\rho_{n,L}$ of prefix codes to all uniquely decodable codes over an $n$-letter alphabet and with length distribution $L$. For any integers $n\geq 2$ and $m\geq 1$, we construct a lower bound and an upper bound for $\inf_L\rh
Externí odkaz:
http://arxiv.org/abs/1804.02531
Autor:
Schrijver, Alexander
The {\it partially disjoint paths problem} is: {\it given:} a directed graph, vertices $r_1,s_1,\ldots,r_k,s_k$, and a set $F$ of pairs $\{i,j\}$ from $\{1,\ldots,k\}$, {\it find:} for each $i=1,\ldots,k$ a directed $r_i-s_i$ path $P_i$ such that if
Externí odkaz:
http://arxiv.org/abs/1504.00185
Autor:
Rytter, Wojciech, Shur, Arseny M.
Publikováno v:
Theoretical Computer Science, Vol. 571 (2015), 50-57
In the area of pattern avoidability the central role is played by special words called Zimin patterns. The symbols of these patterns are treated as variables and the rank of the pattern is its number of variables. Zimin type of a word $x$ is introduc
Externí odkaz:
http://arxiv.org/abs/1409.8235
Autor:
Horan, Victoria, Hurlbert, Glenn
A Gray code is a listing structure for a set of combinatorial objects such that some consistent (usually minimal) change property is maintained throughout adjacent elements in the list. While Gray codes for m-ary strings have been considered in the p
Externí odkaz:
http://arxiv.org/abs/1403.1818
Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 that a string of length n contains at most 2n distinct squares. Ilie pres
Externí odkaz:
http://arxiv.org/abs/1310.3429
Autor:
Adam Woryna
Publikováno v:
Discrete Applied Mathematics. 244:205-213
We investigate the ratio ρ n , L of prefix codes to all uniquely decodable codes over an n -letter alphabet and with length distribution L . For any integers n ≥ 2 and m ≥ 1 , we construct a lower bound and an upper bound for inf L ρ n , L , th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a001d4554b858f31331134547d9c012
https://doi.org/10.1016/j.dam.2018.02.026
https://doi.org/10.1016/j.dam.2018.02.026
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2015, 180, pp.52-69. ⟨10.1016/j.dam.2014.08.016⟩
Discrete Applied Mathematics, Elsevier, 2015, 180, pp.52-69. ⟨10.1016/j.dam.2014.08.016⟩
Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 that a string of length n contains at most 2n distinct squares. Ilie pres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db2c85af2d3d143b67c4259f36c7a075
https://doi.org/10.1016/j.dam.2014.08.016
https://doi.org/10.1016/j.dam.2014.08.016
Autor:
Victoria Horan, Glenn Hurlbert
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :1450062
A Gray code is a listing structure for a set of combinatorial objects such that some consistent (usually minimal) change property is maintained throughout adjacent elements in the list. While Gray codes for m-ary strings have been considered in the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9315ff0881c66bd44d6c128088a310cd
https://doi.org/10.1142/s1793830914500621
https://doi.org/10.1142/s1793830914500621