The Koteljanskii inequalities for mixed matrices

Recently, a new class of matrices, called mixed matrices, that unifies the Z-matrices and symmetric matrices has been identified. They share the property that when the leading principal minors are positive, all principal minors are positive. It is natural to ask what other properties of M-matrices and positive definite matrices are enjoyed by mixed matrices as well. Here, we show that mixed P-matrices satisfy a broad family of determinantal inequalities, the Koteljanskii inequalities, previously known for those two classes. In the process, other properties of mixed matrices are developed, and consequences of the Koteljanskii inequalities are given.     

Interlacing properties of the eigenvalues of some matrix classes

We establish the eigenvalue interlacing property (i.e. the smallest real eigenvalue of a matrix is less than the smallest real eigenvalue of any of its principal submatrices) for the class of matrices introduced by Kotelyansky (all principal and almost principal minors of these matrices are positive). We show that certain generalizations of Kotelyansky and totally positive matrices possess this property. We also prove some interlacing inequalities for the other eigenvalues of Kotelyansky matrices.     

The lifting of determinantal prime ideals

The main results of this paper show that a perfect prime ideal generated by the maximal minors of a matrix has the equality between symbolic and ordinary powers if the ideals generated by the low order minors of the matrix have grade large enough and that any determinantal prime ideal of maximal minors with maximal grade of a matrix of homogenous forms whose 2-minors are homogeneous can be lifted to a prime determinantal ideal having the above equality. The author is partially supported by the National Basic Research Program     

REFINEMENTS OF THE FAN-TODD'S INEQUALITIES

Refinements to inequalities on inner product spaces are presented. In this respect, inequalities dealt with in this paper are: Cauchy's inequality, Bessel's inequality, Fan-Todd's inequality and Fan-Todd's determinantal inequality. In each case, a strictly increasing function is put forward, which lies between the smaller and the larger quantities of each inequality. As a result, an improved condition for equality of the Fan-Todd's determinantal inequality is deduced.     

REFINEMENTS OF THE FAN－TODD‘S INEQUALITIES

51. IntroductionIn recent years, refinements or interpolations have played an important role on severaltypes of inequalities with new results deduced as a consequence. Please refer to the papers[2, 8, 9, 12], etc. The aim of this paper is to furnish refinements of the Cauchy's and Bessel'sinequalties as shown in Section 2, and also refinements of the Fan-Todd's inequality and theFan-Todd's determinantal inequality in Sections 3 and 4, with an improved condition forequality derived.First of…     

Necessary conditions and a sufficient condition for the Fischer-Hadamard inequalities

It is well known that a matrix, all of whose principal minors are positive, satisfies the Fischer-Hadamard inequalities if and only if it is weakly sign symmetric. In this paper we consider the general case of matrices whose principal minors may be nonpositive. Necessary conditions and a sufficient condition for the Fischer-Hadamard inequalities to hold are given in the general case.     

Linear codes associated to skew-symmetric determinantal varieties

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given.     

Determinantal formulae for matrices with sparse inverses,II: asymmetric zero patterns

In an earlier paper, formulae for det A as a ratio of products of principal minors of A were exhibited, for any given symmetric zero-pattern of A⁻¹. These formulae may be presented in terms of a spanning tree of the intersection graph of certain index sets associated with the zero pattern of A⁻¹. However, just as the determinant of a diagonal and of a triangular matrix are both the product of the diagonal entries, the symmetry of the zero pattern is not essential for these formulae. We describe here how analogous formulae for det A may be obtained in the asymmetric-zero-pattern case by introducing a directed spanning tree. We also examine the converse question of determining all possible zero patterns of A⁻¹ which guarantee that a certain determinantal formula holds.     

Multivariable Lagrange Inversion, Gessel-Viennot Cancellation, and the Matrix Tree Theorem

A new form of multivariable Lagrange inversion is given, with determinants occurring on both sides of the equality. These determinants are principal minors, for complementary subsets of row and column indices, of two determinants that arise singly in the best known forms of multivariable Lagrange inversion. A combinatorial proof is given by considering functional digraphs, in which one of the principal minors is interpreted as a Matrix Tree determinant, and the other by a form of Gessel-Viennot cancellation.     

Extremal matrices in certain determinantal inequalities

The extremal matrices in certain inequalities for determinants of sums are characterized. Related determinantal inequalities involving Hadamard products of positive definite matrices are presented. These inequalities are easy consequences of majorization results recently obtained by Ando and Visick.     

Hilbert空间中的g-Bessel序列的一些等式与不等式(II)

