Results 1 to 10 of about 3,534,092 (344)

Noncommutative symmetric functions with matrix parameters [PDF]

Discrete Mathematics & Theoretical Computer Science, 2012
We define new families of noncommutative symmetric functions and quasi-symmetric functions depending on two matrices of parameters, and more generally on parameters associated with paths in a binary tree. Appropriate specializations of both matrices then
Alain Lascoux, Jean-Christophe Novelli, Jean-Yves Thibon   +2 more
doaj   +13 more sources

Cayley's hyperdeterminant, the principal minors of a symmetric matrix and the entropy region of 4 Gaussian random variables [PDF]

2008 46th Annual Allerton Conference on Communication, Control, and Computing, 2009
It has recently been shown that there is a connection between Cayley's hypdeterminant and the principal minors of a symmetric matrix. With an eye towards characterizing the entropy region of jointly Gaussian random variables, we obtain three new results ...
Hassibi, Babak, Shadbakht, Sormeh
core   +4 more sources

The orbit rigidity matrix of a symmetric framework [PDF]

Discrete & Computational Geometry, 2010
A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact.
A.L. Cauchy, B. Roth, B. Schulze, B. Schulze, B. Schulze, B. Schulze, B. Servatius, Bernd Schulze, C.S. Borcea, D.M. Bishop, E. Baker, E.D. Bolker, G. Laman, H. Crapo, H. Crapo, H. Stachel, H. Stachel, H. Stachel, J.E. Graver, L. Asimov, L.H. Hall, N. White, N. White, O. Bottema, P.W. Fowler, R. Bricard, R. Connelly, R. Connelly, R. Connelly, R. Connelly, R.D. Kangwai, R.D. Kangwai, S.D. Guest, S.D. Guest, T. Tarnai, V. Alexandrov, W. Whiteley, W. Whiteley, W. Whiteley, W. Whiteley, W. Whiteley, W. Whiteley, Walter Whiteley   +42 more
core   +4 more sources

Random matrix theory and symmetric spaces [PDF]

Physics Reports, 2004
In this review we discuss the relationship between random matrix theories and symmetric spaces. We show that the integration manifolds of random matrix theories, the eigenvalue distribution, and the Dyson and boundary indices characterizing the ensembles
't Hooft, Akemann, Akemann, Akemann, Akemann, Akemann, Akemann, Akemann, Altland, Altland, Banks, Baranger, Beenakker, Beenakker, Beenakker, Beenakker, Beenakker, Berezin, Blau, Boothby, Brezin, Brouwer, Brouwer, Brouwer, Brouwer, Brouwer, Brouwer, Brouwer, Büttiker, Calogero, Capello, Caselle, Caselle, Caselle, Caselle, Caselle, Chalker, Choquet-Bruhat, Cicuta, Damgaard, Damgaard, Dorokhov, Dorokhov, Duistermaat, Dyson, Dyson, Efetov, Feinberg, Feinberg, Forrester, Fulton, Fyodorov, Fyodorov, Fyodorov, Ginibre, Guhr, Halasz, Halasz, Halasz, Halasz, Hamermesh, Hatano, Helgason, Hua, Hüffmann, Itzykson, Jackson, Jalabert, Kanzieper, Kanzieper, Katori, Kazakov, Klein, Landauer, Langmann, M. Caselle, Ma, Macêdo, Magnea, Magnea, Markos, Mehta, Mehta, Mehta, Mehta, Mello, Mello, Mudry, Mudry, Muttalib, Muttalib, Nagao, Nagao, Nagao, Olshanetsky, Olshanetsky, Olshanetsky, Rusakov, Sattinger, Sener, Shuryak, Simons, Smilga, Sompolinsky, Stephanov, Sutherland, Sutherland, Titov, U. Magnea, Verbaarschot, Verbaarschot, Verbaarschot, Verbaarschot, Wettig, Wigner, Zirnbauer, Zirnbauer   +116 more
core   +4 more sources

The symmetric M-matrix and symmetric inverse M-matrix completion problems

Linear Algebra and its Applications, 2002
AbstractThe symmetric M-matrix and symmetric M0-matrix completion problems are solved and results of Johnson and Smith [Linear Algebra Appl. 290 (1999) 193] are extended to solve the symmetric inverse M-matrix completion problem: (1)A pattern (i.e., a list of positions in an n×n matrix) has symmetric M-completion (i.e., every partial symmetric M-matrix
Leslie Hogben
openalex   +5 more sources

Modeling Tree-like Heterophily on Symmetric Matrix Manifolds [PDF]

Entropy
Tree-like structures, characterized by hierarchical relationships and power-law distributions, are prevalent in a multitude of real-world networks, ranging from social networks to citation networks and protein–protein interaction networks.
Yang Wu, Liang Hu, Juncheng Hu
doaj   +2 more sources

Unitary equivalence to a complex symmetric matrix: an algorithm [PDF]

, 2008
We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested.
Tener, James E.
core   +4 more sources

Symmetric Linearizations for Matrix Polynomials [PDF]

SIAM Journal on Matrix Analysis and Applications, 2006
A standard way of treating the polynomial eigenvalue problem $P(\lambda)x = 0$ is to convert it into an equivalent matrix pencil—a process known as linearization. Two vector spaces of pencils $\mathbb{L}_1(P)$ and $\mathbb{L}_2(P)$, and their intersection $\mathbb{DL}(P)$, have recently been defined and studied by Mackey, Mackey, Mehl, and Mehrmann ...
Nicholas J. Higham, D. Steven Mackey, Niloufer Mackey, Françoise Tisseur   +3 more
openalex   +4 more sources

On the nonsingular symmetric factors of a real matrix

Linear Algebra and its Applications, 1974
AbstractFor a given real square matrix A this paper describes the following matrices: (∗) all nonsingular real symmetric (r.s.) matrices S such that A = S−1T for some symmetric matrix T.All the signatures (defined as the absolute value of the difference of the number of positive eigenvalues and the number of negative eigenvalues) possible for feasible ...
Frank Uhlig
openalex   +3 more sources

A complex associated with a symmetric matrix [PDF]

Kyoto Journal of Mathematics, 1977
Shirô Gotô, Sadao Tachibana
openalex   +3 more sources