English
Related papers

Related papers: Decompositions of matrices by using commutators

200 papers

The moduli space of rank-n commutative algebras equipped with an ordered basis is an affine scheme B_n of finite type over Z, with geometrically connected fibers. It is smooth if and only if n <= 3. It is reducible if n >= 8 (and the…

Algebraic Geometry · Mathematics 2017-04-03 Bjorn Poonen

We study a new notion of trace operators and trace spaces for abstract Hilbert complexes. We introduce trace spaces as quotient spaces/annihilators. We characterize the kernels and images of the related trace operators and discuss duality…

Functional Analysis · Mathematics 2022-03-02 Ralf Hiptmair , Dirk Pauly , Erick Schulz

We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…

Operator Algebras · Mathematics 2025-11-24 David P. Blecher

We treat 3-qubits states with maximally disordered subsystems, by using Hilbert-Schmidt decompositions.By using unfolding methods, the tensors are converted into matrices and by applying singular values decompositions to these matrices the…

Quantum Physics · Physics 2017-12-21 Y. Ben-Aryeh , A. Mann

Each bounded operator T on an infinite dimensional Hilbert space H is a sum of three operators that are similar to positive operators; two such operators are sufficient if T is not a compact perturbation of a scalar. The spectra of L\"uders…

Functional Analysis · Mathematics 2011-08-23 Bojan Magajna

The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…

Algebraic Geometry · Mathematics 2012-10-17 Alessandra Bernardi , Jerome Brachat , Pierre Comon , Bernard Mourrain

We prove that the space of vector fields on the boundary of a bounded domain with the Lipschitz boundary in three dimensions is decomposed into three subspaces: elements of the first one extend to the inside the domain as divergence-free…

Analysis of PDEs · Mathematics 2023-08-14 Shota Fukushima , Yong-Gwan Ji , Hyeonbae Kang

Lie-Trotter-Suzuki decompositions are an efficient way to approximate operator exponentials $\exp(t H)$ when $H$ is a sum of $n$ (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution…

Quantum Physics · Physics 2023-07-06 Thomas Barthel , Yikang Zhang

An example due to Pisier shows that two commuting, completely polynomially bounded Hilbert space operators may not be simultaneously similar to contractions. Thus, while each operator is individually similar to a contraction, the pair is…

Rings and Algebras · Mathematics 2018-06-26 Raphaël Clouâtre , Diarra Mbacke

Motivated by importance of operator spaces contained in the set of all scalar multiples of isometries ($MI$-spaces) in a separable Hilbert space for $C^*$-algebras and E-semigroups we exhibit more properties of such spaces. For example, if…

Operator Algebras · Mathematics 2008-05-23 Waclaw Szymanski

We define topologically semiperfect (complete, separated, right linear) topological rings and characterize them by equivalent conditions. We show that the endomorphism ring of a module, endowed with the finite topology, is topologically…

Rings and Algebras · Mathematics 2024-03-06 Leonid Positselski , Jan Stovicek

The problem of decomposition of bilinear forms which satisfy a certain condition has been studied by many authors by example in \cite{H08}: Let $H$ and $K$ be Hilbert spaces and let $A,C \in B(H),B,D\in B(K)$. Assume that $u:H\times Karrow…

Functional Analysis · Mathematics 2014-11-04 Mohamed ElMursi

Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…

Algebraic Geometry · Mathematics 2018-06-08 Gleb Pogudin , Agnes Szanto

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…

Commutative Algebra · Mathematics 2016-10-05 H. W. Lenstra , A. Silverberg

A complete determination of the prime ideals invariant under winding automorphisms in the generic 3 by 3 quantum matrix algebra is obtained. Explicit generating sets consisting of quantum minors are given for all of these primes, thus…

Quantum Algebra · Mathematics 2007-05-23 K. R. Goodearl , T. H. Lenagan

We consider a $Q$-polynomial distance-regular graph $\Gamma$ with vertex set $X$ and diameter $D \geq 3$. For $\mu, \nu \in \lbrace \downarrow, \uparrow \rbrace$ we define a direct sum decomposition of the standard module $V=\C X$, called…

Combinatorics · Mathematics 2007-10-25 Joohyung Kim

Comtrans algebras, arising in web geometry, have two trilinear operations, commutator and translator. We determine a Gr\"obner basis for the comtrans operad, and state a conjecture on its dimension formula. We study multilinear polynomial…

Rings and Algebras · Mathematics 2025-08-01 Murray R. Bremner , Hader A. Elgendy

In this work we present a framework for studying the eigenvalues of a family of matrices with a particular displacement structure. The family admits a specific decomposition as the product of an upper and a lower triangular matrices having…

Rings and Algebras · Mathematics 2018-09-03 Andrés A. Peters , Francisco J. Vargas

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

Combinatorics · Mathematics 2007-05-23 S. Gao , A. G. B. Lauder

We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…

Data Structures and Algorithms · Computer Science 2016-10-07 Tengyu Ma , Jonathan Shi , David Steurer
‹ Prev 1 4 5 6 7 8 10 Next ›