On the group of projectivities on a line in a finite projective plane

1968 ◽  
Vol 104 (3) ◽  
pp. 247-248 ◽  
Author(s):  
Jill C. D. S. Yaqub
Keyword(s):  
Projective Plane ◽  
Finite Projective Plane ◽  
Group Of Projectivities

On a conjecture of Hughes

1967 ◽  
Vol 63 (3) ◽  
pp. 647-652 ◽  
Author(s):  
Judita Cofman
Keyword(s):  
Projective Plane ◽  
Permutation Group ◽  
Translation Plane ◽  
Collineation Group ◽  
Affine Plane ◽  
Finite Projective Plane ◽  
Transitive Permutation Group ◽  
Condition C

D. R. Hughes stated the following conjecture: If π is a finite projective plane satisfying the condition: (C)π contains a collineation group δ inducing a doubly transitive permutation group δ* on the points of a line g, fixed under δ, then the corresponding affine plane πg is a translation plane.

scholarly journals Resolving Sets and Semi-Resolving Sets in Finite Projective Planes

10.37236/2582 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Tamás Héger ◽  
Marcella Takáts
Keyword(s):  
Projective Plane ◽  
Finite Projective Plane ◽  
Projective Planes ◽  
The Other ◽  
Blocking Set ◽  
Metric Dimension ◽  
Desarguesian Projective Plane ◽  
Resolving Set ◽  
Incidence Graph ◽  
Vertex Set

In a graph $\Gamma=(V,E)$ a vertex $v$ is resolved by a vertex-set $S=\{v_1,\ldots,v_n\}$ if its (ordered) distance list with respect to $S$, $(d(v,v_1),\ldots,d(v,v_n))$, is unique. A set $A\subset V$ is resolved by $S$ if all its elements are resolved by $S$. $S$ is a resolving set in $\Gamma$ if it resolves $V$. The metric dimension of $\Gamma$ is the size of the smallest resolving set in it. In a bipartite graph a semi-resolving set is a set of vertices in one of the vertex classes that resolves the other class.We show that the metric dimension of the incidence graph of a finite projective plane of order $q\geq 23$ is $4q-4$, and describe all resolving sets of that size. Let $\tau_2$ denote the size of the smallest double blocking set in PG$(2,q)$, the Desarguesian projective plane of order $q$. We prove that for a semi-resolving set $S$ in the incidence graph of PG$(2,q)$, $|S|\geq \min \{2q+q/4-3, \tau_2-2\}$ holds. In particular, if $q\geq9$ is a square, then the smallest semi-resolving set in PG$(2,q)$ has size $2q+2\sqrt{q}$. As a corollary, we get that a blocking semioval in PG$(2, q)$, $q\geq 4$, has at least $9q/4-3$ points. A corrigendum was added to this paper on March 3, 2017.

scholarly journals Analysis of Some Properties from Construction of Finite Projective Planes of Order 2 and 3

CAUCHY ◽  
2016 ◽  
Vol 4 (3) ◽  
pp. 131
Author(s):  
Vira Hari Krisnawati ◽  
Corina Karim
Keyword(s):  
Automorphism Group ◽  
Projective Plane ◽  
Symmetric Group ◽  
Block Design ◽  
Finite Projective Plane ◽  
Projective Planes ◽  
Steiner System ◽  
Incidence Relation ◽  
Finite Projective Planes ◽  
Set Of Points

<p class="abstract"><span lang="IN">In combinatorial mathematics, a Steiner system is a type of block design. Specifically, a Steiner system <em>S</em>(<em>t</em>, <em>k</em>, <em>v</em>) is a set of <em>v</em> points and <em>k</em> blocks which satisfy that every <em>t</em>-subset of <em>v</em>-set of points appear in the unique block. It is well-known that a finite projective plane is one examples of Steiner system with <em>t</em> = 2, which consists of a set of points and lines together with an incidence relation between them and order 2 is the smallest order.</span></p><p class="abstract"><span lang="IN">In this paper, we observe some properties from construction of finite projective planes of order 2 and 3. Also, we analyse the intersection between two projective planes by using some characteristics of the construction and orbit of projective planes over some representative cosets from automorphism group in the appropriate symmetric group.</span></p>

