English
Related papers

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

200 papers

In this paper we characterize the non-singular Hermitian variety ${\mathcal H}(6,q^2)$ of $\mathrm{PG}(6, q^2)$, $q\neq2$ among the irreducible hypersurfaces of degree $q+1$ in $\mathrm{PG}(6, q^2)$ not containing solids by the number of…

Combinatorics · Mathematics 2021-06-01 Angela Aguglia , Luca Giuzzi , Masaaki Homma

We prove that if $G$ is an abelian group and $H_1x_1,\dots,H_{k}x_k$ is an irredundant (minimal) cover of $G$ with cosets, then $$|G:\bigcap_{i=1}^{k}H_{i}|=2^{O(k)}.$$ This bound is the best possible up to the constant hidden in the…

Combinatorics · Mathematics 2022-11-01 János Nagy , Péter Pál Pach , István Tomon

An $(n,r)$-arc in $PG(2,q)$ is a set $B$ of points in $PG(2,q)$ such that each line in $PG(2,q)$ contains at most $r$ elements of $B$ and such that there is at least one line containing exactly $r$ elements of $B$. The value $m_r(2,q)$…

Combinatorics · Mathematics 2021-06-11 Michael Braun

Let $X \subset \mathbf{P}_{\mathbf{Q}}^{n-1}$ be a cubic hypersurface cut out by the vanishing of a non-degenerate rational cubic form in $n$ variables. Let $N(X,B)$ denote the number of rational points on $X$ of height at most $B$. In this…

Number Theory · Mathematics 2024-05-09 V. Vinay Kumaraswamy , Nick Rome

We study the existence of plane substructures in drawings of the $d$-dimensional hypercube graph $Q_d$. We construct drawings of $Q_d$ which contain no plane subgraph with more than $2d-2$ edges, no plane path with more than $2d-3$ edges,…

Computational Geometry · Computer Science 2026-03-06 Todor Antić , Niloufar Fuladi , Anna Margarethe Limbach , Pavel Valtr

We prove that for every centrally symmetric convex polygon Q, there exists a constant alpha such that any alpha*k-fold covering of the plane by translates of Q can be decomposed into k coverings. This improves on a quadratic upper bound…

Computational Geometry · Computer Science 2020-07-21 G. Aloupis , J. Cardinal , S. Collette , S. Langerman , D. Orden , P. Ramos

A nonsingular surface of degree $d \geq 2$ in $\mathbb{P}^3$ over $\mathbb{F}_q$ has at most $((d-1)q+1)d$ $\mathbb{F}_q$-lines, and this bound is optimal for $d = 2, \sqrt{q}+1, q+1$.

Algebraic Geometry · Mathematics 2016-08-10 Masaaki Homma , Seon Jeong Kim

Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…

Combinatorics · Mathematics 2012-10-12 Tuvi Etzion

A partial $t$-spread in $\mathbb{F}_q^n$ is a collection of $t$-dimensional subspaces with trivial intersection such that each non-zero vector is covered at most once. We present some improved upper bounds on the maximum sizes.

Combinatorics · Mathematics 2017-04-05 Sascha Kurz

A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is…

Combinatorics · Mathematics 2011-12-13 Jacob Fox , Janos Pach , Andrew Suk

Let P be a set of n weighted points, Q be a set of m unweighted points in the plane, and k a non-negative integer. We consider the problem of computing a subset $Q'\subseteq Q$ with size at most k such that the sum of the weights of the…

Data Structures and Algorithms · Computer Science 2024-11-28 Waseem Akram , Sanjeev Saxena

Let $G$ be a finite abelian group and $A$ be a subset of $G \times G$ which is corner--free, meaning that there are no $x, y \in G$ and $d \in G \setminus \{0\}$ such that $(x, y)$, $(x+d, y)$, $(x, y+d) \in A$. We prove that \[|A| \le…

Combinatorics · Mathematics 2025-07-15 Michael Jaber , Yang P. Liu , Shachar Lovett , Anthony Ostuni , Mehtaab Sawhney

We establish sharp upper and lower bounds for the number of rational points of bounded anticanonical height on a smooth bihomogeneous threefold defined over Q and of bidegree (1, 2). These bounds are in agreement with Manin's conjecture.

Number Theory · Mathematics 2013-08-02 Pierre Le Boudec

Let G=SO(n,1) and Gamma a geometrically finite Zariski dense subgroup of G which is contained in an arithmetic subgroup of G. Denoting by Gamma(q) the principal congruence subgroup of Gamma of level q, and fixing a positive number \lambda_0…

Spectral Theory · Mathematics 2013-02-14 Hee Oh

An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective linear codes. Let m_r(2,q) denote the maximal number n of…

Combinatorics · Mathematics 2019-07-19 Michael Braun

In 2016, Ellenberg and Gijswijt employed a method of Croot, Lev, and Pach to show that a maximal cap in $AG(n, q)$ has size $O(q^{cn})$ for some $c < 1$. In this paper, we show more generally that if $S$ is a subset of $AG(n, q)$ containing…

Combinatorics · Mathematics 2019-06-21 Michael Bennett

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

Combinatorics · Mathematics 2018-10-15 Jozsef Balogh , Jozsef Solymosi

For prime powers q<100, we compute new upper and lower bounds on N_q(4), the maximal number of points on a genus-4 curve over a finite field with q elements. We determine the exact value of N_q(4) for 17 prime powers q for which the value…

Algebraic Geometry · Mathematics 2012-03-12 Everett W. Howe

We find sharp upper and lower bounds for the degree of an algebraic number in terms of the $Q$-dimension of the space spanned by its conjugates. For all but seven nonnegative integers $n$ the largest degree of an algebraic number whose…

Number Theory · Mathematics 2007-05-23 Neil Berry , Arturas Dubickas , Noam D. Elkies , Bjorn Poonen , Chris Smyth

Theoretical results are known about the completeness of a planar algebraic cubic curve as a (n,3)-arc in PG(2,q). They hold for q big enough and sometimes have restriction on the characteristic and on the value of the j-invariant. We…

Combinatorics · Mathematics 2015-10-29 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco
‹ Prev 1 3 4 5 6 7 10 Next ›