scholarly journals The Frucht property in the quantum group setting

2021 ◽  
pp. 1-31
Author(s):  
T. Banica ◽  
J.P. McCarthy
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Quantum Groups ◽  
Automorphism Groups ◽  
Finite Graph ◽  
Classical Theorem ◽  
Group Setting ◽  
Finite Graphs ◽  
Negative Results ◽  
Compact Quantum Groups

Abstract A classical theorem of Frucht states that any finite group appears as the automorphism group of a finite graph. In the quantum setting, the problem is to understand the structure of the compact quantum groups which can appear as quantum automorphism groups of finite graphs. We discuss here this question, notably with a number of negative results.

scholarly journals On automorphism groups of low complexity subshifts

2015 ◽  
Vol 36 (1) ◽  
pp. 64-95 ◽  
Author(s):  
SEBASTIÁN DONOSO ◽  
FABIEN DURAND ◽  
ALEJANDRO MAASS ◽  
SAMUEL PETITE
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Polynomial Complexity ◽  
Automorphism Groups ◽  
Low Complexity ◽  
Topological Dynamics ◽  
Main Technique ◽  
Shift Map ◽  
The One ◽  
A Finite Group

In this article, we study the automorphism group$\text{Aut}(X,{\it\sigma})$of subshifts$(X,{\it\sigma})$of low word complexity. In particular, we prove that$\text{Aut}(X,{\it\sigma})$is virtually$\mathbb{Z}$for aperiodic minimal subshifts and certain transitive subshifts with non-superlinear complexity. More precisely, the quotient of this group relative to the one generated by the shift map is a finite group. In addition, we show that any finite group can be obtained in this way. The class considered includes minimal subshifts induced by substitutions, linearly recurrent subshifts and even some subshifts which simultaneously exhibit non-superlinear and superpolynomial complexity along different subsequences. The main technique in this article relies on the study of classical relations among points used in topological dynamics, in particular, asymptotic pairs. Various examples that illustrate the technique developed in this article are provided. In particular, we prove that the group of automorphisms of a$d$-step nilsystem is nilpotent of order$d$and from there we produce minimal subshifts of arbitrarily large polynomial complexity whose automorphism groups are also virtually$\mathbb{Z}$.

Diameters and automorphism groups of inclusion graphs over nilpotent groups

2019 ◽  
Vol 19 (05) ◽  
pp. 2050097
Author(s):  
Shikun Ou ◽  
Dein Wong ◽  
Zhijun Wang
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Automorphism Groups ◽  
Undirected Graph ◽  
Nilpotent Groups ◽  
Dominating Sets ◽  
A Finite Group

The inclusion graph of a finite group [Formula: see text], written as [Formula: see text], is defined to be an undirected graph that its vertices are all nontrivial subgroups of [Formula: see text], and in which two distinct subgroups [Formula: see text], [Formula: see text] are adjacent if and only if either [Formula: see text] or [Formula: see text]. In this paper, we determine the diameter of [Formula: see text] when [Formula: see text] is nilpotent, and characterize the independent dominating sets as well as the automorphism group of [Formula: see text].

Finite Groups Which are Automorphism Groups of Infinite Groups Only

1985 ◽  
Vol 28 (1) ◽  
pp. 84-90
Author(s):  
Jay Zimmerman
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Finite Field ◽  
Finite Groups ◽  
Finite Simple Group ◽  
Automorphism Groups ◽  
Outer Automorphism ◽  
Schur Multiplier ◽  
Infinite Groups ◽  
Infinite Set

AbstractThe object of this paper is to exhibit an infinite set of finite semisimple groups H, each of which is the automorphism group of some infinite group, but of no finite group. We begin the construction by choosing a finite simple group S whose outer automorphism group and Schur multiplier possess certain specified properties. The group H is a certain subgroup of Aut S which contains S. For example, most of the PSL's over a non-prime finite field are candidates for S, and in this case, H is generated by all of the inner, diagonal and graph automorphisms of S.

Random Colourings and Automorphism Breaking in Locally Finite Graphs

2013 ◽  
Vol 22 (6) ◽  
pp. 885-909 ◽  
Author(s):  
FLORIAN LEHNER
Keyword(s):  
Automorphism Group ◽  
Haar Measure ◽  
Finite Graph ◽  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graph ◽  
Locally Finite Graphs ◽  
Null Set

A colouring of a graphGis called distinguishing if its stabilizer in AutGis trivial. It has been conjectured that, if every automorphism of a locally finite graph moves infinitely many vertices, then there is a distinguishing 2-colouring. We study properties of random 2-colourings of locally finite graphs and show that the stabilizer of such a colouring is almost surely nowhere dense in AutGand a null set with respect to the Haar measure on the automorphism group. We also investigate random 2-colourings in several classes of locally finite graphs where the existence of a distinguishing 2-colouring has already been established. It turns out that in all of these cases a random 2-colouring is almost surely distinguishing.

scholarly journals Bounds on the Distinguishing Chromatic Number

10.37236/177 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Karen L. Collins ◽  
Mark Hovey ◽  
Ann N. Trenk
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Automorphism Group ◽  
Chromatic Number ◽  
Automorphism Groups ◽  
Upper Bounds ◽  
Underlying Graph ◽  
Minimum Number

Collins and Trenk define the distinguishing chromatic number $\chi_D(G)$ of a graph $G$ to be the minimum number of colors needed to properly color the vertices of $G$ so that the only automorphism of $G$ that preserves colors is the identity. They prove results about $\chi_D(G)$ based on the underlying graph $G$. In this paper we prove results that relate $\chi_D(G)$ to the automorphism group of $G$. We prove two upper bounds for $\chi_D(G)$ in terms of the chromatic number $\chi(G)$ and show that each result is tight: (1) if Aut$(G)$ is any finite group of order $p_1^{i_1} p_2^{i_2} \cdots p_k^{i_k}$ then $\chi_D(G) \le \chi(G) + i_1 + i_2 \cdots + i_k$, and (2) if Aut$(G)$ is a finite and abelian group written Aut$(G) = {\Bbb Z}_{p_{1}^{i_{1}}}\times \cdots \times {\Bbb Z}_{p_{k}^{i_{k}}}$ then we get the improved bound $\chi_D(G) \le \chi(G) + k$. In addition, we characterize automorphism groups of graphs with $\chi_D(G) = 2$ and discuss similar results for graphs with $\chi_D(G)=3$.

scholarly journals Regular dessins uniquely determined by a nilpotent automorphism group

2018 ◽  
Vol 21 (3) ◽  
pp. 397-415 ◽  
Author(s):  
Na-Er Wang ◽  
Roman Nedela ◽  
Kan Hu
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Upper Bound ◽  
Automorphism Groups ◽  
Nilpotency Class ◽  
Isomorphism Classes ◽  
One To One

Abstract It is well known that the automorphism group of a regular dessin is a two-generator finite group, and the isomorphism classes of regular dessins with automorphism groups isomorphic to a given finite group G are in one-to-one correspondence with the orbits of the action of {{\mathrm{Aut}}(G)} on the ordered generating pairs of G. If there is only one orbit, then up to isomorphism the regular dessin is uniquely determined by the group G and it is called uniquely regular. In this paper we investigate the classification of uniquely regular dessins with a nilpotent automorphism group. The problem is reduced to the classification of finite maximally automorphic p-groups G, i.e., the order of the automorphism group of G attains Hall’s upper bound. Maximally automorphic p-groups of nilpotency class three are classified.

scholarly journals Algebraic K3 surfaces with finite automorphism groups

1989 ◽  
Vol 116 ◽  
pp. 1-15 ◽  
Author(s):  
Shigeyuki Kondō
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Line Bundle ◽  
Algebraic Surface ◽  
Automorphism Groups ◽  
Factor Group ◽  
K3 Surface ◽  
Intersection Form ◽  
Canonical Line Bundle ◽  
A Finite Group

The purpose of this paper is to give a proof to the result announced in [3]. Let X be an algebraic surface defined over C. X is called a K3 surface if its canonical line bundle Kx is trivial and dim H1(X, ϕX) = 0. It is known that the automorphism group Aut (X) of X is isomorphic, up to a finite group, to the factor group O(Sx)/Wx, where O(Sx) is the automorphism group of the Picard lattice of X (i.e. Sx is the Picard group of X together with the intersection form) and Wx is its subgroup generated by all reflections associated with elements with square (–2) of Sx ([11]). Recently Nikulin [8], [10] has completely classified the Picard lattices of algebraic K3 surfaces with finite automorphism groups.

scholarly journals RIESZ TRANSFORMS ON COMPACT QUANTUM GROUPS AND STRONG SOLIDITY

2021 ◽  
pp. 1-37
Author(s):  
Martijn Caspers
Keyword(s):  
Quantum Group ◽  
Quantum Groups ◽  
Riesz Transform ◽  
Wreath Products ◽  
Compact Quantum Group ◽  
Riesz Transforms ◽  
Markov Semigroup ◽  
Markov Semigroups ◽  
Free Products ◽  
Compact Quantum Groups

Abstract One of the main aims of this paper is to give a large class of strongly solid compact quantum groups. We do this by using quantum Markov semigroups and noncommutative Riesz transforms. We introduce a property for quantum Markov semigroups of central multipliers on a compact quantum group which we shall call ‘approximate linearity with almost commuting intertwiners’. We show that this property is stable under free products, monoidal equivalence, free wreath products and dual quantum subgroups. Examples include in particular all the (higher-dimensional) free orthogonal easy quantum groups. We then show that a compact quantum group with a quantum Markov semigroup that is approximately linear with almost commuting intertwiners satisfies the immediately gradient- ${\mathcal {S}}_2$ condition from [10] and derive strong solidity results (following [10]). Using the noncommutative Riesz transform we also show that these quantum groups have the Akemann–Ostrand property; in particular, the same strong solidity results follow again (now following [27]).

Sign in / Sign up

Export Citation Format

Share Document