Related papers: Minimal Presentation of $PSL(2,\mathbb{Z})$ Using …
The main content of this paper is Lectures 5 and 6 that continue lecture notes [20]. Content of Lectures 1-4 of [20] is reviewed for the reader's convenience in sections 1-4, respectively. It is shown in Lecture 5 how residual parts of the…
In the minimum common string partition (MCSP) problem two related input strings are given. "Related" refers to the property that both strings consist of the same set of letters appearing the same number of times in each of the two strings.…
Permutation matrices play a key role in matching and assignment problems across the fields, especially in computer vision and robotics. However, memory for explicitly representing permutation matrices grows quadratically with the size of…
We present a minimal pole method for analytically continuing matrix-valued imaginary frequency correlation functions to the real axis, enabling precise access to off-diagonal elements and thus improving the interpretation of self-energies…
We introduce and study the problem of consistent low-rank approximation, in which rows of an input matrix $\mathbf{A}\in\mathbb{R}^{n\times d}$ arrive sequentially and the goal is to provide a sequence of subspaces that well-approximate the…
We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…
A minimal presentation of the cohomology ring of the flag manifold $GL_n/B$ was given in [A. Borel, 1953]. This presentation was extended by [E. Akyildiz-A. Lascoux-P. Pragacz, 1992] to a non-minimal one for all Schubert varieties. Work of…
The main objective of the present paper is to introduce and study the function $_pR_q(A, B; z)$ with matrix parameters and investigate the convergence of this matrix function. The contiguous matrix function relations, differential formulas…
A well-known result on Lie Theory states that every finite-dimensional complex solvable Lie algebra can be represented as a matrix Lie algebra, with upper-triangular square matrices as elements. However, this result does not specify which…
Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem of low-rank matrix completion, this method is believed to…
A constrained L1 minimization method is proposed for estimating a sparse inverse covariance matrix based on a sample of $n$ iid $p$-variate random variables. The resulting estimator is shown to enjoy a number of desirable properties. In…
We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive polynomial remainder sequence (PRS) which has been introduced by the author. The reduced nested subresultant reduces the…
The objective of the matrix selection problem is to select a submatrix $A_{S}\in \mathbb{R}^{n\times k}$ from $A\in \mathbb{R}^{n\times m}$ such that its minimum singular value is maximized. In this paper, we employ the interlacing…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
We show that spectral problems for periodic operators on lattices with embedded defects of lower dimensions can be solved with the help of matrix-valued integral continued fractions. While these continued fractions are usual in the…
We introduce and study Minimum Cut Representability, a framework to solve optimization and feasibility problems over stable matchings by representing them as minimum s-t cut problems on digraphs over rotations. We provide necessary and…
We study a minimum problem and associated maximum problem for finite, complex, self-adjoint Toeplitz matrices. If $A$ is such a matrix, of size $(N+1)$-by-$(N+1)$, we identify $A$ with the operator it represents on $P_N$, the space of…
Trellises provide a graphical representation for the row space of a matrix. The product construction of Kschischang and Sorokine builds minimal conventional trellises from matrices in minimal span form. Koetter and Vardy showed that minimal…
Using techniques developed in [Lasserre02], we show that some minimum cardinality problems subject to linear inequalities can be represented as finite sequences of semidefinite programs. In particular, we provide a semidefinite…
The lower spectral radius, or joint spectral subradius, of a set of real $d \times d$ matrices is defined to be the smallest possible exponential growth rate of long products of matrices drawn from that set. The lower spectral radius arises…