English
Related papers

Related papers: On the linearity of higher-dimensional blocking se…

200 papers

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented…

Cryptography and Security · Computer Science 2007-05-23 Jianqin Zhou

In this paper, we first study in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by Bonini and Borello, and then completely characterize minimal linear codes as cutting blocking…

Information Theory · Computer Science 2020-04-28 Chunming Tang , Yan Qiu , Qunying Liao , Zhengchun Zhou

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, we analyze the structure of maximal sets of $k$-dimensional spaces in $\mathrm{PG}(n,q)$ pairwise intersecting in at least a $(k-2)$-dimensional space, for $3 \leq k\leq n-2$. We give an overview of the largest examples of…

Combinatorics · Mathematics 2020-05-13 Jozefien D'haeseleer , Giovanni Longobardi , Ago-Erik Riet , Leo Storme

We prove that every possible $k$-cycle can be embedded into $PG(n,q)$, for all $n\geq 3$ and $q$ a power of a prime.

Combinatorics · Mathematics 2013-10-02 Elaina Aceves , David Heywood , Ashley Klahr , Oscar Vega

We study rationality properties of irreducible characters of finite groups. We show that the continuity of $2$-rationality is a phenomenon that can be detected in the principal $2$-block, thus refining a recent result of N. N. Hung. We also…

Representation Theory · Mathematics 2024-12-23 Gunter Malle , J. Miquel Martínez , Carolina Vallejo

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

Computational Complexity · Computer Science 2015-08-11 Hing Yin Tsang , Ning Xie , Shengyu Zhang

The concept of linear set in projective spaces over finite fields was introduced by Lunardon in 1999 and it plays central roles in the study of blocking sets, semifields, rank-distance codes and etc. A linear set with the largest possible…

Combinatorics · Mathematics 2021-09-30 Giovanni Longobardi , Giuseppe Marino , Rocco Trombetti , Yue Zhou

The rank of a scattered $\mathbb{F}_q$-linear set of $\mathrm{PG}(r-1,q^n)$, $rn$ even, is at most $rn/2$ as it was proved by Blokhuis and Lavrauw. Existence results and explicit constructions were given for infinitely many values of $r$,…

Combinatorics · Mathematics 2017-01-25 Bence Csajbók , Giuseppe Marino , Olga Polverino , Ferdinando Zullo

It is shown that any subset $E$ of a plane over a finite field $\F_q$, of cardinality $|E|>q$ determines not less than $\frac{q-1}{2}$ distinct areas of triangles, moreover once can find such triangles sharing a common base. It is also…

Combinatorics · Mathematics 2012-05-02 Alex Iosevich , Misha Rudnev , Yujia Zhai

The input to the NP-hard Point Line Cover problem (PLC) consists of a set $P$ of $n$ points on the plane and a positive integer $k$, and the question is whether there exists a set of at most $k$ lines which pass through all points in $P$. A…

Data Structures and Algorithms · Computer Science 2013-07-10 Stefan Kratsch , Geevarghese Philip , Saurabh Ray

The maximum scattered linear sets in $PG(1,q^n)$ have been completely classified for $n \le 4$ by Csajb\'ok-Zanella and Lavrauw-Van de Voorde. Here a wide class of linear sets in $PG(1,q^5)$ is studied which depends on two parameters.…

Combinatorics · Mathematics 2019-05-28 Maria Montanucci , Corrado Zanella

We give an explicit characterization of all minimal value set polynomials in $\F_q[x]$ whose set of values is a subfield $\F_{q'}$ of $\F_{q}$. We show that the set of such polynomials, together with the constants of $\F_{q'}$, is an…

Number Theory · Mathematics 2011-08-10 Herivelto Borges , Ricardo Conceição

Given two finite posets P and Q, P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain C_Q in Q with the property that f restricted to C_Q is…

Data Structures and Algorithms · Computer Science 2013-04-23 Jaroslaw Blasiok , Marcin Kaminski

We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\mathbb{F}_q$ and their classification. Through a mix of linear programming,…

Combinatorics · Mathematics 2021-12-14 Sascha Kurz , Sam Mattheus

The multi-bubble isoperimetric conjecture in $n$-dimensional Euclidean and spherical spaces from the 1990's asserts that standard bubbles uniquely minimize total perimeter among all $q-1$ bubbles enclosing prescribed volume, for any $q \leq…

Differential Geometry · Mathematics 2025-04-22 Emanuel Milman , Joe Neeman

A $4$-general set in ${\rm PG}(n,q)$ is a set of points of ${\rm PG}(n,q)$ spanning the whole ${\rm PG}(n,q)$ and such that no four of them are on a plane. Such a pointset is said to be complete if it is not contained in a larger…

Combinatorics · Mathematics 2023-05-24 Francesco Pavese

Let $\text{PG}(n,q)$ be the Desarguesian projective space of dimension $n$ over the finite field of order $q$. The \emph{linear representation} of a point set $\mathcal{K}$ in a hyperplane at infinity of $\text{PG}(n,q)$ is the point-line…

Combinatorics · Mathematics 2021-12-24 Lins Denaux

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

Combinatorics · Mathematics 2017-05-04 Oliver Roche-Newton , Ilya D. Shkredov , Arne Winterhof

Let $q=p^\alpha$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof…

Combinatorics · Mathematics 2025-01-07 Gábor Hegedüs
‹ Prev 1 3 4 5 6 7 10 Next ›