Related papers: Some Simplifications in Basic Complex Analysis
We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…
We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a "Z_k-combinatorial Stokes theorem", which in turn…
We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…
Using symmetric algebras we simplify (and slightly strengthen) the Bruns-Eisenbud-Evans "generalized principal ideal theorem" on the height of order ideals of non-minimal generators in a module. We also obtain a simple proof and an…
By adapting methods of \cite{AC} we prove a sharp estimate on the expansion modulus of the gradient of the log of the parabolic kernel to the Sch\"ordinger operator with convex potential, which improves an earlier work of Brascamp-Lieb. We…
A well-known conjecture of Gross and Zagier states that the values of the higher automorphic Green's function at pairs of points with complex multiplication in the upper half-plane are proportional to the logarithm of an algebraic number.…
This work is devoted to direct mass transportation proofs of families of functional inequalities in the context of one-dimensional free probability, avoiding random matrix approximation. The inequalities include the free form of the…
Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…
We introduce four new elementary short proofs of the famous K\"onig's theorem which characterizes bipartite graphs by absence of odd cycles.
We give a quintet of proofs resulting from questions posed by Erd\H{o}s. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $K_4$-free $4$-critical graphs with few chords in any…
The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from graph theory, combinatorics, algebra and number theory, but…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We establish a generalization of Littlewood's criterion on $L^\alpha$-flatness by proving that there is no $L^\alpha$-flat polynomials, $\alpha>0$, within the class of analytic polynomials on the unit circle of the form $…
A very short proof of the Fej\'er-Riesz lemma is presented in the matrix case
We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem.…
Using the theory of functions of several complex variables, we prove that if an analytic function in several variables satisfies a system of $q$-partial differential equations, then, it can be expanded in terms of the product of the…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…
For any connected complex reductive group $G$ and element $z$ of its Weyl group $W$, we use work of Lusztig and Abreu-Nigro to compute the graded $W$-character of the intersection cohomology of any closed Lusztig variety for $z$ over the…
In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$…