Related papers: Partial covers of PG(n,q)
We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is…
Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…
For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\geq n_0$, then there exists a set of $n$ points in…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We prove the following conjecture due to Bryant Mathews (2008). Let Q be the orthogonal grassmannian of totally isotropic i-planes of a non-degenerate quadratic form q over an arbitrary field (where i is an integer in the interval [1, (\dim…
In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in general position (with no three points collinear): perfect…
We show first that a generic hypersurface $V$ of degree $d\geq 3$ in the complex projective space $ \mathbb{P}^n$ of dimension $n \geq 3$ has at least one hyperplane section $V \cap H$ containing exactly $n$ ordinary double points, alias…
In all dimensions $n \ge 4$ not of the form $4m+3$, we show that there exists a closed hyperbolic $n$-manifold which is not the boundary of a compact $(n+1)$-manifold. The proof relies on the relationship between the cobordism class and the…
Call a curve $C \subset \mathbb{P}^2$ defined over $\mathbb{F}_q$ transverse-free if every line over $\mathbb{F}_q$ intersects $C$ at some closed point with multiplicity at least 2. In 2004, Poonen used a notion of density to treat Bertini…
In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using…
The covering number, $\sigma(G)$, of a finite, noncyclic group $G$ is the least positive integer $n$ such that $G$ is the union of $n$ proper subgroups. Here we investigate the covering numbers of the projective special unitary groups…
We prove that every set of n points in the plane has at most $(16+5/6)^n$ rectangulations. This improves upon a long-standing bound of Ackerman. Our proof is based on the cross-graph charging-scheme technique.
New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for 853<= q<= 2879 and q=3511,4096, 4523,5003,5347,5641,5843,6011. For q<= 2377 and q=2401,2417,2437, the relation…
We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…
In this paper we show that if $n\geq 5$ and $G$ is any of the groups $SU_n(q)$ with $n\neq 6,$ $Sp_{2n}(q)$ with $q$ odd, $\Omega_{2n+1}(q),$ $\Omega_{2n}^{\pm}(q),$ then $G$ and the simple group $\barG=G/Z(G)$ are not 2-coverable. Moreover…
We give an upper bound for the number of points of a hypersurface over a finite field that has no lines on, in terms of the dimension, the degree, and the number of the elements of the finite field.
A subset $\mathcal{S}$ of a conic $\mathcal{C}$ in the projective plane $\mathrm{PG}(2,q)$ is called almost complete (AC-subset for short) if it can be extended to a larger arc in $\mathrm{PG}(2,q)$ only by the points of…
We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.