Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Adam Woryna"'
Autor:
Adam Woryna
Publikováno v:
Discrete Mathematics. 345:112855
Given a vertex colouring of the infinite $n$-ary Cantor tree with $m$ colours ($n,m\geq 2$), the natural problem arises: may this colouring induce a bijective colouring of the infinite paths starting at the root, i.e., that every infinite $m$-coloure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ba03651a6d838158bb3d5d08a67e4bf
https://doi.org/10.1016/j.disc.2022.112855
https://doi.org/10.1016/j.disc.2022.112855
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
Autor:
Adam Woryna
Publikováno v:
Journal of Computer and System Sciences. 86:181-190
Extending the notion of bi-reversibility to automata over a changing alphabet.Absence of 2-state bi-reversible automata over a bounded changing alphabet which generate the non-abelian free group F2.Natural and applicable realization of F2 by a 2-stat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb4a77d208e64b74d96e7fd60d74581f
https://doi.org/10.1016/j.jcss.2017.01.004
https://doi.org/10.1016/j.jcss.2017.01.004
Autor:
Adam Woryna
Publikováno v:
Forum Mathematicum. 28:1205-1213
We investigate the recently obtained condition [9] for amenability of groups generated by bounded automorphisms of a spherically homogeneous rooted tree together with our group construction [13] based on the notion of a homogeneous automorphism and i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3209031827a9cf7f82a21fd2100c8e4
https://doi.org/10.1515/forum-2015-0231
https://doi.org/10.1515/forum-2015-0231
Autor:
Adam Woryna
Publikováno v:
Discrete Mathematics. 343:111939
Let L be a finite sequence of natural numbers. In Woryna (2017, 2018), we derived some interesting properties for the ratio ρ n , L = | P R n ( L ) | ∕ | U D n ( L ) | , where U D n ( L ) denotes the set of all codes over an n -letter alphabet and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d890ba5d77f15a63a2c077b9ef71fa4
https://doi.org/10.1016/j.disc.2020.111939
https://doi.org/10.1016/j.disc.2020.111939
Autor:
Adam Woryna
Publikováno v:
Journal of Pure and Applied Algebra. 219:1564-1591
We use the combinatorial language of automata to define and study profinite groups which are infinitely iterated permutational wreath products of transitive finite permutation groups. We provide some naturally defined automaton realizations of these
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf79e076b5efd6cc1ba2bae3d541c5c6
https://doi.org/10.1016/j.jpaa.2014.06.016
https://doi.org/10.1016/j.jpaa.2014.06.016
Autor:
Adam Woryna
Publikováno v:
Journal of Algebraic Combinatorics. 42:365-390
Let $$(H_i)_{i\ge 1}$$(Hi)i?1 be an arbitrary sequence of non-Abelian finite simple transitive permutation groups. By using the combinatorial language of time-varying automata, we provide an explicit and naturally defined construction of a two-elemen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d4dfac6f3fc41d5652c8298bbca4eab
https://doi.org/10.1007/s10801-015-0584-3
https://doi.org/10.1007/s10801-015-0584-3
Autor:
Adam Woryna
Publikováno v:
Journal of Algebra. 405:232-242
We show that for every n ⩾ 5 the infinite permutational wreath power of the alternating group of degree n with its natural permutation representation is topologically generated by a 2-state automaton, answering the question on the existence of a mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1c6f399510e52be78e29010fe9f273b
https://doi.org/10.1016/j.jalgebra.2014.01.038
https://doi.org/10.1016/j.jalgebra.2014.01.038
Autor:
Adam Woryna
Publikováno v:
Communications in Algebra. 42:1354-1361
We study profinite groups which are infinitely iterated wreath products W ∞ = …≀C n 2 ≀C n 1 of finite cyclic groups via combinatorial language of transducers. Namely, we provide a naturally defined automaton realization of the group W ∞ by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ef63bad3563100d7f573bb804ec319a
https://doi.org/10.1080/00927872.2012.738749
https://doi.org/10.1080/00927872.2012.738749
The topological decomposition of inverse limits of iterated wreath products of finite Abelian groups
Autor:
Adam Woryna
Publikováno v:
form. 25:1263-1290
Let be an arbitrary infinite sequence of nontrivial finite Abelian transitive groups such that the topological rank ρ of the infinite Cartesian product of these groups is finite. We consider the corresponding inverse limit of iterated permutational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db97d8f47d1f679cad2ff8d1f93bddd5
https://doi.org/10.1515/forum-2012-0132
https://doi.org/10.1515/forum-2012-0132