scholarly journals Cubic Arcs in the Projective Plane Over a Finite Field of Order Twenty Three

2019 ◽  
Vol 54 (6) ◽  
Author(s):  
Najm A.M. Al-Seraji ◽  
Asraa A. Monshed
Keyword(s):  
Finite Field ◽  
Projective Plane ◽  
Coding Theory ◽  
Finite Projective Plane ◽  
Cubic Curves ◽  
The Subject

In this research we are interested in finding all the different cubic curves over a finite projective plane of order twenty-three, learning which of them is complete or not, constructing the stabilizer groups of the cubics in, studying the properties of these groups, and, finally, introducing the relation between the subject of coding theory and the projective plane of order twenty three.

Projective planes of infinite but isolic order

1976 ◽  
Vol 41 (2) ◽  
pp. 391-404 ◽  
Author(s):  
J. C. E. Dekker
Keyword(s):  
Projective Plane ◽  
Finite Projective Plane ◽  
Projective Planes ◽  
Latin Squares ◽  
Combinatorial Theory ◽  
Ternary Ring ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Planar Ternary Ring ◽  
Partial Recursive Functions

The main purpose of this paper is to show how partial recursive functions and isols can be used to generalize the following three well-known theorems of combinatorial theory.(I) For every finite projective plane Π there is a unique number n such that Π has exactly n2 + n + 1 points and exactly n2 + n + 1 lines.(II) Every finite projective plane of order n can be coordinatized by a finite planar ternary ring of order n. Conversely, every finite planar ternary ring of order n coordinatizes a finite projective plane of order n.(III) There exists a finite projective plane of order n if and only if there exist n − 1 mutually orthogonal Latin squares of order n.

Study of orbits on the finite projective plane

2020 ◽  
Vol 23 (6) ◽  
pp. 1187-1195
Author(s):  
Najm Abdulzahra Makhrib Al-Seraji ◽  
Ahmed Bakheet ◽  
Zainab Sadiq Jafar
Keyword(s):  
Projective Plane ◽  
Finite Projective Plane

scholarly journals Collineation groups preserving an oval in a projective place of odd order

1990 ◽  
Vol 48 (1) ◽  
pp. 156-170 ◽  
Author(s):  
Mauro Biliotti ◽  
Gabor Korchmaros
Keyword(s):  
Projective Plane ◽  
Collineation Group ◽  
Finite Projective Plane ◽  
Odd Order ◽  
Collineation Groups

AbstractIn this paper we investigate the structure of a collineation group G of a finite projective plane Π of odd order, assuming that G leaves invariant an oval Ω of Π. We show that if G is nonabelian simple, then G ≅ PSL(2, q) for q odd. Several results about the structre and the action of G are also obtained under the assumptions that n ≡ 1 (4) and G is transitive on the points of Ω.

scholarly journals AUTOMORPHISMS AND OPPOSITION IN TWIN BUILDINGS

2013 ◽  
Vol 94 (2) ◽  
pp. 189-201 ◽  
Author(s):  
ALICE DEVILLERS ◽  
JAMES PARKINSON ◽  
HENDRIK VAN MALDEGHEM
Keyword(s):  
Projective Plane ◽  
Finite Projective Plane ◽  
Spherical Building ◽  
Absolute Point ◽  
Locally Finite ◽  
Fixed Type ◽  
Twin Buildings

AbstractWe show that every automorphism of a thick twin building interchanging the halves of the building maps some residue to an opposite one. Furthermore, we show that no automorphism of a locally finite 2-spherical twin building of rank at least 3 maps every residue of one fixed type to an opposite (a key step in the proof is showing that every duality of a thick finite projective plane admits an absolute point). Our results also hold for all finite irreducible spherical buildings of rank at least 3, and imply that every involution of a thick irreducible finite spherical building of rank at least 3 has a fixed residue.

Sign in / Sign up

Export Citation Format

Share Document