Related papers: Strongly minimal self-conjugate linearizations for…
For a Hermitian matrix $H \in \mathbb C^{n,n}$ and symmetric matrices $S_0, S_1,\ldots,S_k \in \mathbb C^{n,n}$, we consider the problem of computing the supremum of $\left\{ \frac{v^*Hv}{v^*v}:~v\in \mathbb C^{n}\setminus…
We extend Hacon--M\textsuperscript{c}Kernan's rational chain connectedness theorem to the complex analytic setting. As a consequence, we prove that the fibers of any resolution of singularities of complex analytic kawamata log terminal…
We study the differential structure of the set of real logarithms of a non-singular real matrix, under the assumption that the matrix is either semi-simple or orthogonal.
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by parametrized polynomial matrix inequalities (PMI). These…
We consider the uniform approximation of the smallest eigenvalue of a large parameter-dependent Hermitian matrix by that of a smaller counterpart obtained through projections. The projection subspaces are constructed iteratively by means of…
We equip the complex polynomial algebra C[t] with the involution which is the identity on C and sends t to -t. Answering a question raised by V.G. Kac, we show that every hermitian or skew-hermitian matrix over this algebra is congruent to…
We present an algebraic construction of the orthogonal eigenfunctions of the supersymmetric extension of the rational Calogero-Moser-Sutherland model with harmonic confinement. These eigenfunctions are the superspace extension of the…
Rectified Linear Units (ReLUs) are among the most widely used activation function in a broad variety of tasks in vision. Recent theoretical results suggest that despite their excellent practical performance, in various cases, a substitution…
We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to…
This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…
The generic linear evolution of the density matrix of a system with a finite-dimensional state space is by stochastic maps which take a density matrix linearly into the set of density matrices. These dynamical stochastic maps form a linear…
We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…
It is an open question to determine if the theory of self-concordant barriers can provide an interior point method with strongly polynomial complexity in linear programming. In the special case of the logarithmic barrier, it was shown in…
A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner $k$-system (for $k \geq 2$) is a linear space such that each line has size exactly $k$. Clearly, as a two-sorted structure,…
We establish a linearization criterion for skew products of contractions in any dimension. We prove their smooth or holomorphic parameter dependence. In the smooth setting, we use the language of tame Fr\'echet spaces. We apply our result…
We show that even dimensional Fermat cubic hypersurfaces are rational over any field of characteristic different from three by producing explicit rational parametrizations given by polynomials of low degree. As a byproduct of our…
This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all feasible solutions have irrational entries, numerical…
One way of interpreting a left Kan extension is as taking a kind of "partial colimit", whereby one replaces parts of a diagram by their colimits. We make this intuition precise by means of the "partial evaluations" sitting in the so-called…
In this paper, a theory of realization and minimal factorization of rational matrix-valued functions which are $J$-unitary on the imaginary line or on the unit circle is extended to the setting of non-commutative rational formal power…