Academia.eduAcademia.edu

Finite Geometry

description102 papers
group181 followers
lightbulbAbout this topic
Finite geometry is a branch of mathematics that studies geometric structures with a finite number of points, lines, and planes. It explores the properties and relationships of these structures, often focusing on incidence relations and combinatorial aspects, distinct from classical Euclidean geometry.
lightbulbAbout this topic
Finite geometry is a branch of mathematics that studies geometric structures with a finite number of points, lines, and planes. It explores the properties and relationships of these structures, often focusing on incidence relations and combinatorial aspects, distinct from classical Euclidean geometry.

Key research themes

1. How can projective and affine constructions unify the understanding of Euclidean, hyperbolic, and spherical geometries within finite and universal frameworks?

This research area explores the embedding of classical constant curvature geometries (Euclidean, hyperbolic, spherical) into projective and affine geometries through algebraic and group-theoretic frameworks. It aims to provide a unified representation that not only recovers classical metric properties via projective invariants like cross ratios but also generalizes to arbitrary fields and quadratic forms. This unification facilitates the investigation of finite geometries and transitions among geometric structures while revealing algebraic underpinnings of metric spaces.

Key finding: Klein's seminal work constructs hyperbolic, Euclidean, and spherical geometries as specializations in projective geometry using cross ratios defined by conics (ellipses, degenerate conics, etc.). This yields a unified formula... Read more
Key finding: Extends Euclidean and non-Euclidean geometries algebraically over general fields and arbitrary symmetric bilinear forms, demonstrating that planar rational trigonometry laws have affine and projective analogues holding in... Read more
Key finding: Develops a fiber space framework parametrizing a continuous transition between hyperbolic, Euclidean, and spherical geometries as fibers over an interval [-1,1], with geometric entities (points, lines, distances, angles)... Read more

2. How can finite and combinatorial geometric structures underpin quantum contextuality and quantum computation models?

This theme investigates the interplay between finite geometries—especially polar spaces, projective geometries, and related configurations—and foundational quantum phenomena such as contextuality and universal quantum computation. Studies focus on how combinatorial and incidence geometries (e.g., generalized quadrangles, doilies, and coset geometries) model contextuality proofs (like Mermin squares and pentagrams) and how they structure spaces of quantum states and observables, thereby providing new frameworks for quantum computation and measurement.

Key finding: Using algorithms operating on binary symplectic polar spaces, the study quantitatively evaluates and refines the contextuality degree—a measure of contextuality—in multi-qubit systems. It identifies non-contextual... Read more
Key finding: Proposes a novel framework linking exotic 4-manifolds (specifically small exotic R4) to universal quantum computation via their fundamental groups and subgroup coset structures. This model interprets quantum magic states and... Read more
Key finding: Reveals that the vast space of Mermin pentagrams used in contextuality proofs is organized into families corresponding to Veldkamp lines in the three-qubit Veldkamp space—a finite geometric construction. The canonical... Read more

3. How can advanced combinatorial and set-theoretic techniques like transfinite induction be employed to address classical and infinite problems in finite geometry?

This research area focuses on methods from set theory and infinite combinatorics, notably transfinite induction, to solve or simplify constructions and extension problems in finite geometry that are otherwise complex or intractable in the finite setting. It includes constructions of extensions of finite geometric systems (e.g., Steiner systems) and partitions in infinite incidence structures, showing that many difficult finite problems become straightforward when generalized to infinite cardinals.

Key finding: Demonstrates how transfinite induction simplifies the construction of extensions of Steiner systems, projective planes, ovoids, and similar structures in infinite contexts. By harnessing well-ordering and limit ordinal... Read more

All papers in Finite Geometry

