English
Related papers

Related papers: Small complete caps in ${\rm PG}(4n + 1, q)$

200 papers

Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…

Combinatorics · Mathematics 2019-11-20 Boris Bukh , Alfredo Hubard

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

Computational Complexity · Computer Science 2017-03-21 Thomas Rothvoss

Using the correspondence between quadrics of ${\rm PG}(2,q)$ and points of ${\rm PG}(5,q)$, a family of $(6,q^3(q^2-1)(q-1)/3+(q^2+1)(q^2+q+1),4;3)_q$ constant dimension subspace codes is constructed.

Combinatorics · Mathematics 2015-06-02 Antonio Cossidente , Francesco Pavese

Minimal codes are being intensively studied in last years. $[n,k]_{q}$-minimal linear codes are in bijection with strong blocking sets of size $n$ in $PG(k-1,q)$ and a lower bound for the size of strong blocking sets is given by…

Combinatorics · Mathematics 2022-12-07 Valentino Smaldore

We prove that for all $n\geq 1$ there exists a number between $n^2$ and $(n+1)^2$ with at most 4 prime factors. This is the first result of this kind that holds for every $n\geq 1$ rather than just sufficiently large $n$. Our approach…

Number Theory · Mathematics 2025-06-26 Adrian W. Dudek , Daniel R. Johnston

A $(k; r, s; n, q)$-set (short: $(r,s)$-set) of $\mathrm{PG}(n, q)$ is a set of points $X$ with $|X| = k$ such that no $s$-space contains more than $r$ points of $X$. We investigate the asymptotic size of $(r, s)$-sets for $n$ fixed and $q…

Combinatorics · Mathematics 2022-11-14 Ferdinand Ihringer , Jacques Verstraëte

Tverberg-type theory aims to establish sufficient conditions for a simplicial complex $\Sigma$ such that every continuous map $f\colon \Sigma \to \mathbb{R}^d$ maps $q$ points from pairwise disjoint faces to the same point in…

Combinatorics · Mathematics 2023-08-03 Florian Frick , Pablo Soberón

Small complete arcs and caps in Galois spaces over finite fields $\fq$ with characteristic greater than 3 are constructed from cubic curves with an isolated double point. For $m$ a divisor of $q+1$, complete plane arcs of size approximately…

Combinatorics · Mathematics 2013-05-16 Nurdagul Anbar , Daniele Bartoli , Massimo Giulietti , Irene Platoni

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…

Let $HD_d(p,q)$ denote the minimal size of a transversal that can always be guaranteed for a family of compact convex sets in $\mathbb{R}^d$ which satisfy the $(p,q)$-property ($p \geq q \geq d+1$). In a celebrated proof of the…

Combinatorics · Mathematics 2016-12-05 Chaya Keller , Shakhar Smorodinsky , Gabor Tardos

Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in…

Combinatorics · Mathematics 2015-12-24 Daniele Bartoli , Massimo Giulietti , Giuseppe Marino , Olga Polverino

Let $\chi$ be a Dirichlet character modulo a prime~$p$. We give explicit upper bounds on $q_1<q_2<\dots<q_n$, the $n$ smallest prime nonresidues of $\chi$. More precisely, given $n_0$ and $p_0$ there exists an absolute constant…

Number Theory · Mathematics 2019-08-12 Shilin Ma , Kevin J. McGown , Devon Rhodes , Mathias Wanner

We study the topology and geometry of those compact Riemannian (4n)-manifolds (M,g), n > 1, with positive scalar curvature and holonomy in Sp(n)Sp(1). Up to homothety, we show that there are only finitely many such manifolds of any…

alg-geom · Mathematics 2008-02-03 Claude LeBrun

Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutive integers of the form $p^a\cdot q^b$ with $a,b\ge 0$. Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size…

Number Theory · Mathematics 2025-11-27 Alessandro Languasco , Florian Luca , Pieter Moree , Alain Togbé

Let $q_n$ denote the $n^{th}$ number that is a product of exactly two distinct primes. We prove that $$\liminf_{n\to \infty} (q_{n+1}-q_n) \le 6.$$ This sharpens an earlier result of the authors (arXivMath NT/0506067), which had 26 in place…

Number Theory · Mathematics 2014-02-26 D. A. Goldston , S. W. Graham , J. Pintz , C. Y. Yildirim

We establish that the minimum number of arcs required to partition the Galois projective plane $\text{PG}(2,q)$ is $q+1$. Furthermore, we determine the exact value for a fractional variant of this problem. We extend our analysis to affine…

Combinatorics · Mathematics 2026-01-28 Gabriela Araujo-Pardo , Leonardo Martínez-Sandoval

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

General Mathematics · Mathematics 2016-04-25 N. A. Carella

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.

Combinatorics · Mathematics 2009-07-18 A. Aguglia , L. Giuzzi , G. Korchmaros

In a projective plane $\Pi _{q}$ (not necessarily Desarguesian) of order $q,$ a point subset $S$ is saturating (or dense) if any point of $\Pi _{q}\setminus S$ is collinear with two points in$~S$. Using probabilistic methods, the following…

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
‹ Prev 1 3 4 5 6 7 10 Next ›