Sergey Fomin, Andrei Zelevinsky
An introduction to total positivity (TP), with the emphasis on efficient TP criteria and parametrizations of TP matrices. Intended for general mathematical audience.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
This is a brief and informal introduction to cluster algebras. It roughly follows the historical path of their discovery, made jointly with A.Zelevinsky. Total positivity serves as the main motivation.
We prove that checking if a partial matrix is partial totally positive is co-NP-complete. This contrasts with checking a conventional matrix for total positivity, for which we provide a cubic time algorithm. Checking partial sign regularity with any signature, including partial total nonnegativity, is also co-NP-complete. Finally, we prove that checking partial total positivity in a partial matrix with logarithmically many unspecified entries may be done in polynomial time.
We consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic). These matrices are totally nonnegative; more precisely, all their minors are formal power series in edge weights with nonnegative coefficients. A combinatorial explanation of this phenomenon involves loop-erased walks. Applications include total positivity of hitting matrices of Brownian motion in planar domains.
The following theorem is proved: Suppose $M = (a_{i,j})$ be a $k \times k$ matrix with positive entries and $a_{i,j}a_{i+1,j+1} > 4\cos ^2 \fracπ{k+1} a_{i,j+1}a_{i+1,j} \quad (1 \leq i \leq k-1, 1 \leq j \leq k-1).$ Then $\det M > 0 .$ The constant $4\cos ^2 \fracπ{k+1}$ in this Theorem is sharp. A few other results concerning totally positive and multiply positive matrices are obtained. Keywords: Multiply positive matrix; Totally positive matrix; Strictly totally positive matrix; Toeplitz matrix; Hankel matrix; Pólya frequency sequence.
Simple proofs of the Hermite-Biehler and Routh-Hurwitz theorems are presented. The total nonnegativity of the Hurwitz matrix of a stable real polynomial follows as an immediate corollary.
We prove that the only entrywise transforms of rectangular matrices which preserve total positivity or total non-negativity are either constant or linear. This follows from an extended classification of preservers of these two properties for matrices of fixed dimension. We also prove that the same assertions hold upon working only with symmetric matrices; for total-positivity preservers our proofs proceed through solving two totally positive completion problems.
The main aim of this paper is to establish a deep link between the totally nonnegative grassmannian and the quantum grassmannian. More precisely, under the assumption that the deformation parameter $q$ is transcendental, we show that "quantum positroids" are completely prime ideals in the quantum grassmannian $A$. As a consequence, we obtain that torus-invariant prime ideals in the quantum grassmannian are generated by polynormal sequences of quantum Plücker coordinates and give a combinatorial description of these generating sets. We also give a topological description of the poset of torus-i…
The matrix $S = [1+x_i y_j]_{i,j=1}^{n}, 0<x_1<\cdots<x_n,\, 0<y_1<\cdots<y_n$, has gained importance lately due to its role in powers preserving total nonnegativity. We give an explicit decomposition of $S$ in terms of elementary bidiagonal matrices, which is analogous to the Neville decomposition. We give a bidiagonal decomposition of $S^{\circ m}=[(1+x_iy_j)^m]$ for positive integers $1\leq m \leq n-1$. We also explore the total positivity of Hadamard powers of another important class of matrices called mean matrices.
Sufficient conditions for total positivity, compounds, and Dodgson condensation
本文研究 TP 与 TP_k 矩阵的第 r 复合矩阵及 Dodgson 压缩矩阵的全正性，给出一般否定结果，并证明 TP Hankel 矩阵的所有压缩矩阵均为 TP。
Semigroup automorphisms of total positivity
本文研究了全正和全非正矩阵半群的乘法自同构，证明其自同构相同且尊重乘法生成元。
A matrix $A$ is totally positive (or non-negative) of order $k$, denoted $TP_k$ (or $TN_k$), if all minors of size $\leq k$ are positive (or non-negative). It is well-known that such matrices are characterized by the variation diminishing property together with the sign non-reversal property. We do away with the former, and show that $A$ is $TP_k$ if and only if every submatrix formed from at most $k$ consecutive rows and columns has the sign non-reversal property. In fact this can be strengthened to only consider test vectors in $\mathbb{R}^k$ with alternating signs. We also show a similar ch…
In this paper, we build the unfolding approach from acyclic sign-skew-symmetric matrices of finite rank to skew-symmetric matrices of infinite rank, which can be regard as an improvement of that in the skew-symmetrizable case. Using this approach, we give a positive answer to the problem by Berenstein, Fomin and Zelevinsky in \cite{fz3} which asks whether an acyclic sign-skew-symmetric matrix is always totally sign-skew-symmetric. As applications, the positivity for cluster algebras in acyclic sign-skew-symmetric case is given; further, the $F$-polynomials of cluster algebras are proved to hav…
A matrix $A$ is called totally positive (or totally non-negative) of order $k$, denoted by TP_k (or TN_k), if all minors of size at most $k$ are positive (or non-negative). These matrices have featured in diverse areas in mathematics, including algebra, analysis, combinatorics, and probability theory. The goal of this article is to provide a novel connection between total positivity and optimization/game theory. Specifically, we draw a relationship between TP matrices and the Linear Complementarity Problem (LCP), which generalizes and unifies linear and quadratic programming problems and bimat…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。