相关论文: How Bad Are Vandermonde Matrices?

Confinement is an intriguing phenomenon prevalent in condensed matter and high-energy physics. Exploring its effect on the far-from-equilibrium criticality of quantum many-body systems is of great interest both from a fundamental and…

For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…

We analyze the set of real and complex Hadamard matrices with additional symmetry constrains. In particular, we link the problem of existence of maximally entangled multipartite states of $2k$ subsystems with $d$ levels each to the set of…

We study the geometric and algebraic structure of Vandermonde cells, defined as images of the standard probability simplex under the Vandermonde map given by consecutive power sum polynomials. Motivated by their combinatorial equivalence to…

We study large random matrices with i.i.d. entries conditioned to have prescribed row and column sums (margins), a problem connected to relative entropy minimization, Schr\"odinger bridges, contingency tables, and random graphs with given…

This paper is concerned with quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices, which are generalizations of unbiased Hadamard matrices, equivalently unbiased bases. These matrices are studied from the viewpoint of…

The most basic structure of chiral conformal field theory (CFT) is the Verlinde ring. Freed-Hopkins-Teleman have expressed the Verlinde ring for the CFT's associated to loop groups, as twisted equivariant K-theory. We build on their work to…

Based on our previous work on an arithmetic analogue of Christol's theorem, this paper studies in more detail the structure of the lambda-ring $E_K = K \otimes W_{O_K}^a (O_{\bar{K}})$ of algebraic Witt vectors for number fields $K$. First…

We characterize the limiting fluctuations of traces of several independent Wigner matrices and deterministic matrices under mild conditions. A CLT holds but in general the families are not asymptotically free of second order and the…

We study factorization and dilation properties of Markov maps between von Neumann algebras equipped with normal faithful states, i.e., completely positive unital maps which preserve the given states and also intertwine their automorphism…

It was shown recently that the f-diagonal tensor in the T-SVD factorization must satisfy some special properties. Such f-diagonal tensors are called s-diagonal tensors. In this paper, we show that such a discussion can be extended to any…

We study an operation in matroid theory that allows one to transition a given matroid into another with more bases via relaxing a \emph{stressed subset}. This framework provides a new combinatorial characterization of the class of split…

In an underdetermined system of equations $Ax=y$, where $A$ is an $m\times n$ matrix, only $u$ of the entries of $y$ with $u < m$ are known. Thus $E_jw$, called `measurements', are known for certain $j\in J \subset \{0,1,\ldots,m-1\}$ where…

This paper studies the low-rank property of the inverse of a class of large-scale structured matrices in the tensor-train (TT) format, which is typically discretized from differential operators. An interesting question that we are concerned…

Within the nuclear DFT approach, we determined the magnetic dipole and electric quadrupole moments for paired nuclear states corresponding to the proton (neutron) quasiparticles blocked in the p11/2- (n13/2+) intruder configurations. We…

In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization. Current state-of-the-art algorithms that provide…

The Varchenko matrix is known to have a well-structured determinant for complexes of oriented matroids (COMs). COMs can be characterized as partial cubes that do not have certain forbidden pc-minors. In this work, we generalize the…

A random matrix is likely to be well conditioned, and motivated by this well known property we employ random matrix multipliers to advance some fundamental matrix computations. This includes numerical stabilization of Gaussian elimination…

The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast…

Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…