Related papers: Estimation to structured distances to singularity …
A characterization of the structure of a regular matrix pencil obtained by a bounded rank perturbation of another regular matrix pencil has been recently obtained. The result generalizes the solution for the bounded rank perturbation…
We study the singularity probability of n*n random matrices with i.i.d. entries from highly biased discrete distributions. We obtain sharp non-asymptotic bounds for this probability and derive estimates on the least singular values. Our…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…
We will study algebraic hyper-surfaces on the real unit sphere $\mathcal S^{n-1}$ given by an homogeneous polynomial of degree d in n variables with the view point, rarely exploited, of Euclidian geometry using Bombieri's scalar product and…
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.
Random matrix ensembles with orthogonal and unitary symmetry correspond to the cases of real symmetric and Hermitian random matrices respectively. We show that the probability density function for the corresponding spacings between…
We prove that if $f\colon X\to Y$ is a closed surjective map between metric spaces such that every fiber $f^{-1}(y)$ belongs to a class of space $\mathrm S$, then there exists an $F_\sigma$-set $A\subset X$ such that $A\in\mathrm S$ and…
A formalism of arithmetic partial differential equations (PDEs) is being developed in which one considers several arithmetic differentiations at one fixed prime. In this theory solutions can be defined in algebraically closed p-adic fields.…
This paper is concerned with the reduction of the spectral problem for symmetric linear operator pencils to a spectral problem for the single operator. Also, a Rayleigh-Ritz-like bounds on eigenvalues of linear operator pencils are…
The seminal work by Mackey et al. in 2006 (reference [21] of the article) introduced vector spaces of matrix pencils, with the property that almost all the pencils in the spaces are strong linearizations of a given square regular matrix…
We provide a computational framework for approximating a class of structured matrices; here, the term structure is very general, and may refer to a regular sparsity pattern (e.g., block-banded), or be more highly structured (e.g., symmetric…
Let u be a hermitian involution, and e an orthogonal projection, acting on the same Hilbert space. We establish the exact formula, in terms of the norm of eue, for the distance from e to the set of all orthogonal projections q from the…
The structure of a Frobenius manifold encodes the geometry associated with a flat pencil of metrics. However, as shown in the authors' earlier work, much of the structure comes from the compatibility properties of the pencil rather than…
In this paper we study para-Hermitian rational matrices and the associated structured rational eigenvalue problem (REP). Para-Hermitian rational matrices are square rational matrices that are Hermitian for all $z$ on the unit circle that…
In the paper we characterize subspaces and pencils of lines of generalized (and multidimensional) Laguerre spaces and we consider definability of the structure of "conic" pencils in the Grassmann space of 1-subspaces. We also study…
By exploiting the connection between solving algebraic $\top$-Riccati equations and computing certain deflating subspaces of $\top$-palindromic matrix pencils, we obtain theoretical and computational results on both problems. Theoretically,…
An algorithm for first-principles electronic structure calculations having a computational cost which scales linearly with the system size is presented. Our method exploits the real-space localization of the density matrix, and in this…
A symplectic structure is canonically constructed on any manifold endowed with a topological linear k-system whose fibers carry suitable symplectic data. As a consequence, the classification theory for Lefschetz pencils in the context of…
We study the complexity of approximating the permanent of a positive semidefinite matrix $A\in \mathbb{C}^{n\times n}$. 1. We design a new approximation algorithm for $\mathrm{per}(A)$ with approximation ratio $e^{(0.9999 + \gamma)n}$,…