نتایج جستجو برای: low rank

تعداد نتایج: 1260992  

2001
Cornelia DRUŢU

We prove that the filling order is quadratic for a large class of solvable groups and asymptotically quadratic for all Q-rank one lattices in semisimple groups of R-rank at least 3. As a byproduct of auxiliary results we give a shorter proof of the theorem on the nondistorsion of horospheres providing also an estimate of a nondistorsion

2015
Bo JIANG Shuzhong ZHANG

In this paper, we propose three new tensor decompositions for even-order tensors corresponding respectively to the rank-one decompositions of some unfolded matrices. Consequently such new decompositions lead to three new notions of (even-order) tensor ranks, to be called the M-rank, the symmetric M-rank, and the strongly symmetric M-rank in this paper. We discuss the bounds between these new te...

Journal: :IEEE Journal of Selected Topics in Signal Processing 2016

2008
Elena Rubei

Let M be a tropical matrix (k + x) × (k + x ′) for some k, x , x ′ ∈ N − {0} with tropical rank k. We show that Kapranov rank is k too if x and x ′ are not too big; namely if we are in one of the following cases: a) k ≥ 6 and x , x ′ ≤ 2 b) k = 4, 5, x ≤ 2 and x ′ ≤ 3 (or obviuosly the converse, that is x ≤ 3 and x ′ ≤ 2) c) k = 3 and either x , x ′ ≤ 3 or x ≤ 2 and x ′ ≤ 4 (or obviuosly the co...

Journal: :Arch. Math. Log. 2015
Juan Felipe Carmona

We prove that a simple geometric theory of SU-rank 1 is n-ample if and only if the associated theory equipped with an predicate for an independent dense subset is n-ample for n at least 2.

2011
JOHN RHODES

We explore the size of the largest (permuted) triangular submatrix of a random matrix, and more precisely its asymptotical behavior as the size of the ambient matrix tends to infinity. The importance of such permuted triangular submatrices arises when dealing with certain combinatorial algebraic settings in which these submatrices determine the rank of the ambient matrix, and thus attract a spe...

Journal: :CoRR 2010
Guangcan Liu Ju Sun Shuicheng Yan

In real applications, our observations are often noisy, or even grossly corrupted, and some observations may be missing. This fact naturally leads to the problem of recovering a low-rank matrix X from a corrupted observation matrix X = X + E (each column of X is an observation vector), with E being the unknown noise. Due to the low-rank property of X, it is straightforward to consider the follo...

2016
Ivan A. BIZYAEV Alexey V. BORISOV Ivan S. MAMAEV

In this paper, using the Hojman construction, we give examples of various Poisson brackets which differ from those which are usually analyzed in Hamiltonian mechanics. They possess a nonmaximal rank, and in the general case an invariant measure and Casimir functions can be globally absent for them.

2002
Younes Chahlaoui Paul Van Dooren

In this paper we present a Smith-like updating technique to estimate a low rank approximation of the Gramians of a time-varying system. We obtain error estimates of our approximation and also explain how to use this for model reduction of time-varying systems.

2010
ITAY KAPLAN

The main result is the prove of the linearity of the dp-rank. We also prove that the study of theories of finite dp-rank cannot be reduced to the study of its dp-minimal types and discuss the possible relations between dp-rank and VC-density.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید