Related papers: Arcs in $\mathbb F_q^2$

The number A(q) is the upper limit of the ratio of the maximum number of points of a curve defined over $\Fq$ to the genus. By constructing class field towers with good parameters we present improvements of lower bounds of A(q) for q an odd…

To an arc $\mathcal{A}$ of $\mathrm{PG}(k-1,q)$ of size $q+k-1-t$ we associate a tensor in $\langle \nu_{k,t}(\mathcal{A})\rangle^{\otimes k-1}$, where $\nu_{k,t}$ denotes the Veronese map of degree $t$ defined on $\mathrm{PG}(k-1,q)$. As a…

A $k$-arc in PG($2,q$) is a set of $k$ points no three of which are collinear. A hyperfocused $k$-arc is a $k$-arc in which the $k \choose 2$ secants meet some external line in exactly $k-1$ points. Hyperfocused $k$-arcs can be viewed as…

Tables of sizes of random complete arcs in the plane $PG(2,q)$ are given. The sizes are close to the smallest known sizes of complete arcs in $PG(2,q)$, in particular, to ones constructed by Algorithm FOP (fixed order of points). The random…

Let $C$ be the unit circle in $\mathbb{R}^2$. We can view $C$ as a plane graph whose vertices are all the points on $C$, and the distance between any two points on $C$ is the length of the smaller arc between them. We consider a graph…

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.

We deepen the link between two classic areas of combinatorial optimization: augmentation and packing arborescences. We consider the following type of questions: What is the minimum number of arcs to be added to a digraph so that in the…

We consider point sets in $\mathbb{Z}_n^2$ where no three points are on a line - also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear…

We prove that if $E \subset {\mathbb F}_q^2$, $q \equiv 3 \mod 4$, has size greater than $Cq^{7/4}$, then $E$ determines a positive proportion of all congruence classes of triangles in ${\mathbb F}_q^2$. The approach in this paper is based…

We construct a sample of numerical models for clusters of galaxies and employ these to investigate their capability of imaging background sources into long arcs. Emphasis is laid on the statistics of these arcs. We study cross sections for…

Let $r_k(N)$ be the largest cardinality of a subset of $\{1,\ldots,N\}$ which does not contain any arithmetic progressions (APs) of length $k$. In this paper, we give new upper and lower bounds for fractal dimensions of a set which does not…

A {\em pseudo-arc} in $\mathrm{PG}(3n-1,q)$ is a set of $(n-1)$-spaces such that any three of them span the whole space. A pseudo-arc of size $q^n+1$ is a {\em pseudo-oval}. If a pseudo-oval $\mathcal{O}$ is obtained by applying field…

A {\em generalized hyperfocused arc} $\mathcal H $ in $PG(2,q)$ is an arc of size $k$ with the property that the $k(k-1)/2$ secants can be blocked by a set of $k-1$ points not belonging to the arc. We show that if $q$ is a prime and…

A point (x1, x2) with coordinates in a subfield of R of transcendence degree one over Q, with 1, x1, x2 linearly independent over Q, may have a uniform exponent of approximation by elements of Q^2 that is strictly larger than the lower…

We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…

In the previous works of the authors, a step-by-step algorithm FOP which uses any fixed order of points in the projective plane $\mathrm{PG}(2,q)$ is proposed to construct small complete arcs. In each step, the algorithm adds to a current…

For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…

In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a subset of $F_q^n$ with no three terms in arithmetic progression by $c^n$ with $c < q$. For $q=3$, the problem of finding the largest subset…

We show that the set of F_q-rational points of either certain Fermat curves or certain F_q-Frobenius non-classical plane curves is a complete (k,d)-arc in P^2(F_q), where k and d are respectively the number of F_q-rational points and the…

The existence of an arc statistics problem was at the center of a strong debate in the last fifteen years. With the aim to clarify if the optical depth for giant gravitational arcs by galaxy clusters in the so called concordance model is…