English
Related papers

Related papers: On a matrix equality involving partial transpositi…

200 papers

Let $\bold G$ be a reductive algebraic group defined over $\Q$, and let $\Gamma$ be an arithmetic subgroup of $\bold G(\Q)$. Let $X$ be the symmetric space for $\bold G(\R)$, and assume $X$ is contractible. Then the cohomology (mod torsion)…

Representation Theory · Mathematics 2016-09-06 Avner Ash , Mark W. McConnell

We define and study fractional versions of the well-known Gamma subordinator $\Gamma :=\{\Gamma (t),$ $t\geq 0\},$ which are obtained by time-changing $% \Gamma $ by means of an independent stable subordinator or its inverse. Their…

Probability · Mathematics 2013-05-09 Luisa Beghin

We calculate the branching ratios of $B_{s,d}\to \gamma \gamma$ decay in the sequential fourth generation model. We find that the theoretical values of the branching ratios, ${\rm BR}(B_{s}\to\gamma\gamma)$, including the contributions of…

High Energy Physics - Phenomenology · Physics 2007-05-23 W. J. Huo , C. D. Lu , Z. J. Xiao

It is well-known that $AB$ and $BA$ are similar when $A$ and $B$ are complex square Hermitian matrices. In this note we answer a question of F. Zhang by demonstrating that similarity can fail if $A$ is Hermitian and $B$ is normal. Perhaps…

Functional Analysis · Mathematics 2021-02-05 Stephan Ramon Garcia , David Sherman , Gary Weiss

We prove that a C$^*$-algebra $A$ has uniform property $\Gamma$ if the set of extremal tracial states, $\partial_e T(A)$, is a non-empty compact space of finite covering dimension and for each $\tau \in \partial_e T(A)$, the von Neumann…

Operator Algebras · Mathematics 2024-11-27 Samuel Evington , Christopher Schafhauser

A well-known fact in linear algebra is that $A^T A$ is always positive semi-definite for any real matrix $A$. We consider a generalization of this fact via the following decision problem. Given a symbolic product of length $k$, consisting…

Combinatorics · Mathematics 2026-05-05 Frederik Garbe , Fan Wei

Some recent papers formulated sufficient conditions for the decomposition of matrix variances. A statement was that if we have one or two observables, then the decomposition is possible. In this paper we consider an arbitrary finite set of…

Functional Analysis · Mathematics 2015-04-24 Dénes Petz , Dániel Virosztek

We propose a novel approach to estimating the precision matrix of multivariate Gaussian data that relies on decomposing them into a low-rank and a diagonal component. Such decompositions are very popular for modeling large covariance…

Methodology · Statistics 2022-08-18 Noirrit Kiran Chandra , Peter Mueller , Abhra Sarkar

The general expression with the physical significance and positive definite condition of the eigenvalues of $4\times 4$ Hermitian and trace-one matrix are obtained. This implies that the eigenvalue problem of the $4\times 4$ density matrix…

Quantum Physics · Physics 2007-05-23 An Min Wang

We present matrices as graded BiHom-algebras and consider various characteristics of their decompositions. Specifically, we introduce a notion of connection in the support of the grading and use it to construct a family of canonical graded…

Rings and Algebras · Mathematics 2025-05-06 Jiacheng Sun , Shuanhong Wang , Haoran Zhu

A status report on the theory and phenomenology of rare radiative $B$ decays in the standard model is presented with emphasis on the measured decays $B \to X_s \gamma$ and $B \to K^* \gamma$. Standard model is in agreement with experiments…

High Energy Physics - Phenomenology · Physics 2007-05-23 Ahmed Ali

In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…

Functional Analysis · Mathematics 2021-12-01 Theophilus Agama

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

Combinatorics · Mathematics 2014-03-18 Alexander L. Gavrilyuk , Jack H. Koolen

We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following…

Combinatorics · Mathematics 2024-02-05 Wen-ling Huang , Hans Havlicek

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D,b,\alpha,\beta)$ and $b\not=1$, $\alpha=b-1$. The condition on $\alpha$ implies that $\Gamma$ is formally self-dual. For $b=q^2$ we use the adjacency matrix and dual…

Combinatorics · Mathematics 2007-05-23 Tatsuro Ito , Paul Terwilliger

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

Numerical Analysis · Mathematics 2014-05-16 John T. Holodnak , Ilse C. F. Ipsen

Gardner conjectured that if two bounded measurable sets $A,B \subset \mathbb{R}^n$ are equidecomposable by a set of isometries $\Gamma$ generating an amenable group then $A$ and $B$ admit a measurable equidecomposition by all isometries.…

Metric Geometry · Mathematics 2021-09-03 Gabor Kun

In this note, we define a Gaussian probability distribution over matrices. We prove some useful properties of this distribution, namely, the fact that marginalization, conditioning, and affine transformations preserve the matrix Gaussian…

Probability · Mathematics 2018-06-22 Shane Barratt

We investigate the distillability problem in quantum information in $\bbC^d\ox\bbC^d$. A special case of the problem has been reduced to proving a matrix inequality when $d=4$. We investigate the inequality for two families of non-normal…

Quantum Physics · Physics 2018-08-29 Yi Shen , Lin Chen

Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is…

Computational Complexity · Computer Science 2014-04-11 Moritz Hardt , Raghu Meka , Prasad Raghavendra , Benjamin Weitz