Hilbert 空间中的g- 框架是框架的自然推广, 它们包含了许多推广的框架, 如子空间框架或fusion 框架、斜框架和拟框架等. 它们有许多与框架类似的性质, 但是并不是所有的性质都是相似的.例如, 无冗框架等价于Riesz 基, 但是无冗g- 框架不等价于g-Riesz 基. 一些作者将Hilbert 空间中的框架和对偶框架的等式和不等式推广到g- 框架和对偶g- 框架. 本文建立Hilbert 空间中的g-Bessel序列或g- 框架的一些新的等式和不等式. 本文还给出这些不等式的等号成立的充要条件. 这些结果推广和改进了由Balan, Casazza 和G?vruta 等得到的著名结果.     

Gorenstein Ladder Determinantal Rings

Ladder determinantal rings are rings associated with idealsof minors of certain subsets of a generic matrix of indeterminates.By results of Abhyankar, Narasimhan, Herzog and Trung, and Conca,they are known to be Cohen-Macaulay normal domains. In thispaper we characterize the Gorenstein property of ladder determinantalrings in terms of the shape of the ladder.     

The Gale transform and multi-graded determinantal schemes

Eisenbud and Popescu showed that certain finite determinantal subschemes of projective spaces defined by maximal minors of adjoint matrices of homogeneous linear forms are related by Veronese embeddings and a Gale transform. We extend this result to adjoint matrices of multihomogeneous multilinear forms. The subschemes now lie in products of projective spaces and the Veronese embeddings are replaced with Segre embeddings.     

The G-biliaison class of symmetric determinantal schemes

We consider a family of schemes, that are defined by minors of a homogeneous symmetric matrix with polynomial entries. We assume that they have maximal possible codimension, given the size of the matrix and of the minors that define them. We show that these schemes are G-bilinked to a linear variety of the same dimension. In particular, they can be obtained from a linear variety by a finite sequence of ascending G-biliaisons on some determinantal schemes. We describe the biliaisons explicitly in the proof of Theorem 2.3. In particular, it follows that these schemes are glicci.     

On alternative theorems and necessary conditions for efficiency

In this article, we establish theorems of the alternative for a system described by inequalities, equalities and a set inclusion, which are generalizations of Tucker's classical theorem of the alternative, and develop Kuhn–Tucker necessary conditions for efficiency to mathematical programs in normed linear spaces involving inequality, equality and set constraints with positive Lagrange multipliers of all the components of objective functions.     

Requiem for the Miller–Tucker–Zemlin subtour elimination constraints?

The Miller–Tucker–Zemlin (MTZ) Subtour Elimination Constraints (SECs) and the improved version by Desrochers and Laporte (DL) have been and are still in regular use to model a variety of routing problems. This paper presents a systematic way of deriving inequalities that are more complicated than the MTZ and DL inequalities and that, in a certain way, “generalize” the underlying idea of the original inequalities. We present a polyhedral approach that studies and analyses the convex hull of feasible sets for small dimensions. This approach allows us to generate generalizations of the MTZ and DL inequalities, which are “good” in the sense that they define facets of these small polyhedra. It is well known that DL inequalities imply a subset of Dantzig–Fulkerson–Johnson (DFJ) SECs for two-node subsets. Through the approach presented, we describe a generalization of these inequalities which imply DFJ SECs for three-node subsets and show that generalizations for larger subsets are unlikely to exist. Our study presents a similar analysis with generalizations of MTZ inequalities and their relation with the lifted circuit inequalities for three node subsets.     

Wasserstein geometry of porous medium equation

We study the porous medium equation with emphasis on q-Gaussian measures, which are generalizations of Gaussian measures by using power-law distribution. On the space of q-Gaussian measures, the porous medium equation is reduced to an ordinary differential equation for covariance matrix. We introduce a set of inequalities among functionals which gauge the difference between pairs of probability measures and are useful in the analysis of the porous medium equation. We show that any q-Gaussian measure provides a nontrivial pair attaining equality in these inequalities.     

Arithmetic-Geometric Mean determinantal identity

In this paper, we give a generalization of a determinantal identity posed by Charles R. Johnson about minors of a Toeplitz matrix satisfying a specific matrix identity. These minors are those appear in the Dodgson’s condensation formula.     

Arrangements of minors in the positive Grassmannian and a triangulation of the hypersimplex

The structure of zero and nonzero minors in the Grassmannian leads to rich combinatorics of matroids. In this paper, we investigate an even richer structure of possible equalities and inequalities between the minors in the positive Grassmannian. It was previously shown that arrangements of equal minors of largest value are in bijection with the simplices in a certain triangulation of the hypersimplex that was studied by Stanley, Sturmfels, Lam and Postnikov. Here, we investigate the entire set of arrangements and its relations with this triangulation. First, we show that second largest minors correspond to the facets of the simplices. We then introduce the notion of cubical distance on the dual graph of the triangulation and study its relations with the arrangement of t-th largest minors. Finally, we show that arrangements of largest minors induce a structure of a partially ordered set on the entire collection of minors. We use this triangulation of the hypersimplex to describe a two-dimensional grid structure on this poset.