English
Related papers

Related papers: On pseudo-arcs from normal rational curve and addi…

200 papers

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

Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…

Combinatorics · Mathematics 2009-01-06 Alexander A. Davydov , Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco

We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…

Combinatorics · Mathematics 2023-10-17 Anina Gruica , Alberto Ravagnani , John Sheekey , Ferdinando Zullo

A k-noncrossing RNA pseudoknot structure is a graph over $\{1,...,n\}$ without 1-arcs, i.e. arcs of the form (i,i+1) and in which there exists no k-set of mutually intersecting arcs. In particular, RNA secondary structures are 2-noncrossing…

Combinatorics · Mathematics 2007-08-01 Emma Y. Jin , Christian M. Reidys

Let F_q be a finite field of order q with characteristic p. An arc is an ordered family of at least k vectors in (F_q)^k in which every subfamily of size k is a basis of (F_q)^k. The MDS conjecture, which was posed by Segre in 1955, states…

Combinatorics · Mathematics 2016-11-08 Ameera Chowdhury

We consider visibility graphs involving bars and arcs in which lines of sight can pass through up to k objects. We prove a new edge bound for arc k-visibility graphs, provide maximal constructions for arc and semi-arc k-visibility graphs,…

Combinatorics · Mathematics 2016-01-07 Mehtaab Sawhney , Jonathan Weed

Let $\mathcal W$ be a non-empty set of points of a finite Desarguesian projective space $\mathrm{PG}(n,q)$. A collection of varieties of $\mathrm{PG}(n,q)$ is \emph{mutually $\mu$-intersecting (relatively to $\mathcal W$)} if its elements…

Combinatorics · Mathematics 2025-08-26 Angela Aguglia , Luca Giuzzi , Viola Siconolfi

We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges with endpoints on the vertices of P such that these new…

Combinatorics · Mathematics 2020-08-20 Alexander Pilz , Jonathan Rollin , Lena Schlipf , André Schulz

To an arc $\mathcal{A}$ of $\mathrm{PG}(k-1,q)$ of size $q+k-1-t$ we associate a tensor in $\langle \nu_{k,t}(\mathcal{A})\rangle^{\otimes k-1}$, where $\nu_{k,t}$ denotes the Veronese map of degree $t$ defined on $\mathrm{PG}(k-1,q)$. As a…

Combinatorics · Mathematics 2019-05-29 Simeon Ball , Michel Lavrauw

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

It is proved that for every $d\ge 2$ such that $d-1$ divides $q-1$, where $q$ is a power of 2, there exists a Denniston maximal arc $A$ of degree $d$ in $\PG(2,q)$, being invariant under a cyclic linear group that fixes one point of $A$ and…

Combinatorics · Mathematics 2017-12-04 Stefaan De Winter , Cunsheng Ding , Vladimir D. Tonchev

Hyperovals in $\PG(2,\gf(q))$ with even $q$ are maximal arcs and an interesting research topic in finite geometries and combinatorics. Hyperovals in $\PG(2,\gf(q))$ are equivalent to $[q+2,3,q]$ MDS codes over $\gf(q)$, called hyperoval…

Information Theory · Computer Science 2018-04-18 Ziling Heng , Cunsheng Ding

Let $k$ be an algebraically closed field of characteristic $p>0$. Let $D$ be a $p$-divisible group over $k$ which is not isoclinic. Let $\scrD$ (resp. $\scrD_k$) be the formal deformation space of $D$ over $\Spf(W(k))$ (resp. over…

Number Theory · Mathematics 2012-07-25 Adrian Vasiu

By using the notion of $d$-embedding $\Gamma$ of a (canonical) subgeometry $\Sigma$ and of exterior set with respect to the $h$-secant variety $\Omega_{h}(\mathcal{A})$ of a subset $\mathcal{A}$, $ 0 \leq h \leq n-1$, in the finite…

Information Theory · Computer Science 2024-05-03 Nicola Durante , Giovanni Giuseppe Grimaldi , Giovanni Longobardi

The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…

Information Theory · Computer Science 2026-05-29 Haojie Chen , Chuangqiang Hu , Junjie Huang , Chang-An Zhao

In this paper, we give a geometric construction of the three strong non-lifted $(3\mod{5})$-arcs in $\operatorname{PG}(3,5)$ of respective sizes 128, 143, and 168, and construct an infinite family of non-lifted, strong $(t\mod{q})$-arcs in…

Combinatorics · Mathematics 2023-08-29 Sascha Kurz , Ivan Landjev , Francesco Pavese , Assia Rousseva

The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong…

Computational Complexity · Computer Science 2021-11-18 Chris Jones , Aaron Potechin , Goutham Rajendran , Madhur Tulsiani , Jeff Xu

An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…

Computational Geometry · Computer Science 2020-01-17 Stefan Felsner , Manfred Scheucher

We present a new circular-arc cartogram model in which countries are drawn as polygons with circular arcs instead of straight-line segments. Given a political map and values associated with each country in the map, a cartogram is a…

Computational Geometry · Computer Science 2012-12-07 Jan-Hinrich Kämper , Stephen G. Kobourov , Martin Nöllenburg

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