Search arXivSearch

arXiv · 1806.08965

Veldkamp Spaces of Low-Dimensional Ternary Segre Varieties

Abstract

Making use of the `Veldkamp blow-up' recipe, introduced by Saniga and others (Ann. Inst. H. Poincar\' e D2 (2015) 309) for binary Segre varieties, we study geometric hyperplanes and Veldkamp lines of Segre varieties $S_k(3)$, where $S_k(3)$ stands for the $k$-fold direct product of projective lines of size four and $k$ runs from 2 to 4. Unlike the binary case, the Veldkamp spaces here feature also non-projective elements. Although for $k=2$ such elements are found only among Veldkamp lines, for $k \geq 3$ they are also present among Veldkamp points of the associated Segre variety. Even if we consider only projective geometric hyperplanes, we find four different types of non-projective Veldkamp lines of $S_3(3)$, having 2268 members in total, and five more types if non-projective ovoids are also taken into account. Sole geometric and combinatorial arguments lead to as many as 62 types of projective Veldkamp lines of $S_3(3)$, whose blowing-ups yield 43 distinct types of projective geometric hyperplanes of $S_4(3)$. As the latter number falls short of 48, the number of different large orbits of $2 \times 2 \times 2 \times 2$ arrays over the three-element field found by Bremner and Stavrou (Lin. Multilin. Algebra 61 (2013) 986), there are five (explicitly indicated) hyperplane types such that each is the merger of two different large orbits. Furthermore, we single out those 22 types of geometric hyperplanes of $S_4(3)$, featuring 7 176 640 members in total, that are in a one-to-one correspondence with the points lying on the unique hyperbolic quadric $\mathcal{Q}_0^{+}(15,3) \subset {\rm PG}(15,3) \subset \mathcal{V}(S_4(3))$; and, out of them, seven ones that correspond bijectively to the set of 91 840 generators of the symplectic polar space $\mathcal{W}(7,3) \subset \mathcal{V}(S_3(3))$. For $k=3$ we also discuss embedding of the binary Veldkamp space into the ternary one.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Metod Saniga, Jérôme Boulmier, Maxime Pinard, Frédéric Holweck. 2018-06-23. Veldkamp Spaces of Low-Dimensional Ternary Segre Varieties. https://doi.org/10.1007/s00025-019-0974-2

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