Do you want to publish a course? Click here

Non-abelian Littlewood-Offord inequalities

116   0   0.0 ( 0 )
 Added by Pham H. Tiep
 Publication date 2015
  fields
and research's language is English




Ask ChatGPT about the research

In 1943, Littlewood and Offord proved the first anti-concentration result for sums of independent random variables. Their result has since then been strengthened and generalized by generations of researchers, with applications in several areas of mathematics. In this paper, we present the first non-abelian analogue of Littlewood-Offord result, a sharp anti-concentration inequality for products of independent random variables.

rate research

Read More

The classical ErdH{o}s-Littlewood-Offord theorem says that for nonzero vectors $a_1,dots,a_nin mathbb{R}^d$, any $xin mathbb{R}^d$, and uniformly random $(xi_1,dots,xi_n)in{-1,1}^n$, we have $Pr(a_1xi_1+dots+a_nxi_n=x)=O(n^{-1/2})$. In this paper we show that $Pr(a_1xi_1+dots+a_nxi_nin S)le n^{-1/2+o(1)}$ whenever $S$ is definable with respect to an o-minimal structure (for example, this holds when $S$ is any algebraic hypersurface), under the necessary condition that it does not contain a line segment. We also obtain an inverse theorem in this setting.
We consider random polynomials whose coefficients are independent and uniform on {-1,1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^{-2}) when n+1 is not divisible by 4 and asymptotic to $frac{8sqrt{3}}{pi n^2}$ otherwise. This result is a corollary of a more general theorem that we prove concerning random polynomials with independent, identically distributed coefficients having a distribution which is supported on { -1, 0, 1} and whose largest atom is strictly less than 1/sqrt{3}. In this general case, we prove that the probability of having a double root equals the probability that either -1, 0 or 1 are double roots up to an o(n^{-2}) factor and we find the asymptotics of the latter probability.
133 - Jean Dolbeault 2018
This paper is devoted to a new family of reverse Hardy-Littlewood-Sobolev inequalities which involve a power law kernel with positive exponent. We investigate the range of the admissible parameters and characterize the optimal functions. A striking open question is the possibility of concentration which is analyzed and related with nonlinear diffusion equations involving mean field drifts.
179 - A. I. Molev 2007
We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are polynomials in the parameters which we call the Littlewood-Richardson polynomials. We give a combinatorial rule for their calculation by modifying an earlier result of B. Sagan and the author. The new rule provides a formula for these polynomials which is manifestly positive in the sense of W. Graham. We apply this formula for the calculation of the product of equivariant Schubert classes on Grassmannians which implies a stability property of the structure coefficients. The first manifestly positive formula for such an expansion was given by A. Knutson and T. Tao by using combinatorics of puzzles while the stability property was not apparent from that formula. We also use the Littlewood-Richardson polynomials to describe the multiplication rule in the algebra of the Casimir elements for the general linear Lie algebra in the basis of the quantum immanants constructed by A. Okounkov and G. Olshanski.
The Newell-Littlewood numbers $N_{mu, u,lambda}$ are tensor product multiplicities of Weyl modules for classical Lie groups, in the stable limit. For which triples of partitions $(mu, u,lambda)$ does $N_{mu, u,lambda}>0$ hold? The Littlewood-Richardson coefficient case is solved by the Horn inequalities (in work of A. Klyachko and A. Knutson-T. Tao). We extend these celebrated linear inequalities to a much larger family, suggesting a general solution.
comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا