English
Related papers

Related papers: Realizable Lists on a Class of Nonnegative Matrice…

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

In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns),…

Machine Learning · Statistics 2014-04-07 Nicolas Gillis , Stephen A. Vavasis

We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…

Representation Theory · Mathematics 2017-03-22 Arvind Ayyer , Amritanshu Prasad , Steven Spallone

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

Rings and Algebras · Mathematics 2024-01-04 Benjamin J. Clark , Pietro Paparella

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

Group Theory · Mathematics 2024-09-18 Antonio Beltrán , Changguo Shao

An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…

Classical Analysis and ODEs · Mathematics 2025-07-01 Mikhail Tyaglov

Permutation invariant polynomial functions of matrices have previously been studied as the observables in matrix models invariant under $S_N$, the symmetric group of all permutations of $N$ objects. In this paper, the permutation invariant…

High Energy Physics - Theory · Physics 2022-08-24 George Barnes , Adrian Padellaro , Sanjaye Ramgoolam

The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…

Combinatorics · Mathematics 2020-02-17 James McKee , Chris Smyth

For semisimple Lie superalgebras over an algebraically closed field of characteristic zero, whose category of finite dimensional super representations is semisismple, we classify all irreducible super representations for which the…

Representation Theory · Mathematics 2010-02-24 T. Krämer , R. Weissauer

Let $K$ be a field, $R=K[x, y]$ the polynomial ring and $\mathcal{M}(K)$ the set of all pairs of square matrices of the same size over $K.$ Pairs $P_1=(A_1,B_1)$ and $P_2=(A_2,B_2)$ from $\mathcal{M}(K)$ are called similar if…

Representation Theory · Mathematics 2024-08-09 Vitaliy Bondarenko , Anatoliy Petravchuk , Maryna Styopochkina

We investigate the problem asking when any square matrix whose entries lie in a finite field of characteristic 2 is decomposable into the sum of a diagonalizable matrix and a nilpotent matrix with index of nilpotency at most 2 and, as a…

Rings and Algebras · Mathematics 2026-04-17 Peter Danchev , Esther García , Miguel Gómez Lozano

A linear map between real symmetric matrix spaces is positive if all positive semidefinite matrices are mapped to positive semidefinite ones. A real symmetric matrix is separable if it can be written as a summation of Kronecker products of…

Optimization and Control · Mathematics 2016-03-29 Jiawang Nie , Xinzhen Zhang

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

A group of order $p^n$ ($p$ prime) has an indecomposable polynomial invariant of degree at least $p^{n-1}$ if and only if the group has a cyclic subgroup of index at most $p$ or it is isomorphic to one of two particular groups of small…

Group Theory · Mathematics 2018-03-20 Kálmán Cziszter

For partially ordered sets $X$ we consider the square matrices $M^{X}$ with rows and columns indexed by linear extensions of the partial order on $X$. Each entry $\left( M^{X}\right)_{PQ}$ is a formal variable defined by a pedestal of the…

Combinatorics · Mathematics 2024-03-15 Richard Kenyon , Maxim Kontsevich , Oleg Ogievetsky , Cosmin Pohoata , Will Sawin , Senya Shlosman

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

Commutative Algebra · Mathematics 2023-10-24 Daniel Birmajer , Juan Gil , Michael Weiner

We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) $n\textrm{-by-}n$ matrix is $\Theta(n^{4/3})$ (resp. $\Theta(n^{3/2}$)). Relationships with point-line incidences in the plane, Bruhat order…

Combinatorics · Mathematics 2013-09-18 Miriam Farber , Mitchell Faulk , Charles R. Johnson , Evan Marzion

Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the…

Mathematical Physics · Physics 2009-11-30 Nicolas Orantin

A magic square of order n is an nxn square (matrix) whose entries are distinct nonnegative integers such that the sum of the numbers of any row and column is the same number, the magic constant. In this paper we introduce the concept of…

General Mathematics · Mathematics 2016-10-05 Giuliano G. La Guardia , Ana Lucia Pereira Baccon

A formal n-square is the set of positions in an square matrix of size n. A shuffle of a formal n-square consists of independent rotations of each row and of each column. A key result turns out to be valid at least for n <= 34 and n = 37:…

Combinatorics · Mathematics 2017-01-11 M. Van de Vel