Search arXivSearch

arXiv · 2504.06025

Geometries with trialities arising from linear spaces

Abstract

A triality is a sort of super-symmetry that exchanges the types of the elements of an incidence geometry in cycles of length three. Although geometries with trialities exhibit fascinating behaviors, their construction is challenging, making them rare in the literature. To understand trialities more deeply, it is crucial to have a wide variety of examples at hand. In this article, we introduce a general method for constructing various rank-three incidence systems with trialities. Specifically, for any rank two incidence system $Γ$, we define its triangle complex $Δ(Γ)$, a rank three incidence system whose elements consist of three copies of the flags (pairs of incident elements) of $Γ$. This triangle complex always admits a triality that cyclically permutes the three copies. We then explore in detail the properties of the triangle complex when $Γ$ is a linear space, including flag-transitivity, the existence of dualities, and connectivity properties. As a consequence of our work, this construction yields the first infinite family of thick, flag-transitive and residually connected geometries with trialities but no dualities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rémi Delaby, Dimitri Leemans, Philippe Tranchida. 2025-04-08. Geometries with trialities arising from linear spaces. https://arxiv.org/abs/2504.06025

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO