Related papers: Path methods for strong shift equivalence of posit…
We consider path-connected sets of matrices and the induced paths between eigenvalues. We discuss the equivalence relation generated by these paths, and how it relates to the presence of higher multiplicity eigenvalues realized by the set.…
Positivstellensatz is a fundamental result in real algebraic geometry providing algebraic certificates for positivity of polynomials on semialgebraic sets. In this article Positivstellens\"atze for trace polynomials positive on…
A family of random matrices $\boldsymbol{X}^N=(X_1^N,\ldots,X_d^N)$ is said to converge strongly to a family of bounded operators $\boldsymbol{x}=(x_1,\ldots,x_d)$ when $\|P(\boldsymbol{X}^N,\boldsymbol{X}^{N*})\|\to\|P(\boldsymbol{x},…
Pattern recognition constitutes a particularly important task underlying a great deal of scientific and technologica activities. At the same time, pattern recognition involves several challenges, including the choice of features to…
In this paper, eventually totally positive matrices (i.e. matrices all whose powers starting with some point are totally positive) are studied. We present a new approach to eventual total positivity which is based on the theory of…
We resolve an algebraic version of Schoenberg's celebrated theorem [Duke Math.J., 1942] characterizing entrywise matrix transforms that preserve positive definiteness. Compared to the classical real and complex settings, we consider…
Motivated by recent applications in rough volatility and regularity structures, notably the notion of singular modelled distribution, we study paths, rough paths and related objects with a quantified singularity at zero. In a pure path…
We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices. We derive a characterization when the optimal convergence rate is attained. This characterization is given in terms of…
We prove pathwise nonuniqueness in the stochastic partial differential equations (SPDEs) for some one-dimensional super-Brownian motions with immigration. In contrast to a closely related case investigated by Mueller, Mytnik and Perkins…
Structural approximations to positive, but not completely positive maps are approximate physical realizations of these non-physical maps. They find applications in the design of direct entanglement detection methods. We show that many of…
We introduce a new family $\mathcal{A}_{n,k}$ of Schur positive symmetric functions, which are defined as sums over totally symmetric plane partitions. In the first part, we show that, for $k=1$, this family is equal to a multivariate…
We have witnessed rapid evolution of deep neural network architecture design in the past years. These latest progresses greatly facilitate the developments in various areas such as computer vision and natural language processing. However,…
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…
We introduce a notion of rough paths on embedded submanifolds and demonstrate that this class of rough paths is natural. On the way we develop a notion of rough integration and an efficient and intrinsic theory of rough differential…
Approximating the permanent of a complex-valued matrix is a fundamental problem with applications in Boson sampling and probabilistic inference. In this paper, we extend factor-graph-based methods for approximating the permanent of…
A linear map $\Phi$ between matrix spaces is called cross-positive if it is positive on orthogonal pairs $(U,V)$ of positive semidefinite matrices in the sense that $\langle U,V\rangle:=\text{Tr}(UV)=0$ implies $\langle…
We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
A multiparametric extension of the anisotropic U model is discussed which maintains integrability. The R-matrix solving the Yang-Baxter equation is obtained through a twisting construction applied to the underlying Uq(sl(2|1))…
A matrix $S=(s_{ij})\in{\mathbb R}^{n\times n}$ is said to determine a \emph{transitional measure} for a digraph $G$ on $n$ vertices if for all $i,j,k\in\{1,\...,n\},$ the \emph{transition inequality} $s_{ij} s_{jk}\le s_{ik} s_{jj}$ holds…