相关论文: On Mathon's construction of maximal arcs in Desarg…
In 1969 Denniston gave a construction of maximal arcs of degree d in Desarguesian projective planes of even order q, for all d dividing q. In 2002 Mathon gave a construction method generalizing the one of Denniston. We will give a new…
It is proved that for every $d\ge 2$ such that $d-1$ divides $q-1$, where $q$ is a power of 2, there exists a Denniston maximal arc $A$ of degree $d$ in $\PG(2,q)$, being invariant under a cyclic linear group that fixes one point of $A$ and…
The subject of this paper are partial geometries $pg(s,t,\alpha)$ with parameters $s=d(d'-1), \ t=d'(d-1), \ \alpha=(d-1)(d'-1)$, $d, d' \ge 2$. In all known examples, $q=dd'$ is a power of 2 and the partial geometry arises from a maximal…
Denniston constructed partial difference sets (PDSs) with the parameters $(2^{3m}, (2^{m+r} - 2^m + 2^r)(2^m-1), 2^m-2^r+(2^{m+r}-2^m+2^r)(2^r-2), (2^{m+r}-2^m+2^r)(2^r-1))$ in elementary abelian groups of order $2^{3m}$ for all $m \geq 2,…
N. Hamilton and J. A. Thas describe a link between maximal arcs of Mathon type and partial flocks of the quadratic cone. This link is of a rather algebraic nature. In this paper we establish a geometric connection between these two…
We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges with endpoints on the vertices of P such that these new…
We construct two-weight sets in PG$(3n-1,q)$, $n\geq2$ with the same weights as those that would arise from the blow-up of a maximal $q$-arc in PG$(2,q^n)$. The construction is of particular interest when $q$ is odd, as it is well known…
In 1974, J. Thas constructed a new class of maximal arcs for the Desarguesian plane of order $q^2$. The construction relied upon the existence of a regular spread of tangent lines to an ovoid in $\PG(3,q)$ and, in particular, it does apply…
In a former paper the authors counted the number of non-isomorphic Mathon maximal arcs of degree 8 in PG(2,2^h), h not 7 and prime. In this paper we will show that in PG(2,2^7) a special class of Mathon maximal arcs of degree 8 arises which…
Denniston \cite{D1969} constructed partial difference sets (PDS) with parameters $(2^{3m}, (2^{m+r}-2^m+2^r)(2^m-1), 2^m-2^r+(2^{m+r}-2^m+2^r)(2^r-2), (2^{m+r}-2^m+2^r)(2^r-1))$ in elementary abelian groups of order $2^{3m}$ for all $m\geq…
A maximal arc of degree k in a finite projective plane P of order q = ks is a set of (q-s+1)k points that meets every line of P in either k or 0 points. The collection of the nonempty intersections of a maximal arc with the lines of P is a…
A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $K$ of the Desarguesian plane $PG(2,q)$ is obtained. The case where $K$ is a maximal $(k,n)$-arc is considered to greater extent.
Let $\mathrm{PG}(k-1,q)$ be the $(k-1)$-dimensional projective space over the finite field $\mathbb{F}_q$. An arc in $\mathrm{PG}(k-1,q)$ is a set of points with the property that any $k$ of them span the entire space. The notion of…
In this paper we provide the non-existence criterion for the so-called maximizing curves of odd degrees. Furthermore, in the light of our criterion, we define a new class of plane curves that generalizes the notion of maximizing curves…
We investigate the maximal degree in a Poisson-Delaunay graph in $\mathbf{R}^d$, $d\geq 2$, over all nodes in the window $\mathbf{W}_\rho:= \rho^{1/d}[0,1]^d$ as $\rho$ goes to infinity. The exact order of this maximum is provided in any…
Let $m$ be a positive integer, $q$ be a prime power, and $\mathrm{PG}(2,q)$ be the projective plane over the finite field $\mathbb F_q$. Finding complete $m$-arcs in $\mathrm{PG}(2,q)$ of size less than $q$ is a classical problem in finite…
In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…
In this paper we consider the degree/diameter problem, namely, given natural numbers {\Delta} \geq 2 and D \geq 1, find the maximum number N({\Delta},D) of vertices in a graph of maximum degree {\Delta} and diameter D. In this context, the…
In this paper we give graphs with the largest known order for a given degree $\Delta$ and diameter $D$. The graphs are constructed from Moore bipartite graphs by replacement of some vertices by adequate structures. The paper also contains…
This work focuses on the degree bound of maps between balls with maximum geometric rank and minimum target dimension where this geometric rank occurs. Specifically, we show that rational proper maps between $\mathbb{B}_n$ and $\mathbb{B}_N$…