English
Related papers

Related papers: A geometric approach to Mathon maximal arcs

200 papers

In a recent paper [M], Mathon gives a new construction of maximal arcs which generalizes the construction of Denniston. In relation to this construction, Mathon asks the question of determining the largest degree of a non-Denniston maximal…

Combinatorics · Mathematics 2007-05-23 Frank Fiedler , Ka Hin Leung , Qing Xiang

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…

Combinatorics · Mathematics 2017-12-04 Stefaan De Winter , Cunsheng Ding , Vladimir D. Tonchev

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…

Combinatorics · Mathematics 2020-09-01 Mustafa Gezek , Vladimir D. Tonchev

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…

Combinatorics · Mathematics 2009-07-18 A. Aguglia , L. Giuzzi

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…

Combinatorics · Mathematics 2011-10-11 Frank De Clerck , Stefaan De Winter , Thomas Maes

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…

Combinatorics · Mathematics 2010-10-08 Frank De Clerck , Stefaan De Winter , Thomas Maes

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…

Combinatorics · Mathematics 2023-11-03 Stefaan De Winter

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,…

Combinatorics · Mathematics 2024-10-08 James A. Davis , Sophie Huczynska , Laura Johnson , John Polhill

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…

Combinatorics · Mathematics 2024-03-06 Zazil Santizo Huerta , Melissa Keranen , Vladimir Tonchev

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.

Combinatorics · Mathematics 2009-07-18 A. Aguglia , L. Giuzzi , G. Korchmaros

We investigate complete arcs of degree greater than two, in projective planes over finite fields, arising from the set of rational points of a generalization of the Hermitian curve. The degree of the arcs is closely related to the number of…

Algebraic Geometry · Mathematics 2014-01-16 Herivelto Borges , Beatriz Motta , Fernando Torres

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…

Combinatorics · Mathematics 2024-07-23 Jingjun Bao , Qing Xiang , Meng Zhao

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…

Probability · Mathematics 2018-04-05 Gilles Bonnet , Nicolas Chenavier

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…

Combinatorics · Mathematics 2020-03-06 Mustafa Gezek , Rudi Mathon , Vladimir D. Tonchev

The resolutions and maximal sets of compatible resolutions of all 2-(120,8,1) designs arising frommaximal (120,8)-arcs in the known projective planes of order 16 are computed. It is shown that each of these designs is embeddable in a unique…

Combinatorics · Mathematics 2019-01-29 Vladimir D. Tonchev , Tim Wagner

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…

Combinatorics · Mathematics 2020-08-20 Alexander Pilz , Jonathan Rollin , Lena Schlipf , André Schulz

In this paper we construct functional codes from Denniston maximal arcs. For $q=2^{4n+2}$ we obtain linear codes with parameters $[(\sqrt{q}-1)(q+1),5,d]_q$ where $\lim_{q \to +\infty} d=(\sqrt{q}-1)q-3\sqrt{q}$. We also find for $q=16,32$…

Combinatorics · Mathematics 2017-11-30 Daniele Bartoli , Massimo Giulietti , Maria Montanucci

An $n$-arc in a projective plane is a collection of $n$ distinct points in the plane, no three of which lie on a line. Formulas counting the number of $n$-arcs in any finite projective plane of order $q$ are known for $n \le 8$. In 1995,…

Combinatorics · Mathematics 2017-06-13 Nathan Kaplan , Susie Kimport , Rachel Lawrence , Luke Peilen , Max Weinreich

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

Combinatorics · Mathematics 2020-05-20 C. Dalfó , M. A. Fiol , N. López

We give explicit parametric equations for all irreducible plane projective sextic curves which have at most double points and whose total Milnor number is maximal (is equal to 19). In each case we find a parametrization over a number field…

Algebraic Geometry · Mathematics 2015-04-27 Stean Yu. Orevkov
‹ Prev 1 2 3 10 Next ›