Stably Cayley Groups in Characteristic
نویسندگان
چکیده
A linear algebraic group G over a field k is called a Cayley group if it admits a Cayley map, i.e., a G-equivariant birational isomorphism over k between the group variety G and its Lie algebra. A Cayley map can be thought of as a partial algebraic analogue of the exponential map. A prototypical example is the classical “Cayley transform” for the special orthogonal group SOn defined by Arthur Cayley in 1846. A linear algebraic group G is called stably Cayley if G×Gm is Cayley for some r ≥ 0. Here Gm denotes the split r-dimensional k-torus. These notions were introduced in 2006 by Lemire, Popov and Reichstein, who classified Cayley and stably Cayley simple groups over an algebraically closed field of characteristic zero. In this paper we study reductive Cayley groups over an arbitrary field k of characteristic zero. The condition of being Cayley is considerably more delicate in this setting. Our main results are a criterion for a reductive group G to be stably Cayley, formulated in terms of its character lattice, and a classification of stably Cayley simple (but not necessarily absolutely simple) groups.
منابع مشابه
On the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملOn the Characteristic Polynomial of n-Cayley Digraphs
A digraph Γ is called n-Cayley digraph over a group G, if there exists a semiregular subgroup RG of Aut(Γ) isomorphic to G with n orbits. In this paper, we represent the adjacency matrix of Γ as a diagonal block matrix in terms of irreducible representations of G and determine its characteristic polynomial. As corollaries of this result we find: the spectrum of semi-Cayley graphs over abelian g...
متن کاملMeasuring Closeness Between Cayley Automatic Groups and Automatic Groups
In this paper we introduce a way to estimate a level of closeness of Cayley automatic groups to the class of automatic groups using a certain numerical characteristic. We characterize Cayley automatic groups which are not automatic in terms of this numerical characteristic and then study it for the lamplighter group, the Baumslag–Solitar groups and the Heisenberg group.
متن کاملFinite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملOn the Cayley Degree of an Algebraic Group
A connected linear algebraic group G is called a Cayley group if the Lie algebra of G endowed with the adjoint G-action and the group variety of G endowed with the conjugation G-action are birationally G-isomorphic. In particular, the classical Cayley map X 7→ (In − X)(In + X) −1 between the special orthogonal group SOn and its Lie algebra son, shows that SOn is a Cayley group. In an earlier pa...
متن کامل