اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدScaffoldings of Totally Positive Matrices and Line Insertion
111
0
0.0
(
0
)
تأليف
Karel Casteels
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Given a totally positive matrix, can one insert a line (row or column) between two given lines while maintaining total positivity? This question was first posed and solved by Johnson and Smith who gave an algorithm that results in one possible line insertion. In this work we revisit this problem. First we show that every totally positive matrix can be associated to a certain vertex-weighted graph in such a way that the entries of the matrix are equal to sums over certain paths in this graph. We call this graph a scaffolding of the matrix. We then use this to give a complete characterization of all possible line insertions as the strongly positive solutions to a given homogeneous system of linear equations.
قيم البحث
اقرأ أيضاً
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 tog
ether 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 characterization for all $TN_k$ matrices - more strongly, both of these characterizations use a single vector (with alternating signs) for each square submatrix. These characterizations are novel, and similar in spirit to the fundamental results characterizing $TP$ matrices by Gantmacher-Krein [Compos. Math. 1937] and $P$-matrices by Gale-Nikaido [Math. Ann. 1965]. As an application, we study the interval hull $mathbb{I}(A,B)$ of two $m times n$ matrices $A=(a_{ij})$ and $B = (b_{ij})$. This is the collection of $C in mathbb{R}^{m times n}$ such that each $c_{ij}$ is between $a_{ij}$ and $b_{ij}$. Using the sign non-reversal property, we identify a two-element subset of $mathbb{I}(A,B)$ that detects the $TP_k$ property for all of $mathbb{I}(A,B)$ for arbitrary $k geq 1$. In particular, this provides a test for total positivity (of any order), simultaneously for an entire class of rectangular matrices. In parallel, we also provide a finite set to test the total non-negativity (of any order) of an interval hull $mathbb{I}(A,B)$.
Given a nonnegative matrix $A$, can you find diagonal matrices $D_1,~D_2$ such that $D_1AD_2$ is doubly stochastic? The answer to this question is known as Sinkhorns theorem. It has been proved with a wide variety of methods, each presenting a variet
y of possible generalisations. Recently, generalisations such as to positive maps between matrix algebras have become more and more interesting for applications. This text gives a review of over 70 years of matrix scaling. The focus lies on the mathematical landscape surrounding the problem and its solution as well as the generalisation to positive maps and contains hardly any nontrivial unpublished results.
For any primitive matrix $Minmathbb{R}^{ntimes n}$ with positive diagonal entries, we prove the existence and uniqueness of a positive vector $mathbf{x}=(x_1,dots,x_n)^t$ such that $Mmathbf{x}=(frac{1}{x_1},dots,frac{1}{x_n})^t$. The contribution of
this note is to provide an alternative proof of a result of Brualdi et al. (1966) on the diagonal equivalence of a nonnegative matrix to a stochastic matrix.
The composition operators preserving total non-negativity and total positivity for various classes of kernels are classified, following three themes. Letting a function act by post composition on kernels with arbitrary domains, it is shown that such
a composition operator maps the set of totally non-negative kernels to itself if and only if the function is constant or linear, or just linear if it preserves total positivity. Symmetric kernels are also discussed, with a similar outcome. These classification results are a byproduct of two matrix-completion results and the second theme: an extension of A.M. Whitneys density theorem from finite domains to subsets of the real line. This extension is derived via a discrete convolution with modulated Gaussian kernels. The third theme consists of analyzing, with tools from harmonic analysis, the preservers of several families of totally non-negative and totally positive kernels with additional structure: continuous Hankel kernels on an interval, Polya frequency functions, and Polya frequency sequences. The rigid structure of post-composition transforms of totally positive kernels acting on infinite sets is obtained by combining several specialized situations settled in our present and earlier works.
Not every positive functional defined on bi-variate polynomials of a prescribed degree bound is represented by the integration against a positive measure. We isolate a couple of conditions filling this gap, either by restricting the class of polynomi
als to harmonic ones, or imposing the vanishing of a defect indicator. Both criteria offer constructive cubature formulas and they are obtained via well known matrix analysis techniques involving either the dilation of a contractive matrix to a unitary one or the specific structure of the Hessenberg matrix associated to the multiplier by the underlying complex variable.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
