English
Related papers

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

200 papers

We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…

Combinatorics · Mathematics 2019-05-28 Antonio Cossidente , Giuseppe Marino , Francesco Pavese

A partial $(k-1)$-spread in $\operatorname{PG}(n-1,q)$ is a collection of $(k-1)$-dimensional subspaces with trivial intersection, i.e., each point is covered at most once. So far the maximum size of a partial $(k-1)$-spread in…

Combinatorics · Mathematics 2016-11-03 Sascha Kurz

A $q$-covering design $\mathbb{C}_q(n, k, r)$, $k \ge r$, is a collection $\mathcal X$ of $(k-1)$-spaces of $\mathrm{PG}(n-1, q)$ such that every $(r-1)$-space of $\mathrm{PG}(n-1, q)$ is contained in at least one element of $\mathcal X$ .…

Combinatorics · Mathematics 2019-04-30 Francesco Pavese

We improve on the lower bound of the maximum number of planes in $\operatorname{PG}(8,q)\cong\F_q^{9}$ pairwise intersecting in at most a point. In terms of constant dimension codes this leads to $A_q(9,4;3)\ge q^{12}+…

Combinatorics · Mathematics 2019-12-02 Sascha Kurz

In this work we construct a new class of maximal partial spreads in $PG(4,q)$, that we call $q$-added maximal partial spreads. We obtain them by depriving a spread of a hyperplane of some lines and adding $q+1$ lines not of the hyperplane…

Combinatorics · Mathematics 2013-01-24 Sandro Rajola , Maurizio Iurlo

In this paper we prove the existence of a complete cap of ${\rm PG}(4n+1, q)$ of size $2(q^{2n+1}-1)/(q-1)$, for each prime power $q>2$. It is obtained by projecting two disjoint Veronese varieties of ${\rm PG}(2n^2+3n, q)$ from a suitable…

Combinatorics · Mathematics 2021-06-01 Antonio Cossidente , Bence Csajbók , Giuseppe Marino , Francesco Pavese

For a set $P$ of $n$ points in $\mathbb R^d$, for any $d\ge 2$, a hyperplane $h$ is called $k$-rich with respect to $P$ if it contains at least $k$ points of $P$. Answering and generalizing a question asked by Peyman Afshani, we show that…

Combinatorics · Mathematics 2026-02-16 Zuzana Patáková , Micha Sharir

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

Group Theory · Mathematics 2009-01-14 Alireza Abdollahi

Let $H$ be a non-empty set of hyperplanes in $PG(4,q)$, $q$ even, such that every point of $PG(4,q)$ lies in either $0$, $\frac12q^3$ or $\frac12(q^3+q^2)$ hyperplanes of $ H$, and every plane of $PG(4,q)$ lies in $0$ or at least $\frac12q$…

Combinatorics · Mathematics 2019-06-13 S. G. Barwick , Alice M. W. Hui , Wen-Ai Jackson , Jeroen Schillewaert

Let $n$ and $t$ be positive integers with $t<n$, and let $q$ be a prime power. A partial $(t-1)$-spread of ${\rm PG}(n-1,q)$ is a set of $(t-1)$-dimensional subspaces of ${\rm PG}(n-1,q)$ that are pairwise disjoint. Let $r\equiv n\pmod{t}$…

Combinatorics · Mathematics 2017-07-05 Esmeralda Nastase , Papa Sissokho

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…

Number Theory · Mathematics 2007-05-23 Wen-Ching Li , Hiren Maharaj

Given a hypercube $\mathcal{Q}^{n} := \{0,1\}^{n}$ in $\mathbb{R}^{n}$ and $k \in \{0, \dots, n\}$, the $k$-th layer $\mathcal{Q}^{n}_{k}$ of $\mathcal{Q}^{n}$ denotes the set of all points in $\mathcal{Q}^{n}$ whose coordinates contain…

Combinatorics · Mathematics 2023-05-23 Arijit Ghosh , Chandrima Kayal , Soumi Nandi

In this work, we prove the existence of maximal partial line spreads in PG(5,q) of size q^3+q^2+kq+1, with 1 \leq k \leq (q^3-q^2)/(q+1), k an integer. Moreover, by a computer search, we do this for larger values of k, for q \leq 7. Again…

Combinatorics · Mathematics 2015-11-24 Maurizio Iurlo

In the projective space $\mathrm{PG}(N,q)$ over the Galois field of order $q$, $N\ge3$, an iterative step-by-step construction of complete caps by adding a new point on every step is considered. It is proved that uncovered points are evenly…

Combinatorics · Mathematics 2017-06-08 Alexander A. Davydov , Giorgio Faina , Stefano Marcugini , Fernanda Pambianco

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

Algebraic Geometry · Mathematics 2020-07-08 Yiran Cheng

Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…

Combinatorics · Mathematics 2023-08-01 Arijit Ghosh , Chandrima Kayal , Soumi Nandi , S. Venkitesh

Alon and F\"{u}redi (1993) showed that the number of hyperplanes required to cover $\{0,1\}^n\setminus \{0\}$ without covering $0$ is $n$. We initiate the study of such exact hyperplane covers of the hypercube for other subsets of the…

Combinatorics · Mathematics 2021-07-02 James Aaronson , Carla Groenland , Andrzej Grzesik , Tom Johnston , Bartłomiej Kielak

The numbers of $\mathbb{F}_q$-points of nonsingular hypersurfaces of a fixed degree in an odd-dimensional projective space are investigated, and an upper bound for them is given. Also we give the complete list of nonsingular hypersurfaces…

Algebraic Geometry · Mathematics 2016-11-09 Masaaki Homma , Seon Jeong Kim

An $(r, s)$-${\textit set}$ in ${\rm PG}(n, q)$ is a set of points, say $\mathcal X$, such that each $s$-dimensional projective subspace contains at most $r$ points of $\mathcal X$. We investigate $(n, n-2)$-sets and $(n-2, n-3)$-sets in…

Combinatorics · Mathematics 2026-05-22 Francesco Pavese

In this work complete caps in $PG(N,q)$ of size $O(q^{\frac{N-1}{2}}\log^{300} q)$ are obtained by probabilistic methods. This gives an upper bound asymptotically very close to the trivial lower bound $\sqrt{2}q^{\frac{N-1}{2}}$ and it…

Combinatorics · Mathematics 2014-06-20 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco
‹ Prev 1 2 3 10 Next ›