Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On Absolute and Quantitative Subspace Theorems
View through CrossRef
Abstract
The Absolute Subspace Theorem, a vast generalization and a quantitative improvement of Schmidt’s Subspace Theorem, was first established by Evertse and Schlickewei and then strengthened remarkably by Evertse and Ferretti.
We study quantitative generalizations and extensions of subspace theorems in various contexts.
We establish a generalization of Evertse and Ferretti’s Absolute Subspace Theorem for hyperplanes in general position.
We obtain improved (non-absolute) Quantitative Subspace Theorems for hyperplanes in general position and in subgeneral position.
We show a Semi-quantitative Subspace Theorem for hyperplanes in non-subdegenerate position.
Title: On Absolute and Quantitative Subspace Theorems
Description:
Abstract
The Absolute Subspace Theorem, a vast generalization and a quantitative improvement of Schmidt’s Subspace Theorem, was first established by Evertse and Schlickewei and then strengthened remarkably by Evertse and Ferretti.
We study quantitative generalizations and extensions of subspace theorems in various contexts.
We establish a generalization of Evertse and Ferretti’s Absolute Subspace Theorem for hyperplanes in general position.
We obtain improved (non-absolute) Quantitative Subspace Theorems for hyperplanes in general position and in subgeneral position.
We show a Semi-quantitative Subspace Theorem for hyperplanes in non-subdegenerate position.
Related Results
On Subspace-recurrent Operators
On Subspace-recurrent Operators
In this article, subspace-recurrent operators are presented and it is showed that the set of subspace-transitive operators is a strict subset of the set of subspace-recurrent opera...
Optimization algorithm for omic data subspace clustering
Optimization algorithm for omic data subspace clustering
Subspace clustering identifies multiple feature subspaces embedded in a dataset together with the underlying sample clusters. When applied to omic data, subspace clustering is a ch...
Subspace Complexity Reduction in Direction-of-Arrival Estimation via the RASA Algorithm
Subspace Complexity Reduction in Direction-of-Arrival Estimation via the RASA Algorithm
The complexity and scale of contemporary datasets are increasing, making the need for reliable and effective subspace processing more pressing. In array signal processing, the qual...
Adaptive Subspace Detection of Spread Spectrum Signals With General Antenna Array Configuration
Adaptive Subspace Detection of Spread Spectrum Signals With General Antenna Array Configuration
Assume that a low probability of detection communication (LPD) system has a generally configured antenna array receiver, comprising a primary array with a high-gain beam and a refe...
A subspace based subspace inclusion graph on vector space
A subspace based subspace inclusion graph on vector space
Let $\mathscr{W}$ be a fixed $k$-dimensional subspace of an $n$-dimensi\-onal vector space $\mathscr{V}$ such that $n-k\geq1.$ In this paper, we introduce a graph structure, called...
Multi-view Unsupervised Feature Selection With Joint Multi-subspace Robust Learning
Multi-view Unsupervised Feature Selection With Joint Multi-subspace Robust Learning
Multi-view unsupervised feature selection aims to extract representative and discriminative features from multiple views to improve model performance on complex datasets. However, ...
Sequenced steering vector estimation for eigen-subspace projection robust adaptive beamformer
Sequenced steering vector estimation for eigen-subspace projection robust adaptive beamformer
Abstract
Eigen-subspace projection (ESP) is one of the most popular methods of robust adaptive beamforming, and the key issue of ESP is the selection of the projection subs...
A New Subspace Minimization Conjugate Gradient Algorithm Without Explicit Use of Gradient Terms
A New Subspace Minimization Conjugate Gradient Algorithm Without Explicit Use of Gradient Terms
Motivated by the Nazareth conjugate gradient method and the subspace minimization technique, we propose a new subspace minimization conjugate gradient algorithm that eliminates exp...