Related papers: A short proof of the elliptical range theorem
We extend some classical theorems in the theory of orthogonal polynomials on the unit circle to the matrix case. In particular, we prove a matrix analogue of Szeg\H{o}'s theorem. As a by-product, we also obtain an elementary proof of the…
Several new verifiable conditions are established for block matrices with scalar diagonal blocks to have the numerical range equal the convex hull of at most k ellipses where k by k is the size of the smaller diagonal block. For k = 2,…
The quaternionic numerical range of matrices over the ring of quaternions is not necessarily convex. We prove Toeplitz-Hausdorff like theorem, that is, for any given quaternionic matrix every section of its quaternionic numerical range is…
In this paper we present a surprisingly short proof of Minkowski's second theorem. The author hopes there is no mistake in it, though the argument seems to be too plain to contain one. Also, we apply the main construction of the proof to…
We introduce the concept of rings of simple range 2. Based on this concept, we build a theory diagonal reduction of matrices over Bezout domain. In particular we show that invariant Bezout domain is an elementary divisor ring if and only if…
We discuss a non-computational elementary approach to a well-known criterion of divisibility by 2 in the group of rational points on an elliptic curve.
We provide a short proof for the Figiel, Lindenstrauss and Milman inequality regarding the number of vertices and faces of certain polytope, with an explicit bound on the universal constant involved. The proof is completely elementary and…
A local numerical range is analyzed for a family of circulant observables and states of composite $2 \otimes d$ systems. It is shown that for any $2\otimes d$ circulant operator $\cal O$ there exists a basis giving rise to the matrix…
Kippenhahn discovered that the numerical range of a complex square matrix is the convex hull of a plane real algebraic curve. Here, we present an example of a convex set, which has a similar algebraic description as the numerical range,…
We establish a superpolynomial lower bound on the range of the permanent function on the set of $n\times n$ matrices with $\pm1$ entries.
We consider the linearised vacuum Einstein equations around a Kerr exterior solution and present a scheme to prove elliptic $L^2(\mathbb{S}^2)$-estimates for the linearised curvature quantities in the equations. The scheme employs the…
In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.
In this short note we provide a quantitative version of the classical Runge approximation property for second order elliptic operators. This relies on quantitative unique continuation results and duality arguments. We show that these…
We use ergodic theory to prove a quantitative version of a theorem of M. A. Berger and Y. Wang, which relates the joint spectral radius of a set of matrices to the spectral radii of finite products of those matrices. The proof rests on a…
We present a short elementary proof of the following Twelve Points Theorem: Let M be a convex polygon with vertices at the lattice points, containing a single lattice point in its interior. Denote by m (resp. m*) the number of lattice…
The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…
We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…
A procedure to obtain differentiation matrices is extended straightforwardly to yield new differentiation matrices useful to obtain derivatives of complex rational functions. Such matrices can be used to obtain numerical solutions of some…
In this paper we show that the closure of the numerical range of an $n+1$-periodic tridiagonal operator is equal to the numerical range of a $2(n+1)\times 2(n+1)$ complex matrix.
In this paper we prove an existence theorem concerning linear forms of a given Diophantine type and apply it to study the structure of the spectrum of lattice exponents.