ABSTRACT: Finite geometry explains the surprising symmetry properties of some simple graphic designs--found, for instance, in quilts. Links are provided for applications to sporadic simple groups (via the" Miracle Octad... more
In this work, join and meet algebraic structure which exists in non-near-linear finite geometry are discussed. Lines in non-near-linear finite geometry 2  d were expressed as products of lines in near-linear finite geometry 2 p  (where... more
Failure of Euclid’s Proof of the infinity of primes numbers and its hypothetical consequences in General Mathematics are considered.
This short note highlights the most prominent mathematical problems and physical questions associated with the existence of the maximum sets of mutually unbiased bases (MUBs) in the Hilbert space of a given dimension.
The spectrum of possible sizes k of complete k-arcs in finite projective planes PG(2, q) is investigated by computer search. Backtracking algorithms that try to construct complete arcs joining the orbits of some subgroup of collineation... more
We present a deterministic polynomial time algorithm to sample a labeled planar graph uniformly at random. Our approach uses recursive formulae for the exact number of labeled planar graphs with n vertices and m edges, based on a... more
The aim of this paper is to make sense of Hamada's formula for the dimension of the code generated by the incidence matrix of points and subspaces of a given dimension in a finite projective space. The known results are surveyed and a... more
Quantum games embody non-intuitive consequences of quantum phenomena, such as entanglement and contextuality. The Mermin-Peres game is a simple example, demonstrating how two players can utilise shared quantum information to win a no... more
Split Cayley hexagons of order two are distinguished finite geometries living in the three-qubit symplectic polar space in two different forms, called classical and skew. Although neither of the two yields observable-based contextual... more
We present algorithms and a C code to reveal quantum contextuality and evaluate the contextuality degree (a way to quantify contextuality) for a variety of point-line geometries located in binary symplectic polar spaces of small rank.... more
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or... more
Quantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality proofs, aka. observable-based proofs of the Kochen-Specker... more
For N ≥ 2, an N -qubit doily is a doily living in the N -qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of Saniga et al. (Mathematics 9... more
Quantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality proofs, aka. observable-based proofs of the Kochen-Specker... more
We study certain physically-relevant subgeometries of binary symplectic polar spaces W(2N−1,2) of small rank N, when the points of these spaces canonically encode N-qubit observables. Key characteristics of a subspace of such a space... more
Given the fact that the three-qubit symplectic polar space features three different kinds of observables and each of its labeled Fano planes acquires a definite sign, we found that there are 45 distinct types of Mermin pentagrams in this... more
We investigate small geometric configurations that furnish observable-based proofs of the Kochen–Specker theorem. Assuming that each context consists of the same number of observables and each observable is shared by two contexts, it is... more
2) be a Segre variety that is N -fold direct product of projective lines of size three. Given two geometric hyperplanes H ′ and H ′′ of S (N ) , let us call the triple {H ′ , H ′′ , H ′ ∆H ′′ } the Veldkamp line of S (N ) . We shall... more
The purpose of this essay related to the string theory is to prove mathematically that we can bring this latter to a framework of space-time with 4 dimensions,and overcome the experimental issue regarding the extra dimensions(we know that... more
We prove a generalization of the Droz-Farny line theorem with or-thologic triangles. In 1899, Arnold Droz-Farny [3] discovered and published without proof the following beautiful result. Theorem 1 (Droz-Farny line theorem). Two... more
By Markowitz geometry we mean the intersection theory of ellipsoids and affine subspaces in a real finite-dimensional linear space. In the paper we give a meticulous and self-contained treatment of this arch-classical subject, which lays... more
We present numerical simulations of closed wavy Taylor vortices and of helicoidal wavy spirals in the Taylor-Couette system. These wavy structures appearing via a secondary bifurcation out of Taylor vortex flow and out of spiral vortex... more
In this study, the non-linear dynamics of Taylor-Couette flow in a very small-aspect-ratio wide-gap annulus in a counter-rotating regime under the influence of radial through-flow are investigated by solving its full three-dimensional... more
The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group G with relations. A valid subgroup H of index d in G leads to a ‘magic’ state ψ in d-dimensional... more
New types of upper bounds for the smallest size t2(2, q) of a complete arc in the projective plane P G(2, q) are proposed. The value t2(2, q) = d(q) √ q ln q, where d(q) < 1 is a decreasing function of q, is used. The case d(q) < α/ ln βq... more
In a user-private information retrieval (UPIR) scheme, a set of users collaborate to retrieve files from a database without revealing to observers which participant in the scheme requested the file. To achieve privacy, users retrieve... more
ABSTRACT: Finite geometry explains the surprising symmetry properties of some simple graphic designs--found, for instance, in quilts. Links are provided for applications to sporadic simple groups (via the&quot; Miracle Octad... more
The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group G with relations. A valid subgroup H of index d in G leads to a ‘magic’ state ψ in d-dimensional... more
We look at some techniques for constructing permutation arrays using projections in finite projective spaces and the geometry of arcs in the finite projective plane. We say a permutation array P A(n, d) has length n and minimum distance d... more
We present new constructions for (n, w,) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q − 1)-arcs contained in Baer subspaces (and, in general, kth-root subspaces)... more
We reveal an intriguing connection between the set of 27 (disregarding the identity) invertible symmetric 3 × 3 matrices over GF(2) and the points of the generalized quadrangle GQ(2, 4). The 15 matrices with eigenvalue one correspond to a... more
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY
It is demonstrated that the magic three-qubit Veldkamp line occurs naturally within the Veldkamp space of a combinatorial Grassmannian of type G 2 (7), V (G 2 (7)). The lines of the ambient symplectic polar space are those lines of V (G 2... more
This study investigated by an analytical method the flow that develops in the gap between concentric rotating cylinders when the Taylor number Ta exceeds the first critical value. Concentric cylinders rotating at the speed ratio µ = 0 are... more
We present algorithms and a C code to reveal quantum contextuality and evaluate the contextuality degree (a way to quantify contextuality) for a variety of point-line geometries located in binary symplectic polar spaces of small rank.... more
Quantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality proofs, aka. observable-based proofs of the Kochen-Specker... more
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or... more
For N ≥ 2, an N-qubit doily is a doily living in the N-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of Saniga et al. (Mathematics 9 (2021)... more
We give an explicit weak solution to the Schottky problem, in the spirit of Riemann and Schottky. For any genus g, we write down a collection of polynomials in genus g theta constants, such that their common zero locus contains the locus... more
In this paper we give a new, simple and explicit proof of a theorem of Baker. This states that every odd diml'nsional projective space over the field of two elements admits a I-packing of I-spreads, i.e. a partition of its lines into... more
In this paper we give a new, simple and explicit proof of a theorem of Baker. This states that every odd diml'nsional projective space over the field of two elements admits a I-packing of I-spreads, i.e. a partition of its lines into... more
The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group G with relations. A valid subgroup H of index d in G leads to a ‘magic’ state ψ in d-dimensional... more
Flow characterization in a Taylor Couette system was made by investigating the radial velocity component with Ultrasonic Doppler Velocimetry based flow mapping. With the technique presented in this work, it is possible to measure the... more
This purpose is about a computational fluid dynamics investigation of a step varying in annular space effect on Taylor vortices flow and velocity in cylindrical Taylor-Couette system. Three cases are considered, the first geometric... more
Subspace codes are codes in which the codewords consist of subspaces of a vector space V (n, q) of dimension n over the finite field of order q. These codes now receive a lot of attention because of their relevance for transmission of... more
Abstract. A main issue in superstring theory are the superstring measures. D’Hoker and Phong showed that for genus two these reduce to measures on the moduli space of curves which are determined by modular forms of weight eight and the... more
In the simplest and original case of study of the Taylor-Couette TC problems, the fluid is contained between a fixed outer cylinder and a concentric inner cylinder which rotates at constant angular velocity. Much of the works done has... more
In the simplest and original case of study of the Taylor-Couette TC problems, the fluid is contained between a fixed outer cylinder and a concentric inner cylinder which rotates at constant angular velocity. Much of the works done has... more
Download research papers for free!