Related papers: Index of a matrix, complex logarithms, and multidi…
We present a new, explicit sum formula for symmetric Macdonald polynomials $P_\lambda$ and show that they can be written as a trace over a product of (infinite dimensional) matrices. These matrices satisfy the Zamolodchikov--Faddeev (ZF)…
Let G be a piecewise constant $n\times n$ matrix function which is defined on a smooth closed curve $\Gamma$ in the complex sphere and which has m jumps. We consider the problem of determining the partial indices of the factorization of the…
We obtain tight lower bounds for the trace norm $\Vert \cdot \Vert_1$ of some matrices with diagonal zero, in terms of the entry-wise $L^1$-norm (denoted by $\Vert \cdot \Vert_{(1)}$). It is shown that on the space of nonzero real symmetric…
Single index model is a powerful yet simple model, widely used in statistics, machine learning, and other scientific fields. It models the regression function as $g(<a,x>)$, where a is an unknown index vector and x are the features. This…
In the present note we consider a type of matrices stemming in the context of the numerical approximation of distributed order fractional differential equations (FDEs): from one side they could look standard, since they are, real, symmetric…
Matrix completion is a classical problem that has received recurring interest across a wide range of fields. In this paper, we revisit this problem in an ultra-sparse sampling regime, where each entry of an unknown, $n\times d$ matrix $M$…
In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…
We provide the explicit formula for the numerical index of any $2$-dimensional Lipschitz-free space, also giving the construction of operators attaining this value as its numerical radius. As a consequence, the numerical index of…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
We consider the problem of efficiently solving large-scale linear least squares problems that have one or more linear constraints that must be satisfied exactly. Whilst some classical approaches are theoretically well founded, they can face…
Many modern multiclass and multilabel problems are characterized by increasingly large output spaces. For these problems, label embeddings have been shown to be a useful primitive that can improve computational and statistical efficiency.…
Many problems in computer science and applied mathematics require rounding a vector $\mathbf{w}$ of fractional values lying in the interval $[0,1]$ to a binary vector $\mathbf{x}$ so that, for a given matrix $\mathbf{A}$,…
Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…
Eigenvalue interlacing is a useful tool in linear algebra and spectral analysis. In its simplest form, the interlacing inequality states that a rank-one positive perturbation shifts each eigenvalue up, but not further than the next…
For integer partitions $\lambda :n=a_1+...+a_k$, where $a_1\ge a_2\ge >...\ge a_k\ge 1$, we study the sum $a_1+a_3+...$ of the parts of odd index. We show that the average of this sum, over all partitions $\lambda$ of $n$, is of the form…
In this paper, we explicitly express the local Maslov index by a Maslov index in finite dimensional case without symplectic reduction. Then we calculate the Maslov index for the path of pairs of Lagrangian subspaces in triangular form. In…
The paper is devoted to multidimensional $(0,1)$-matrices extremal with respect to containing a polydiagonal (a fractional generalization of a diagonal). Every extremal matrix is a threshold matrix, i.e., an entry belongs to its support…
We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
Computing the eigenvectors and eigenvalues of a perturbed matrix can be remarkably difficult when the unperturbed matrix has repeated eigenvalues. In this work we show how the limiting eigenvectors and eigenvalues of a symmetric matrix…