English
Related papers

Related papers: Partial covers of PG(n,q)

200 papers

Using an Euclidean approach, we prove a new upper bound for the number of closed points of degree 2 on a smooth absolutely irreducible projective algebraic curve defined over the finite field $\mathbb F\_q$.This bound enables us to provide…

Algebraic Geometry · Mathematics 2015-10-08 Yves Aubry , Annamaria Iezzi

Let $M$ be a closed, orientable hyperbolic 3-manifold and $\phi$ a homomorphism of its fundamental group onto $\mathbb{Z}$ that is not induced by a fibration over the circle. For each natural number $n$ we give an explicit lower bound,…

Geometric Topology · Mathematics 2016-07-20 Jason DeBlois

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

Combinatorics · Mathematics 2017-11-28 Zoltán Lóránt Nagy

In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…

Algebraic Geometry · Mathematics 2007-05-23 Stephan Endraß , Ulf Persson , Jan Stevens

Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…

Number Theory · Mathematics 2007-05-23 D. R. Heath-Brown , J. -L. Colliot-Thélène

A {\it good drawing} of a graph $G$ is a drawing where the edges are non-self-intersecting and each two edges have at most one point in common, which is either a common end vertex or a crossing. The {\it crossing number} of a graph $G$ is…

Combinatorics · Mathematics 2012-10-24 Guoqing Wang , Haoli Wang , Yuansheng Yang , Xuezhi Yang , Wenping Zheng

Let PG$(r, q)$ be the $r$-dimensional projective space over the finite field ${\rm GF}(q)$. A set $\cal X$ of points of PG$(r, q)$ is a cutting blocking set if for each hyperplane $\Pi$ of PG$(r, q)$ the set $\Pi \cap \cal X$ spans $\Pi$.…

Combinatorics · Mathematics 2020-11-24 Daniele Bartoli , Antonio Cossidente , Giuseppe Marino , Francesco Pavese

For a non-degenerate irreducible curve $C$ of degree $d$ in $\mathbb{P}^3$ over $\mathbb{F}_q$, we prove that the number $N_q(C)$ of $\mathbb{F}_q$-rational points of $C$ satisfies the inequality $N_q(C) \leq (d-2)q+1$. Our result improves…

Algebraic Geometry · Mathematics 2020-08-14 Peter Beelen , Maria Montanucci

It is well know that the theory of minimal blocking sets is studied by several author. Another theory which is also studied by a large number of researchers is the theory of hyperplane arrangements. We can remark that the affine space…

Information Theory · Computer Science 2008-02-15 Simona Settepanella

We say $G$ is \emph{$(Q_n,Q_m)$-saturated} if it is a maximal $Q_m$-free subgraph of the $n$-dimensional hypercube $Q_n$. A graph, $G$, is said to be $(Q_n,Q_m)$-semi-saturated if it is a subgraph of $Q_n$ and adding any edge forms a new…

Combinatorics · Mathematics 2016-09-28 J. Robert Johnson , Trevor Pinto

Let $X^n$ be a nonsingular hypersurface of degree $d\geq 2$ in the projective space $\mathbb{P}^{n+1}$ defined over a finite field $\mathbb{F}_q$ of $q$ elements. We prove a Homma-Kim conjecture on a upper bound about the number of…

Algebraic Geometry · Mathematics 2020-03-09 Andrea Luigi Tironi

How many hyperplanes in $\mathbb{R}^n$ are needed in order to slice every edge of the $n$-dimensional hypercube with vertex set $\{\pm 1\}^n$? Here, we say that a hyperplane $H\subseteq \mathbb{R}^n$ slices an edge of the hypercube if it…

Combinatorics · Mathematics 2025-10-21 Lisa Sauermann , Zixuan Xu

The input to the NP-hard Point Line Cover problem (PLC) consists of a set $P$ of $n$ points on the plane and a positive integer $k$, and the question is whether there exists a set of at most $k$ lines which pass through all points in $P$. A…

Data Structures and Algorithms · Computer Science 2013-07-10 Stefan Kratsch , Geevarghese Philip , Saurabh Ray

We establish an upper bound $\omega(p/q)$ on the complexity of manifolds obtained by $p/q$-surgeries on the figure eight knot. It turns out that if $\omega(p/q)\leqslant 12$, the bound is sharp.

Geometric Topology · Mathematics 2011-05-13 Evgeny Fominykh

For prime powers q, let s(q) denote the probability that a randomly-chosen principally-polarized abelian surface over the finite field F_q is not simple. We show that there are positive constants B and C such that for all q, B (log…

Number Theory · Mathematics 2020-02-27 Jeff Achter , Everett W. Howe

We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…

Combinatorics · Mathematics 2026-02-02 Denis S. Krotov , Sascha Kurz

In the study of the constant in Ahlfors' second fundamental theorem involving a set E_{q} of q points, branch values of covering surfaces outside E_{q} bring a lot of troubles. To avoid this situation, for a given surface S, it is useful to…

Complex Variables · Mathematics 2018-10-17 Zonghan Sun , Guangyuan Zhang

We study the existence of almost complex structures on even-dimensional sphere bundles over complex projective spaces. For bundles $\xi_{n,q}$ with fibre $S^{2q}$ over $\mathbb{C} P^n$, we establish a necessary condition: if $q \ge a(n)$…

Algebraic Topology · Mathematics 2026-02-17 Chengwan Liu , Huijun Yang

Fix integers $r\geq 4$ and $i\geq 2$ (for $r=4$ assume $i\geq 3$). Assuming that the rational number $s$ defined by the equation $\binom{i+1}{2}s+(i+1)=\binom{r+i}{i}$ is an integer, we prove an upper bound for the genus of a reduced and…

Algebraic Geometry · Mathematics 2022-08-02 Vincenzo Di Gennaro

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…