Search Results for ""

In the course of searching for continued fraction identities, Raayoni (2021) and Elimelech et al. (2023) noticed that while the numerator and denominator of continued ...

Transitivity is a result of the symmetry in the group. A group G is called transitive if its group action (understood to be a subgroup of a permutation group on a set Omega) ...

Two points on a surface which are opposite to each other but not farthest from each other (e.g., the midpoints of opposite edges of a cube) are said to be transitive points. ...

A group is called k-transitive group if there exists a set of elements on which the group acts faithfully and k-transitively. It should be noted that transitivity computed ...

A function f is topologically transitive if, given any two intervals U and V, there is some positive integer k such that f^k(U) intersection V!=emptyset. Vaguely, this means ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...