AbstractThe n-dimensional Sierpiński gasket X, spanned by n+1 vertices, has (n+1)! symmetries acting as the symmetric group on the vertices. The object of this note is the remarkable observation that for n≥2 every topological automorphism of X is one of these symmetries. A modification of the arguments yields that, given any finite permutation group G≤Sn+1 acting on an (n+1)-element set, there is a finite subset T⫅X such that G is the group of topological automorphisms of X\T considered as a group acting faithfully on the vertices
AbstractIt is shown that for any given finite permutation group P there exist (infinitely many non-i...
AbstractThe purpose of the present note is essentially twofold. First we indicate how coverings of m...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
Every finite (permutation) group is the full symmetry group of a suitable linear program
Every finite (permutation) group is the full symmetry group of a suitable linear program
AbstractIn 1960, Sabidussi conjectured that if a graph G is isomorphic to the lexicographic product ...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractWe deal with the problem of representing several abstract groups simultaneously by one graph...
This thesis gives an introduction to some topics from group theory, with a focus on automorphism gro...
AbstractLet (Σ, σ) be a Zd-subshift of finite type. Under a strong irreducibility condition (strong ...
AbstractLet F be a finite set with a probability distribution {Pi: i ϵ F} and (Ω F, P) denote the pr...
Nasrabadi and Farimani [Indag. Math. (N. S.) 26(2015), 137-141] have given necessary and sufficient ...
AbstractWe show how results concerning infinite, locally finite, vertex-symmetric graphs can be rela...
This thesis gives an introduction to some topics from group theory, with a focus on automorphism gro...
This thesis gives an introduction to some topics from group theory, with a focus on automorphism gro...
AbstractIt is shown that for any given finite permutation group P there exist (infinitely many non-i...
AbstractThe purpose of the present note is essentially twofold. First we indicate how coverings of m...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
Every finite (permutation) group is the full symmetry group of a suitable linear program
Every finite (permutation) group is the full symmetry group of a suitable linear program
AbstractIn 1960, Sabidussi conjectured that if a graph G is isomorphic to the lexicographic product ...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractWe deal with the problem of representing several abstract groups simultaneously by one graph...
This thesis gives an introduction to some topics from group theory, with a focus on automorphism gro...
AbstractLet (Σ, σ) be a Zd-subshift of finite type. Under a strong irreducibility condition (strong ...
AbstractLet F be a finite set with a probability distribution {Pi: i ϵ F} and (Ω F, P) denote the pr...
Nasrabadi and Farimani [Indag. Math. (N. S.) 26(2015), 137-141] have given necessary and sufficient ...
AbstractWe show how results concerning infinite, locally finite, vertex-symmetric graphs can be rela...
This thesis gives an introduction to some topics from group theory, with a focus on automorphism gro...
This thesis gives an introduction to some topics from group theory, with a focus on automorphism gro...
AbstractIt is shown that for any given finite permutation group P there exist (infinitely many non-i...
AbstractThe purpose of the present note is essentially twofold. First we indicate how coverings of m...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...