Related papers: A short proof of the elliptical range theorem

There has been considerable recent literature connecting Poncelet's theorem to ellipses, Blaschke products and numerical ranges, summarized, for example, in the recent book [11]. We show how those results can be understood using ideas from…

In this note, we given a version of Pick's theorem for the simple lattice polygon in two-dimensional subspace of R^3.

We prove a complex polynomial plank covering theorem for not necessarily homogeneous polynomials. As the consequence of this result, we extend the complex plank theorem of Ball to the case of planks that are not necessarily centrally…

We obtain several generalizations the Hellinger theorem about $l^2$ solutions of difference equations: instead of second order equations and $ l^2$-solutions, we consider second-order equations with matrix coefficients and their solutions…

We give a relatively short and self contained proof of Ratner's theorem in the special case of SL(2,R)-invariant measures.

Given an elliptic curve E over the rational with no rational 2-torsion points, we prove the existence of a quadratic twist of E for which the 2-Selmer rank is less than or equal to 1. By the author's earlier result, we establish a lower…

We give a short proof of Ahlfors' theorem on covering surfaces.

For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…

The "loop equations" of random matrix theory are a hierarchy of equations born of attempts to obtain explicit formulae for generating functions of map enumeration problems. These equations, originating in the physics of 2-dimensional…

It is proved that the rank of elliptic curves with complex multiplication introduced by B. H. Gross is one less an arithmetic complexity of the corresponding noncommutative tori with real multiplication.

For every $p\leq n$ positive integer we obtain the lower bound $(3-\frac{1}{p+1})n^2-\big(2\binom{2p}{p+1}-\binom{2p-2}{p-1}+2\big)n$ for the rank of the $n\times n$ matrix multiplication. This bound improves the previous one…

The Prym variety for a branched double covering of a nonsingular projective curve is defined as a polarized abelian variety. We prove that any double covering of an elliptic curve which has more than $4$ branch points is recovered from its…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

We prove that the spectral radius of an i.i.d.\ random walk on $\GL_d(\C)$ satisfies a strong law of large numbers under finite second moment assumption and a weak law of large numbers under finite first moment. No irreducibility assumption…

We solve the loop equations to all orders in $1/N^2$, for the Chain of Matrices matrix model (with possibly an external field coupled to the last matrix of the chain). We show that the topological expansion of the free energy, is, like for…

We study the top Lyapunov exponents of random products of positive $2 \times 2$ matrices and obtain an efficient algorithm for its computation. As in the earlier work of Pollicott, the algorithm is based on the Fredholm theory of…

We present a comprehensive $L^2$-theory for the $\overline\partial$-operator on singular complex curves, including $L^2$-versions of the Riemann-Roch theorem and some applications.

A proof is given of Rosenthal's \(\ell_1\) theorem.

We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.

We give a short proof of the Buchstaber-Rees theorem concerning symmetric powers. The proof is based on the notion of a formal characteristic function of a linear map of algebras.