Related papers: The $k$-orbit theory and polycirculant conjecture

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

By the investigation of $k$-orbits symmetry properties it is obtained a simple proof of the B. Fein, W. M. Kantor and M. Schacher Theorem: any transitive permutation group contains a non-trivial fixed-point-free prime-power element. Key…

This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive…

For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…

Let $R$ be a commutative $k-$algebra over a field $k$. Assume $R$ is a noetherian, infinite, integral domain. The group of $k-$automorphisms of $R$,i.e.$Aut_k(R)$ acts in a natural way on $(R-k)$.In the first part of this article, we study…

The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positions. We introduce a cyclic decomposition for k-permutations…

We address several specific aspects of the following general question: can a field K have so many automorphisms that the action of the automorphism group on the elements of K has relatively few orbits? We prove that any field which has only…

The orbit graph of a k-orbit polytope is a graph on k nodes that shows how the flag orbits are related by flag adjacency. Using orbit graphs, we classify k-orbit polytopes and determine when a k-orbit polytope is i-transitive. We then…

This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…

A $k$-orbit maniplex is one that has $k$ orbits of flags under the action of its automorphism group. In this paper we extend the notion of symmetry type graphs of maps to that of maniplexes and polytopes and make use of them to study…

We show that for various natural classes of groups and appropriately defined K- and L-theoretic functors, injectivity or bijectivity of the assembly map follows from the Isomorphism Conjecture being true for acyclic groups lying within that…

We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…

In this article, we give an elementary combinatorial proof of a conjecture about the determination of automorphism group of the power graph of finite cyclic groups, proposed by Doostabadi, Erfanian and Jafarzadeh in 2013.

We prove in this paper that the periodic cyclic homology of the quantized algebras of functions on coadjoint orbits of connected and simply connected Lie group, are isomorphic to the periodic cyclic homology of the quantized algebras of…

In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize…

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…

Recent discoveries make it possible to compute the K-theory of certain rings from their cyclic homology and certain versions of their cdh-cohomology. We extend the work of G. Corti\~nas et al. who calculated the K-theory of, in addition to…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

A graph is called {\em arc-transitive} (or {\em symmetric}) if its automorphism group has a single orbit on ordered pairs of adjacent vertices, and 2-arc-transitive its automorphism group has a single orbit on ordered paths of length 2. In…

In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…