ON GEOMETRIC CONSTRUCTIONS OF (k, g)-GRAPHS 1. introduction Noting that the smallest
regular graph of valency 3 and girth 5 is t Page 1 Volume 3, Number 1, Pages 63–80 ISSN …

We prove three theorems giving extremal bounds on the incidence structures determined by
subsets of the points and blocks of a balanced incomplete block design (BIBD). These …

Polarity graphs, also known as Brown graphs, and their minor modifications are the largest
currently known graphs of diameter 2 and a given maximum degree d such that d− 1 is a …

We construct a discrete quantum mechanics (QM) using a vector space over the Galois field
GF (q). We find that the correlations in our model do not violate the Clauser–Horne–Shimony …

We argue that the q= 1 limit of Galois Field Quantum Mechanics, which was constructed on a
vector space over the Galois Field F_q= GF (q), corresponds to itsclassical limit,'where …

This one is not intended to be an introductory textbook about finite geometries, finite fields
nor polynomials. There are very good books of these kinds available, eg Ball-Weiner [23] for …

In the present paper we give a complete description for the proposed new variant of AES
cipher with high level of security and coherent algebraic aspects that is called the …

We discuss the properties of Galois field quantum mechanics constructed on a vector space
over the finite Galois field GF (q). In particular, we look at two-level systems analogous to …

Ce travail de thèse s' inscrit dans le domaine de la preuve assistée par ordinateur et se
place d'un point de vue méthodologique. L'objectif premier des assistants de preuves est de …

For an irreducible conic C in a Desarguesian plane of odd square order, estimating the
number of points, from a Baer subplane, which are external to C is a natural problem. In this …