English
Related papers

Related papers: Projective Two-Weight Sets of Denniston Type

200 papers

We study the existence of almost complex structures on even-dimensional sphere bundles over complex projective spaces. For bundles $\xi_{n,q}$ with fibre $S^{2q}$ over $\mathbb{C} P^n$, we establish a necessary condition: if $q \ge a(n)$…

Algebraic Topology · Mathematics 2026-02-17 Chengwan Liu , Huijun Yang

In a projective plane $\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\mathcal{S}$ is saturating (or dense) if any point of $\Pi_{q}\setminus \mathcal{S}$ is collinear with two points in $\mathcal{S}$. Modifying an…

The equivalence problem of $\mathbb{F}_q$-linear sets of rank n of $PG(1,q^n)$ is investigated, also in terms of the associated variety, projecting configurations, $\mathbb{F}_q$-linear blocking sets of R\'edei type and MRD-codes.

Combinatorics · Mathematics 2016-07-26 Bence Csajbók , Giuseppe Marino , Olga Polverino

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 this paper it has been verified, by a computer-based proof, that the smallest size of a complete arc is 14 in PG(2,31) and in PG(2,32). Some examples of such arcs are also described.

Combinatorics · Mathematics 2010-05-20 Stefano Marcugini , Alfredo Milani , Fernanda Pambianco

In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…

Information Theory · Computer Science 2022-07-18 Tim L. Alderson , Alessandro Neri

Let $\{0=w_0<w_1<w_2<\ldots<w_m\}$ be the set of weights of binary Steinhaus triangles of size $n$, and let $W_i$ be the set of sequences in $\mathbb{F}_2^n$ that generate triangles of weight $w_i$. We obtain the values of $w_i$ and the…

Combinatorics · Mathematics 2017-07-24 Josep M. Brunat , Montserrat Maureso

In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…

Combinatorics · Mathematics 2020-03-06 Mustafa Gezek , Rudi Mathon , Vladimir D. Tonchev

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

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

We introduce some (p,q)-deformations of the weight multiplicities for the representations of any simple Lie algebra g over the complex numbers. This is done by associating the indeterminate q to the positive roots of a parabolic subsystem…

Combinatorics · Mathematics 2025-11-10 Cédric Lecouvey

We investigate small weight code words of the $p$-ary linear code $\mathcal C_{j,k}(n,q)$ generated by the incidence matrix of $k$-spaces and $j$-spaces of PG$(n,q)$ and its dual, with $q$ a prime power and $0 \leq j < k < n$. Firstly, we…

Combinatorics · Mathematics 2022-09-07 Sam Adriaensen , Lins Denaux

A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs. It turns out that there are interesting connections to scattered subspaces,…

Combinatorics · Mathematics 2019-03-04 Marco Buratti , Michael Kiermaier , Sascha Kurz , Anamari Nakić , Alfred Wassermann

We construct skew corner-free sets in $[n]^2$ of size $n^{5/4}$, thereby disproving a conjecture of Kevin Pratt. We also show that any skew corner-free set in $\mathbb{F}_{q}^{n} \times \mathbb{F}_{q}^{n}$ must have size at most…

Combinatorics · Mathematics 2024-02-01 Cosmin Pohoata , Dmitrii Zakharov

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, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…

Information Theory · Computer Science 2021-11-22 Canze Zhu , Qunying Liao

Even and odd q-deformed charge coherent states are constructed, their (over)completeness proved and their generation explored. A $D$-algebra realization of the SU$_q$(1,1) generators is given in terms of them. They are shown to exhibit…

Quantum Physics · Physics 2015-06-26 X. -M. Liu , C. Quesne

Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…

Information Theory · Computer Science 2017-09-19 Minjia Shi , Zhongyi Zhang , Patrick Sole

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

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen