Search arXivSearch

arXiv · 2207.13946

Commutation relations of $\mathfrak g\_2$ and the incidence geometry of the Fano plane

Abstract

We continue our study and classification of structures on the Fano plane ${\cal F}$ and its dual ${\cal F}^\ast$ involved in the construction of octonions and the Lie algebra $\mathfrak g_2 (\mathbb F)$ over a field $\mathbb F$. These are a "composition factor": ${\cal F}\times {\cal F} \to\{-1, 1\}$, inducing an octonion multiplication, and a function $δ^\ast : Aut({\cal F}) \times {\cal F}^\ast \to \{-1, 1\}$ such that $g \in Aut({\cal F})$ can be lifted to an automorphism of the octonions iff $δ^\ast(g, \cdot)$ is the Radon transform of a function on ${\cal F}$. We lift the action of $Aut({\cal F})$ on ${\cal F}$ to the action of a non-trivial eight-fold covering $Aut({\cal F})$ on a twofold covering $\hat {\cal F}$ of ${\cal F}$ contained in the octonions. This extends tautologically to an action on the octonions by automorphism. Finally, we associate to incident point-line pairs a generating set of $\mathfrak g_2 (\mathbb F)$ and express brackets in terms of the incidence geometry of ${\cal F}$ and $ε$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michel Rausch de Traubenberg, M J Slupinski. 2022-07-28. Commutation relations of $\mathfrak g\_2$ and the incidence geometry of the Fano plane. https://arxiv.org/abs/2207.13946

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