نتایج جستجو برای: line transitive
تعداد نتایج: 419257 فیلتر نتایج به سال:
We discuss the relation between (topological) transitivity and strong transitivity of dynamical systems. We show that a transitive and open self-map of a compact metric space satisfying a certain expanding condition is strongly transitive. We also prove a couple of results for interval maps; for example it is shown that a transitive piecewise monotone interval map is strongly transitive.
In an in nite digraph D an edge e is reachable from an edge e if there exists an alternating walk in D whose initial and terminal edges are e and e Reachability is an equivalence relation and if D is arc transitive then this relation is either universal or all of its equiv alence classes induce isomorphic bipartite digraphs In Question Cameron Praeger and Wormald asked if there exist highly arc...
In the paper, we study behaviour of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behaviour of the system w.r.t. variety of word transformations performed by the system: We call a system completely transitive if, given arbitrary pair a, b of finite words that have equal lengths, the system A, while evolution during (discrete...
A graph Γ is said to be locally (G, 2)-arc transitive for G a subgroup of Aut(Γ) if, for any vertex α of Γ, G is transitive on the 2-arcs of Γ starting at α. In this talk, we will discuss general results involving locally (G, 2)-arc transitive graphs and recent progress toward the classification of the locally (G, 2)-arc transitive graphs, where Sz(q) ≤ G ≤ Aut(Sz(q)), q = 2 for some k ∈ N. In ...
Using new results on sharply transitive subsets, we determine the groups of projectivities of finite affine planes, apart from (unknown) planes of order 23 or 24. The group of all projectivities of a geometry G is a measure for the complexity of G: this group tends to be rather large if G is far from being a classical geometry. See [PS81] for more information on the role of projectivities in ge...
Known doubly transitive permutation groups are well studied and the classification of all doubly transitive groups has been done by applying the classification of the finite simple groups. Readers may refer to [6]. This may mean that it is not still sufficient to study doubly transitive groups as permutation groups. Typical arguments on doubly transitive groups are seen in the book[3]. In the p...
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
A digraph is 3-quasi-transitive (resp. 3-transitive), if for any path x0x1 x2x3 of length 3, x0 and x3 are adjacent (resp. x0 dominates x3). César Hernández-Cruz conjectured that if D is a 3-quasi-transitive digraph, then the underlying graph of D, UG(D), admits a 3-transitive orientation. In this paper, we shall prove that the conjecture is true.
The aim of this paper is to prove a Morse conjecture; in particular it is shown that a topologically transitive analytic flow on a compact surface is metrically transitive. We also build smooth topologically transitive flows on surfaces which are not metrically transitive.
A con guration is weakly ag transitive if its group of automor phisms acts intransitively on ags but the group of all automorphisms and anti automorphisms acts transitively on ags It is shown that weakly ag transitive con gurations are in one to one correspondence with bipartite arc transitive graphs of girth not less than Sev eral in nite families of weakly ag transitive con gurations are gi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید