Search arXivSearch

arXiv · 1208.6336

Isomorphisms, automorphisms, and generalized involution models

Abstract

We investigate the generalized involution models of the projective reflection groups $G(r,p,q,n)$. This family of groups parametrizes all quotients of the complex reflection groups $G(r,p,n)$ by scalar subgroups. Our classification is ultimately incomplete, but we provide several necessary and sufficient conditions for generalized involution models to exist in various cases. In the process we solve several intermediate problems concerning the structure of projective reflection groups. We derive a simple criterion for determining whether two groups $G(r,p,q,n)$ and $G(r,p',q',n)$ are isomorphic. We also describe explicitly the form of all automorphisms of $G(r,p,q,n)$, outside a finite list of exceptional cases. Building on prior work, this allows us to prove that $G(r,p,1,n)$ has a generalized involution model if and only if $G(r,p,1,n) \cong G(r,1,p,n)$. We also classify which groups $G(r,p,q,n)$ have generalized involution models when $n=2$, or $q$ is odd, or $n$ is odd.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fabrizio Caselli, Eric Marberg. 2012-08-31. Isomorphisms, automorphisms, and generalized involution models. https://doi.org/10.1007/s11856-013-0044-5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO