Related papers: There are 2834 spreads of lines in PG(3,8)

We consider the orbits of the group $G=PGL_2(q)$ on the points, lines and planes of the projective space $PG(3,q)$ over a finite field $\mathbb F_q$ of characteristic different from $2$ and $3$. The points of $PG(3,q)$ can be identified…

We consider the structure of the plane-line incidence matrix of the projective space $\mathrm{PG}(3,q)$ with respect to the orbits of planes and lines under the stabilizer group of the twisted cubic. Structures of submatrices with…

We show a one-to-one correspondence between arrangements of d lines in the projective plane, and lines in P^{d-2}. We apply this correspondence to classify (3,q)-nets over the complex numbers for all q<=6. When q=6, we have twelve possible…

We investigate the consistency of visual morphological classifications of galaxies by comparing classifications for 831 galaxies from six independent observers. The galaxies were classified on laser print copy images or on computer screen…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

We provide classification results for translation generalized quadrangles of order less or equal to $64$, and hence, for all incidence geometries related to them. The results consist of the classification of all pseudo-ovals in…

We give an explicit list of all p-groups G of order at most p^4 or 2^5 such that the group algebra KG over the field K of characteristic p has a filtered multiplicative K-basis.

Lunardon and Polverino construct a translation plane starting from a scattered linear set of pseudoregulus type in $\mathrm{PG}(1,q^t)$. In this paper a similar construction of a translation plane $\mathcal A_f$ obtained from any scattered…

We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Gr\"unbaums catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines,…

In this article we consider a set C of points in PG(4,q), q even, satisfying certain combinatorial properties with respect to the planes of PG(4,q). We show that there is a regular spread in the hyperplane at infinity, such that in the…

We investigate $k$-nets with $k\geq 4$ embedded in the projective plane $PG(2,\mathbb{K})$ defined over a field $\mathbb{K}$; they are line configurations in $PG(2,\mathbb{K})$ consisting of $k$ pairwise disjoint line-sets, called…

Our starting point is a very simple one, namely that of a set L_4 of four mutually skew lines in PG(7,2): Under the natural action of the stabilizer group G(L_4) < GL(8,2) the 255 points of PG(7,2) fall into four orbits omega_1, omega_2,…

We show a kernel of at most $13k$ vertices for the Planar Feedback Vertex Set problem restricted to planar graphs, i.e., a polynomial-time algorithm that transforms an input instance $(G,k)$ to an equivalent instance with at most $13k$…

Models like support vector machines or Gaussian process regression often require positive semi-definite kernels. These kernels may be based on distance functions. While definiteness is proven for common distances and kernels, a proof for a…

Let $G$ be a subgroup of the three dimensional projective group $\mathrm{PGL}(3,q)$ defined over a finite field $\mathbb{F}_q$ of order $q$, viewed as a subgroup of $\mathrm{PGL}(3,K)$ where $K$ is an algebraic closure of $\mathbb{F}_q$.…

We improve on the lower bound of the maximum number of planes in $\operatorname{PG}(8,q)\cong\F_q^{9}$ pairwise intersecting in at most a point. In terms of constant dimension codes this leads to $A_q(9,4;3)\ge q^{12}+…

We give a survey of work on the number of vertices of the convex hull of integer points defined by the system of linear inequalities. Also, we present our improvement of some of these.

The $P_2$-packing problem asks for whether a graph contains $k$ vertex-disjoint paths each of length two. We continue the study of its kernelization algorithms, and develop a $5k$-vertex kernel.

We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three classes of the 3-net comprises concurrent lines, and irregular…

In 2018 the first, Rukavina and the third author constructed with the aid of a computer the first example of a strongly regular graph $\Gamma$ with parameters (216, 40, 4, 8) and proved that it is the unique PSU(4,2)-invariant…