Search arXivSearch

arXiv · 2305.13809

Towards the horizons of Tits's vision -- on band schemes, crowds and F1-structures

Abstract

This text is dedicated to Jacques Tits's ideas on geometry over F1, the field with one element. In a first part, we explain how thin Tits geometries surface as rational point sets over the Krasner hyperfield, which links these ideas to combinatorial flag varieties in the sense of Borovik, Gelfand and White and F1-geometry in the sense of Connes and Consani. A completely novel feature is our approach to algebraic groups over F1 in terms of an alteration of the very concept of a group. In the second part, we study an incidence-geometrical counterpart of (epimorphisms to) thin Tits geometries; we introduce and classify all F1-structures on 3-dimensional projective spaces over finite fields. This extends recent work of Thas and Thas on epimorphisms of projective planes (and other rank 2 buildings) to thin planes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oliver Lorscheid, Koen Thas. 2023-05-23. Towards the horizons of Tits's vision -- on band schemes, crowds and F1-structures. https://doi.org/10.2140/iig.2023.20.353

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