English
Related papers

Related papers: On subspaces defining linear sets of maximum rank

200 papers

Given $n+1$ unit vectors in $\mathbf{R}^n$ or $\mathbf{C}^n,$ consider the absolute values of the determinants of the vectors taken $n$ at a time. By taking a geometric perspective, we show that the minimum of these determinants is…

Metric Geometry · Mathematics 2016-08-23 Mark Fincher

A scheme $X\subset \PP^{n+c}$ of codimension $c$ is called {\em standard determinantal} if its homogeneous saturated ideal can be generated by the maximal minors of a homogeneous $t \times (t+c-1)$ matrix and $X$ is said to be {\em good…

Algebraic Geometry · Mathematics 2007-05-23 Jan O. Kleppe , Rosa M. Miro-Roig

Consider a random matrix $H:\mathbb{R}^n\longrightarrow\mathbb{R}^m$. Let $D\geq2$ and let $\{W_l\}_{l=1}^{p}$ be a set of $k$-dimensional affine subspaces of $\mathbb{R}^n$. We ask what is the probability that for all $1\leq l\leq p$ and…

Functional Analysis · Mathematics 2013-08-14 Alon Dmitriyuk , Yehoram Gordon

Two restricted $C[q,q^{-1}]-$forms of the well known q-boson algebra are introduced and the corresponding restricted q-Fock spaces defined. All of the irreducible highest weight representations, including the infinite dimensional ones, of…

Quantum Algebra · Mathematics 2009-10-31 Xufeng Liu , Changpu Sun

We study Schmidt rank for a vector (i.e., a pure state) and Schmidt number for a mixed state which are entanglement measures. We show that if a subspace of a certain bipartite system contains no vector of Schmidt rank $\leqslant k$, then…

Quantum Physics · Physics 2018-04-13 Priyabrata Bag , Santanu Dey

A projective linear code over $\mathbb{F}_q$ is called $\Delta$-divisible if all weights of its codewords are divisible by $\Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications…

Combinatorics · Mathematics 2019-12-24 Daniel Heinlein , Thomas Honold , Michael Kiermaier , Sascha Kurz , Alfred Wassermann

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…

Algebraic Geometry · Mathematics 2009-03-31 Sudhir R. Ghorpade , Arunkumar R. Patil , Harish K. Pillai

The construction approach proposed in the previous paper Ref. 1 allows us there and in the present paper to construct at generic deformation parameter $q$ all finite--dimensional representations of the quantum Lie superalgebra…

High Energy Physics - Theory · Physics 2009-10-28 Nguyen Anh Ky , N. Stoilova

Five-dimensional $\mathcal{N}=1$ theories with gauge group $U(N)$, $SU(N)$, $USp(2N)$ and $SO(N)$ are studied at large rank through localization on a large sphere. The phase diagram of theories with fundamental hypermultiplets is universal…

High Energy Physics - Theory · Physics 2021-07-19 Leonardo Santilli

Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…

Group Theory · Mathematics 2012-06-28 Mark Pankov

Let $Q$ be an ideal (downward-closed set) in the lattice of linear subspaces of $(\mathbb F_q)^n$, ordered by inclusion. For $0 \le k \le n$, let $\mu_k(Q)$ denote the fraction of $k$-dimensional subspaces that belong to $Q$. We show that…

Combinatorics · Mathematics 2019-10-03 Benjamin Rossman

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

A basic problem for the constant dimension subspace coding is to determine the maximal possible size A_q (n, d, k) of a set of k-dimensional subspaces in Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different…

Information Theory · Computer Science 2020-01-06 Hao Chen , Xianmang He , Jian Weng , Liqing Xu

A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…

Combinatorics · Mathematics 2023-12-20 Hiroshi Nozaki , Masashi Shinohara , Sho Suda

The subspace structure of Beidleman near-vector spaces is investigated. We characterise finite dimensional Beidleman near-vector spaces and we classify the R-subgroups of finite dimensional Beidleman near-vector spaces. We provide an…

Commutative Algebra · Mathematics 2018-10-18 P Djagba , K-T Howell

A vector space over a field $\mathbb{F}$ is a set $V$ together with two binary operations, called vector addition and scalar multiplication. It is standard practice to think of a Euclidean space $\mathbb{R}^n$ as an $n$-dimensional real…

Classical Analysis and ODEs · Mathematics 2013-07-29 Piyush Ahuja , Subiman Kundu

In this article we construct Weil representations of quasi-split unitary groups $U(n,n)(\mathbb{F}_{q^2}/\mathbb{F}_q)$ associated to quadratic extensions of finite fields. We define these representations by using an adequate presentation…

Representation Theory · Mathematics 2016-12-09 Luis Gutiérrez Frez , Andrea Vera-Gajardo

Let $F$ be a local field and $E/F$ be a separable extension of degree $n$. Regard $T=\text{Res}_{E/F} \mathbb{G}_m$ as an elliptic maximal torus of $G=\mathrm{GL}_n$. We can construct an admissible embedding of L-groups…

Representation Theory · Mathematics 2013-03-13 Geo Kam-Fai Tam

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

We consider the following problem: Given a point set in space find a largest subset that is in convex position and whose convex hull is empty. We show that the (decision version of the) problem is W[1]-hard.

Computational Geometry · Computer Science 2013-04-02 Panos Giannopoulos , Christian Knauer