Search arXivSearch

arXiv · math/0604532

Searching for line transitive, point imprimitive, linear spaces

Abstract

A finite linear space is a finite set of points and lines, where any two points lie on a unique line. Well known examples include projective planes. This project focuses on linear spaces which admit certain types of symmetries. Symmetries of the space which preserve the line structure are called automorphisms. A group of these is called an automorphism group of the linear space. Two interesting properties of linear spaces are point imprimitivity and line transitivity. Point imprimitive spaces admit a second structure on the points aside from the lines, which is also preserved by an automorphism group. In line transitive spaces, given any two lines, an automorphism can be found that maps one line to the other. Very few point imprimitive, line transitive linear spaces, apart from projective planes, are known. Such spaces that have been found have been surprising. One point of interest is whether such spaces are rare and the known ones are in some sense exceptional, or if there are many such spaces, but mathematicians have been looking in the wrong places. Here we investigate methods to construct a line transitive, point imprimitive linear space over a given point set and automorphism group. We employ these methods on two given automorphism groups, both on a set of 451 points. This was an exceptional situation identified in theoretical work of Praeger and Tuan. Included in this is the development of an algorithm, written in GAP, an algebraic programming system, and C, to perform these constructions. This algorithm is extendible to a wider class of groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gregory Cresp. 2006-04-25. Searching for line transitive, point imprimitive, linear spaces. https://arxiv.org/abs/math/0604532

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