English
Related papers

Related papers: Almost orthogonal submatrices of an orthogonal mat…

200 papers

We prove that if a rectangular matrix with uniformly small entries and approximately orthogonal rows is applied to the independent standardized random variables with uniformly bounded third moments, then the empirical CDF of the resulting…

Probability · Mathematics 2007-06-14 Bernard Bercu , Wlodzimierz Bryc

The algebra of invariants of d-tuples of n x n skew-symmetric matrices under the action of the orthogonal group by simultaneous conjugation is considered over an infinite field of characteristic different from two. For n=3 and d>0 a minimal…

Representation Theory · Mathematics 2012-07-24 A. A. Lopatin

We consider the problem of designing optimal $M \times N$ ($M \leq N$) sensing matrices which minimize the maximum condition number of all the submatrices of $K$ columns. Such matrices minimize the worst-case estimation errors when only $K$…

Information Theory · Computer Science 2012-06-04 Hema Kumari Achanta , Soura Dasgupta , Weiyu Xu

Let $V$ be a vector space over a field $\mathbb F$ with scalar product given by a nondegenerate sesquilinear form whose matrix is diagonal in some basis. If $\mathbb F=\mathbb C$, then we give canonical matrices of isometric and selfadjoint…

Representation Theory · Mathematics 2019-11-13 Jonathan V. Caalim , Vyacheslav Futorny , Vladimir V. Sergeichuk , Yu-ichi Tanaka

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Discrete Mathematics · Computer Science 2015-03-12 Elisângela Silva Dias , Diane Castonguay , Mitre Costa Dourado

We consider low-rank reconstruction of a matrix using its columns and we present asymptotically optimal algorithms for both spectral norm and Frobenius norm reconstruction. The main tools we introduce to obtain our r esults are: (i) the use…

Data Structures and Algorithms · Computer Science 2015-03-19 Christos Boutsidis , Petros Drineas , Malik Magdon-Ismail

We develop a direct method to recover an orthoalgebra from its poset of Boolean subalgebras. For this a new notion of direction is introduced. Directions are also used to characterize in purely order-theoretic terms those posets that are…

Quantum Algebra · Mathematics 2020-08-31 John Harding , Chris Heunen , Bert Lindenhovius , Mirko Navara

A simple matrix is a (0,1)-matrix with no repeated columns. For a (0,1)-matrix $F$, we say that a (0,1)-matrix $A$ has $F$ as a configuration if there is a submatrix of $A$ which is a row and column permutation of $F$ (trace is the set…

Combinatorics · Mathematics 2013-07-05 R. P. Anstee , Christina L. Koch

The sum-product conjecture of Erd\H os and Szemer\'edi states that, given a finite set $A$ of positive numbers, one can find asymptotic lower bounds for $\max\{|A+A|,|A\cdot A|\}$ of the order of $|A|^{1+\delta}$ for every $\delta <1$. In…

Combinatorics · Mathematics 2013-05-07 J. A. Dias da Silva , Pedro J. Freitas

This paper is concerned with the low-rank approximation for large-scale nonsymmetric matrices. Inspired by the classical Nystrom method, which is a popular method to find the low-rank approximation for symmetric positive semidefinite…

Numerical Analysis · Mathematics 2024-10-30 Yatian Wang , Hua Xiang , Chi Zhang , Songling Zhang

In this article we prove that the union of two almost orthogonal planes in R4 is Almgren-minimal. This gives an example of a one parameter family of minimal cones, which is a phenomenon that does not exist in R3. This work is motivated by…

Classical Analysis and ODEs · Mathematics 2014-02-26 Xiangyu Liang

Characterizations of "almost associative" binary operations generating a minimal clone are given for two interpretations of the term "almost associative". One of them uses the associative spectrum, the other one uses the index of…

Rings and Algebras · Mathematics 2011-02-11 Tamás Waldhauser

Under certain hypothesises, we prove that a map which is an isometry for the Caratheodory infinitesimal metric at a point is an analytic isomorphism onto its image.

Functional Analysis · Mathematics 2007-09-19 Marco Abate , Jean-Pierre Vigue

Let $A \in {\cal C}^n$ be an extremal copositive matrix with unit diagonal. Then the minimal zeros of $A$ all have supports of cardinality two if and only if the elements of $A$ are all from the set $\{-1,0,1\}$. Thus the extremal…

Optimization and Control · Mathematics 2017-07-28 Roland Hildebrand

The orthogonality graph of an Okubo algebra with isotropic norm over an arbitrary field $\mathbb{F}$ is considered. Its connected components are described, and their diameters are computed. It is shown that there exist at most two shortest…

Rings and Algebras · Mathematics 2026-04-07 Danil Pavlinov , Svetlana Zhilina

We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…

Commutative Algebra · Mathematics 2009-09-01 Dragomir Z. Djokovic

We consider a 3-dimensional Riemannian manifold V with a metric g and an affinor structure q. The local coordinates of these tensors are circulant matrices. In V we define an almost conformal transformation. Using that definition we…

Differential Geometry · Mathematics 2011-06-15 Georgi Dzhelepov , Dimitar Razpopov , Iva Dokuzova

We introduce the notions of $\varepsilon$-approximate fixed point and weak $\varepsilon$-approximate fixed point. We show that for a group of unitary matrices even the existence of a nontrivial weak $\varepsilon$-approximate fixed point for…

Group Theory · Mathematics 2023-10-12 Bojan Kuzma , Mitja Mastnak , Heydar Radjavi , Matjaž Omladič

The notion of index for inclusions of von Neumann algebras goes back to a seminal work of Jones on subfactors of type ${I\!I}_1$. In the absence of a trace, one can still define the index of a conditional expectation associated to a…

Operator Algebras · Mathematics 2022-05-04 Luca Giorgetti

An oblivious subspace embedding (OSE), characterized by parameters $m,n,d,\epsilon,\delta$, is a random matrix $\Pi\in \mathbb{R}^{m\times n}$ such that for any $d$-dimensional subspace $T\subseteq \mathbb{R}^n$, $\Pr_\Pi[\forall x\in T,…

Data Structures and Algorithms · Computer Science 2021-12-22 Yi Li , Mingmou Liu