It is well known that a continuous piecewise monotone interval map with positive topological entropy is semiconjugate to a map of a constant slope and the same entropy, and if it is additionally transitive then this semiconjugacy is actually a conjugacy. We generalize this result to piecewise continuous piecewise monotone interval maps, and as a consequence, get it also for piecewise monotone g...

We investigate a remarkable new planar piecewise isometry whose generating map is a permutation of four cones. For this system we prove the coexistence of an infinite number of periodic components and an uncountable number of transitive components. The union of all periodic components is an invariant pentagon with unequal sides. Transitive components are invariant curves on which the dynamics a...

In this paper we extend certain central results of zero dimensional systems to higher dimensions. The first main result shows that if (Y, f) is a finitely presented system, then there exists a Smale space (X,F ) and a u-resolving factor map π+ : X → Y . If the finitely presented system is transitive, then we show there is a canonical minimal u-resolving Smale space extension. Additionally, we s...

A subgroup G of automorphisms of a graph X is said to be 2 -arc-transitive if it is vertexand edgebut not arc-transitive. The graph X is said to be 2 -arc-transitive if Aut X is 1 2 -arc-transitive. The interplay of two different concepts, maps and hypermaps on one side and 2 -arc-transitive group actions on graphs on the other, is investigated. The correspondence between regular maps and 2 -ar...

A hierarchical structure is a stack of successively reduced image representations. Each basic element of a hierarchical structure is the father of a set of elements in the level below. The transitive closure of this father–child relationship associates to each element of the hierarchy a set of basic elements in the base level image representation. Such a set, called a receptive field, defines t...

A cycle decomposition of a graph Γ is a set C of cycles of Γ such that every edge of Γ belongs to exactly one cycle in C. Such a decomposition is called arc-transitive if the group of automorphisms of Γ that preserve C setwise acts transitively on the arcs of Γ . In this paper, we study arc-transitive cycle decompositions of tetravalent graphs. In particular, we are interested in determining an...

Let M be a reductive monoid with unit group G. Let denote the idempotent cross-section of the G × G-orbits on M . If W is the Weyl group of G and e, f ∈ with e ≤ f , we introduce a projection map from WeW to WfW. We use these projection maps to obtain a new description of the Bruhat-Chevalley order on the Renner monoid of M . For the canonical compactification X of a semisimple group G0 with Bo...

Let ? be a finite, undirected, connected, simple graph. We say that matching M is permutable m -matching if contains edges and the subgroup of Aut ( ) fixes setwise allows to permuted in any fashion. A 2-transitive stabilizer can map ordered pair distinct other . provide constructions graphs with matching; we show that, an arc-transitive graph for ? 4 , then degree at least ; and, when sufficie...

Recently the classification of all possible faithful transitive permutation representations group symmetries a regular toroidal map was accomplished. In this paper we complete investigation on surface genus 1 considering hypermap type (3, 3, 3).