Search arXivSearch

arXiv · 1510.07919

Characterizations of the Suzuki tower near polygons

Abstract

In recent work, we constructed a new near octagon $\mathcal{G}$ from certain involutions of the finite simple group $G_2(4)$ and showed a correspondence between the Suzuki tower of finite simple groups, $L_3(2) < U_3(3) < J_2 < G_2(4) < Suz$, and the tower of near polygons, $\mathrm{H}(2,1) \subset \mathrm{H}(2)^D \subset \mathsf{HJ} \subset \mathcal{G}$. Here we characterize each of these near polygons (except for the first one) as the unique near polygon of the given order and diameter containing an isometrically embedded copy of the previous near polygon of the tower. In particular, our characterization of the Hall-Janko near octagon $\mathsf{HJ}$ is similar to an earlier characterization due to Cohen and Tits who proved that it is the unique regular near octagon with parameters $(2, 4; 0, 3)$, but instead of regularity we assume existence of an isometrically embedded dual split Cayley hexagon, $\mathrm{H}(2)^D$. We also give a complete classification of near hexagons of order $(2, 2)$ and use it to prove the uniqueness result for $\mathrm{H}(2)^D$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anurag Bishnoi, Bart De Bruyn. 2016-05-13. Characterizations of the Suzuki tower near polygons. https://arxiv.org/abs/1510.07919

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