English
Related papers

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

200 papers

In this note, we show that for any $m \in \{1,2, \dots , q +1 \}$, if $G$ is a polarity graph of a projective plane of order $q$ that has an oval, then $G$ contains a subgraph on $m + \binom{m}{2}$ vertices with $m^2+\frac{m^4}{8q} - O (…

Combinatorics · Mathematics 2015-02-11 Michael Tait , Craig Timmons

We show that the size of the intersection of a Hermitian variety in $\PG(n,q^2)$, and any set satisfying an $r$-dimensional-subspace intersection property, is congruent to 1 modulo a power of $p$. In particular, in the case where $n=2$, if…

Combinatorics · Mathematics 2011-07-12 David B. Chandler

The graphs $D(k,q)$ have connected components $CD(k,q)$ giving the best known bounds on extremal problems with {\em forbidden\/} even cycles, and are denser than the well-known graphs of Lubotzky, Phillips, Sarnak and Margulis. Despite…

Combinatorics · Mathematics 2017-01-16 G. Eric Moorhouse , Shuying Sun , Jason Williford

In this paper we present the complete classification of caps in PG(5,2). These results have been obtained using a computer based exhaustive search that exploits projective equivalence.

Combinatorics · Mathematics 2012-03-06 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

Let $n$ be a natural number greater than $2$ and $q$ be the smallest prime dividing $n$. We show that a finite subset $A$ of rationals, of cardinality at most $q$, contains a $n^{th}$ power in $\mathbb{Q}_{p}$ for almost every prime $p$ if…

Number Theory · Mathematics 2025-03-21 Bhawesh Mishra

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…

Combinatorics · Mathematics 2017-12-29 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

We determine the minimal bi-degree(s) of an irreducible filling curve over $\mathbb{F}_q$ for $\mathbb{P}^1\times \mathbb{P}^1$. It is $(q+1, q+1)$ if $q\neq 2$, and they are $(4,3)$ and $(3,4)$ if $q=2$.

Algebraic Geometry · Mathematics 2022-03-23 Masaaki Homma , Seon Jeong Kim

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

We prove that every fan-in $2$ noncommutative arithmetic circuit computing the palindrome polynomial has size $\Omega(nd)$. In particular, when $d=n$ we obtain an $\Omega(n^2)$ lower bound. The proof builds on and refines a previous work of…

Computational Complexity · Computer Science 2026-05-20 Pratik Shastri

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

D. Khavinson and G. Swiatek proved that harmonic polynomials p(z)+q(z), where p is holomorphic, q is antiholomorphic, and deg p = n > 1 = deg q, can have at most 3n-2 complex zeros. We show that this bound is sharp for all n by proving a…

Complex Variables · Mathematics 2014-04-04 Lukas Geyer

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. Suppose that $a$ and $q$ are positive integers satisfying $(a,q)=1$. Denote by $\mathcal{P}_2(a,q)$ the least almost-prime…

Number Theory · Mathematics 2021-07-20 Jinjiang Li , Min Zhang , Yingchun Cai

In this paper, we first prove the 2-rank of full incidence matrix of PG(n,q) with $q$ an odd prime power. Then by the quadratic form defined on PG(n,q), the points of it are classified as isotropic and anisotropic points. We divide the full…

Number Theory · Mathematics 2013-03-19 Chunlei Liu , Yan Liu

Let $d\ge4$ and $c\in(-d,d)$ be relatively prime integers. We show that for any sufficiently large integer $n$ (in particular $n>24310$ suffices for $4\le d\le 36$), the smallest prime $p\equiv c\pmod d$ with $p\ge(2dn-c)/(d-1)$ is the…

Number Theory · Mathematics 2015-10-23 Zhi-Wei Sun

Let $G$ be a graph with a perfect matching. Denote by $f(G)$ the minimum size of a matching in $G$ which is uniquely extendable to a perfect matching in $G$. Diwan (2019) proved by linear algebra that for $d$-hypercube $Q_d$ ($d\geq 2)$,…

Combinatorics · Mathematics 2025-02-18 Qiaoyun Shi , Heping Zhang

We show that a graph with $n$ vertices and vertex cover of size $k$ has at most $4^k + n$ potential maximal cliques. We also show that for each positive integer $k$, there exists a graph with vertex cover of size $k$, $O(k^2)$ vertices, and…

Combinatorics · Mathematics 2020-11-24 Tuukka Korhonen

We construct two-weight sets in PG$(3n-1,q)$, $n\geq2$ with the same weights as those that would arise from the blow-up of a maximal $q$-arc in PG$(2,q^n)$. The construction is of particular interest when $q$ is odd, as it is well known…

Combinatorics · Mathematics 2023-11-03 Stefaan De Winter

For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…

Number Theory · Mathematics 2022-04-21 Leif Jacob , Burkhard Külshammer

Let ${\cal Q}^-(2n+1,q)$ be an elliptic quadric of ${\rm PG}(2n+1,q)$. A relative $m$-ovoid of ${\cal Q}^-(2n+1,q)$ (with respect to a parablic section ${\cal Q} := {\cal Q}(2n,q) \subset {\cal Q}^-(2n+1,q)$) is a subset $\cal R$ of points…

Combinatorics · Mathematics 2016-10-04 A. Cossidente , F. Pavese

Bicovering arcs in Galois affine planes of odd order are a powerful tool for constructing complete caps in spaces of higher dimensions. In this paper we investigate whether some arcs contained in nodal cubic curves are bicovering. For…

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