The palindromization map ψ in a free monoid A was introduced in 1997 by the first author in the case of a binary alphabet A, and later extended by other authors to arbitrary alphabets. Acting on infinite words, ψ generates the class of standard episturmian words, including standard ArnouxRauzy words. In this paper we generalize the palindromization map, starting with a given code X over A. The ...

A regular map is a family of equivalent polygons, glued together to form a closed surface without boundaries which is vertex, edge and face transitive. The commonly known regular maps are derived from the Platonic solids and some tessellations of the torus. There are also regular maps of genus greater than 1 which are traditionally viewed as finitely generated groups. RMS (Regular Map Smoothing...

The presence of symmetries in a Hamiltonian system usually implies the existence of conservation laws that are represented mathematically in terms of the dynamical preservation of the level sets of a momentum mapping. The symplectic or Marsden–Weinstein reduction procedure takes advantage of this and associates to the original system a new Hamiltonian system with fewer degrees of freedom. Howev...

For a continuous map on the unit interval or circle, we define bifurcation set to be collection of those holes whose surviving is sensitive arbitrarily small changes (some of) their endpoints. By assuming global perspective and focusing geometric topological properties this rather than sets individual holes, obtain novel invariant for one-dimensional dynamics. We provide detailed description in...

In the paper we study (countably) compact and (absolutely) H-closed primitive topological inverse semigroups. We describe the structure of compact and countably compact primitive topological inverse semigroups and show that any countably compact primitive topological inverse semigroup embeds into a compact primitive topological inverse semigroup. In this paper all spaces are Hausdorff. A semigr...

This paper introduces a family of tetravalent graphs called rose window graphs, denoted by Rn(a, r), and investigates their symmetry properties. Four families of these graphs are shown to be edge-transitive and it is conjectured that every Rn(a, r) which is edge-transitive belongs to one of these families. Proofs and conjectures about the size of a dart-stabilizer and about regular maps contain...

Families of edge transitive algebraic graphs defined over finite commutative rings were used for the development of stream ciphers, public key cryptosystems and key exchange protocols. We present the results of the first implementation of a public key algorithm based on the family of algebraic graphs, which are not edge transitive. The absence of an edge transitive group of symmetries means tha...

Slovenija Abstract A vertex-transitive graph is said to be 1 2-transitive if its automor-phism group is vertex and edge but not arc-transitive. Some recent results on 1 2-transitive graphs are given, a few open problems proposed , and possible directions in the research of the structure of these graphs discussed. 1 In the beginning Throughout this paper graphs are simple and, unless otherwise s...