English
Related papers

Related papers: Higgledy-piggledy subspaces and uniform subspace d…

200 papers

This work focuses on higgledy-piggledy sets of $k$-subspaces in $\text{PG}(N,q)$, i.e. sets of projective subspaces that are 'well-spread-out'. More precisely, the set of intersection points of these $k$-subspaces with any $(N-k)$-subspace…

Combinatorics · Mathematics 2022-08-03 Lins Denaux

We examine sets of lines in PG(d,F) meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least 1.5d lines if the field F has more than 1.5d elements, and at least 2d-1 lines if the field F is…

Combinatorics · Mathematics 2014-07-22 Szabolcs L. Fancsali , Péter Sziklai

Subspace designs are a (large) collection of high-dimensional subspaces $\{H_i\}$ of $\F_q^m$ such that for any low-dimensional subspace $W$, only a small number of subspaces from the collection have non-trivial intersection with $W$; more…

Computational Complexity · Computer Science 2017-04-21 Venkatesan Guruswami , Chaoping Xing , Chen Yuan

Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…

Combinatorics · Mathematics 2021-05-18 Tamás Héger , Zoltán Lóránt Nagy

A subspace arrangement in a vector space is a finite collection of vector subspaces. Similarly, a configuration of linear spaces in a projective space is a finite collection of linear subspaces. In this paper we study the degree 2 part of…

Algebraic Geometry · Mathematics 2009-10-07 E. Carlini , M. V. Catalisano , A. V. Geramita

This paper studies {\em strong blocking sets} in the $N$-dimensional finite projective space $\mathrm{PG}(N,q)$. We first show that certain unions of blocking sets cannot form strong blocking sets, which leads to a new lower bound on the…

Combinatorics · Mathematics 2024-02-13 Stefano Lia , Geertrui Van de Voorde

Let $P$ be a set of $n$ points in ${\mathbb R}^{d}$. A point $p \in P$ is $k$\emph{-shallow} if it lies in a halfspace which contains at most $k$ points of $P$ (including $p$). We show that if all points of $P$ are $k$-shallow, then $P$ can…

Computational Geometry · Computer Science 2013-12-24 Micha Sharir , Shai Zaban

A strong $s$-blocking set in a projective space is a set of points that intersects each codimension-$s$ subspace in a spanning set of the subspace. We present an explicit construction of such sets in a $(k - 1)$-dimensional projective space…

Combinatorics · Mathematics 2026-05-11 Anurag Bishnoi , István Tomon

We consider the general problem of matching a subspace to a signal in R^N that has been observed indirectly (compressed) through a random projection. We are interested in the case where the collection of K-dimensional subspaces is…

Information Theory · Computer Science 2014-07-22 William Mantzel , Justin Romberg

Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…

Combinatorics · Mathematics 2022-07-29 Benny Sudakov , István Tomon

In this paper, we investigate the Andr\'e/Bruck-Bose representation of certain $\mathbb{F}_q$-linear sets contained in a line of $\text{PG}(2,q^t)$. We show that scattered $\mathbb{F}_q$-linear sets of rank $3$ in $\text{PG}(1,q^3)$…

Combinatorics · Mathematics 2023-07-28 Lins Denaux , Jozefien D'haeseleer , Geertrui Van de Voorde

Various non-trivial spaces are becoming popular for embedding structured data such as graphs, texts, or images. Following spherical and hyperbolic spaces, more general product spaces have been proposed. However, searching for the best…

Machine Learning · Computer Science 2022-04-11 Kirill Shevkunov , Liudmila Prokhorenkova

The dimension of a linear space is the maximum positive integer $d$ such that any $d$ of its points generate a proper subspace. For a set $K$ of integers at least two, recall that a pairwise balanced design PBD$(v,K)$ is a linear space on…

Combinatorics · Mathematics 2014-01-08 Peter J. Dukes , Alan C. H. Ling

We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first identifies sets of points close to the same subspace and uses…

Machine Learning · Statistics 2014-11-03 Dohyung Park , Constantine Caramanis , Sujay Sanghavi

As a by-product of our work on super Pl\"{u}cker embedding, we came to the notion of a weighted projective superspace $P_{+1,-1}(V\oplus W)$ with weights $+1,-1$. The construction is not in itself super and makes sense in ordinary (purely…

Differential Geometry · Mathematics 2024-02-20 Ekaterina Shemyakova , Theodore Voronov

If $g$ is a map from a space $X$ into $\mathbb R^m$ and $q$ is an integer, let $B_{q,d,m}(g)$ be the set of all lines $\Pi^d\subset\mathbb R^m$ such that $|g^{-1}(\Pi^d)|\geq q$. Let also $\mathcal H(q,d,m,k)$ denote the maps $g\colon…

General Topology · Mathematics 2010-11-09 S. Bogataya , S. Bogatyi , V. Valov

Let $\mathcal{H}_i$ be a finite dimensional complex Hilbert space of dimension $d_i$ associated with a finite level quantum system $A_i$ for $i = i, 1,2, ..., k$. A subspace $S \subset \mathcal{H} = \mathcal{H}_{A_{1} A_{2}... A_{k}} =…

Quantum Physics · Physics 2007-05-23 K. R. Parthasarathy

Let $ H $ be a connected subgraph of a graph $ G $. The structure connectivity of $ G $, denoted by $ \kappa(G;H) $, is the minimum number of a set of connected subgraphs in $ G $, whose removal disconnects $ G $ and each element in the set…

Combinatorics · Mathematics 2023-11-21 Muhammed Türkmen , Canan Çiftçi , Gülnaz Boruzanlı Ekinci

Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…

Information Theory · Computer Science 2021-05-05 Anirban Ghatak , Sumanta Mukherjee

We prove that for any cubic polynomial of slice rank $r$, the intersection of all linear subspaces of minimal codimension contained in the corresponding hypersurface has codimension $\le r^2+\frac{(r+1)^2}{4}+r$ in the affine space. This is…

Algebraic Geometry · Mathematics 2022-06-22 Alexander Polishchuk , Chen Wang
‹ Prev 1 2 3 10 Next ›