相关论文: Extensions of some matrix inequalities related to …

Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

We give upper bounds for the determinant of an $n\times n$ zero-one matrix containing $kn$ ones for integral $k$. Our results improve upon a result of Ryser for $k=o(n^{1/3})$. For fixed $k\ge 3$ it was an open question whether Hadamard's…

Let $T_n^d(A)$ denote a partial upper triangular operator matrix whose diagonal entries are given and the others unknown. In this article we have aim to find characterizations of (left,right) invertibility of $T_n^d(A)$ in terms of diagonal…

We consider a system of differential equations and obtain its solutions with exponential asymptotics and analyticity with respect to the spectral parameter. Solutions of such type have importance in studying spectral properties of…

Recently it was shown that if a given state fulfils the reduction criterion it must also satisfy the known entropic inequalities. Now the questions arises whether on the assumption that stronger criteria based on positive but not completely…

We study the trace class perturbations of the half-line, discrete Laplacian and obtain a new bound for the perturbation determinant of the corresponding non-self-adjoint Jacobi operator. Based on this bound, we obtain the Lieb--Thirring…

In Linear Algebra over finite fields, a characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold…

A sequence of approximations for the determinant and its logarithm of a complex matrixis derived, along with relative error bounds. The determinant approximations are derived from expansions of det(X)=exp(trace(log(X))), and they apply to…

New identity similar to an identity of [13] for fractional integrals have been defined. Then making use of this identity, some new Ostrowski type inequalities for Riemann-Liouville fractional integral have been developed. Our results have…

Algebras generated by strictly positive matrices are described up to similarity, including the commutative, simple, and semisimple cases. We provide sufficient conditions for some block diagonal matrix algebras to be generated by a set of…

We present a new improvement on the laser method for designing fast matrix multiplication algorithms. The new method further develops the recent advances by [Duan, Wu, Zhou FOCS 2023] and [Vassilevska Williams, Xu, Xu, Zhou SODA 2024].…

We give a new proof of a determinant evaluation due to Andrews, which has been used to enumerate cyclically symmetric and descending plane partitions. We also prove some related results, including a q-analogue of Andrews's determinant.

We show new upper bounds for permanents and hafnians, which are particularly useful for complex matrices. Multidimensional permanents and hyperhafnians are considered as well. The permanental bounds improve on a Hadamard type inequality of…

We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…

In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…

We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…

Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…

Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…

By analyzing an optimization problem over orthogonal matrices, we prove a generalization of the Hardy-Littlewood-P\'olya rearrangement inequality to positive definite matrices. The inequality is then extended to rectangular matrices. Using…