English
Related papers

Related papers: Decomposable Subspaces, Linear Sections of Grassma…

200 papers

We study the decomposability and the subdifferential of the tensor nuclear norm. Both concepts are well understood and widely applied in matrices but remain unclear for higher-order tensors. We show that the tensor nuclear norm admits a…

Optimization and Control · Mathematics 2026-03-17 Jiewen Guan , Bo Jiang , Zhening Li

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

Algebraic Geometry · Mathematics 2022-08-19 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

We initiate a study of varieties of minimal degree in weighted projective spaces. We call a weighted projective space $\mathbf{P}(w_0,\dots,w_n)$ divisible if $w_i \mid w_{i+1}$ for all $i$. We provide sharp bounds for when a non-degenerate…

Commutative Algebra · Mathematics 2026-04-21 Maya Banks , Ritvik Ramkumar

The Grassmannian, which is the manifold of all $k$-dimensional subspaces in the Euclidean space $\mathbb{R}^n$, was decomposed through three equivalent methods connecting combinatorial geometries, Schubert cells and convex polyhedra by…

Combinatorics · Mathematics 2025-06-11 Houshan Fu , Weikang Liang , Suijie Wang

In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…

Information Theory · Computer Science 2021-04-09 Xina Zhang

A new construction for constant weight codes is presented. The codes are constructed from $k$-dimensional subspaces of the vector space $\F_q^n$. These subspaces form a constant dimension code in the Grassmannian space $\cG_q(n,k)$. Some of…

Information Theory · Computer Science 2015-03-14 Tuvi Etzion , Alexander Vardy

Decomposing an algebraic variety into irreducible or equidimensional components is a fundamental task in classical algebraic geometry and has various applications in modern geometry engineering. Several researchers studied the problem and…

Commutative Algebra · Mathematics 2010-12-07 Zhenyi Ji , Yongbin Li

Starting from vector fields that preserve a differential form on a Riemann sphere with Grassmann variables, one can construct a Superconformal Algebra by considering central extensions of the algebra of vector fields. In this note, the N=4…

High Energy Physics - Theory · Physics 2009-11-10 Jasbir Nagi

Let ${\mathbb F}$ be a (not necessarily finite) field. A subspace of the vector space ${\mathbb F}^n$ is called {\it non-degenerate} if it is not contained in a coordinate hyperplane. We show that the Grassmann graph of $k$-dimensional…

Combinatorics · Mathematics 2026-01-08 Mark Pankov

We resolve a basic problem on subspace distances that often arises in applications: How can the usual Grassmann distance between equidimensional subspaces be extended to subspaces of different dimensions? We show that a natural solution is…

Numerical Analysis · Mathematics 2016-06-17 Ke Ye , Lek-Heng Lim

We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are…

Information Theory · Computer Science 2018-01-30 Mrinmoy Datta , Sudhir R. Ghorpade

In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…

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

We study the maximum likelihood degree of linear concentration models in algebraic statistics. We relate the geometry of the reciprocal variety to that of semidefinite programming. We show that the Zariski closure in the Grassmanian of the…

Algebraic Geometry · Mathematics 2020-12-02 Kathlen Kohn , Rosa Winter , Yuhan Jiang

We establish an upper bound on the number of real multiquadratic fields that admit a universal quadratic lattice of a given rank, or contain a given amount of indecomposable elements modulo totally positive units, obtaining density zero…

Number Theory · Mathematics 2024-05-08 Siu Hang Man

In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…

Information Theory · Computer Science 2020-09-11 Dabin Zheng , Qing Zhao , Xiaoqiang Wang , Yan Zhang

We restrict a degenerate quadratic form $f$ over a finite field of odd characteristic to subspaces. Thus, a quotient space related to $f$ is introduced. Then we get a non-degenerate quadratic form induced by $f$ over the quotient space.…

Information Theory · Computer Science 2022-06-17 Fei Li , Xiumei Li

We study preconditioning techniques for discontinuous Galerkin discretizations of isotropic linear elasticity problems in primal (displacement) formulation. We propose subspace correction methods based on a splitting of the vector valued…

Numerical Analysis · Mathematics 2011-11-01 Blanca Ayuso de Dios , Ivan Georgiev , Johannes Kraus , Ludmil Zikatanov

In this paper, a lemma in algebraic coding theory is established, which is frequently appeared in the encoding and decoding for algebraic codes such as Reed-Solomon codes and algebraic geometry codes. This lemma states that two vector…

Information Theory · Computer Science 2012-08-28 Hajime Matsui

We prove that there exists uncountably many pairwise disjoint open subsets of the Gelfand space of the measure algebra on any locally compact non-discrete abelian group which shows that this space is not separable (in fact, we prove this…

Functional Analysis · Mathematics 2017-05-17 P. Ohrysko , M. Wojciechowski , Colin C. Graham

The problem of error-control in random linear network coding is considered. A ``noncoherent'' or ``channel oblivious'' model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer…

Information Theory · Computer Science 2008-03-25 Ralf Koetter , Frank Kschischang
‹ Prev 1 3 4 5 6 7 10 Next ›