Search arXivSearch

arXiv · 1512.02670

On discrete values of bilinear forms

Abstract

This paper is an erratum to our paper, entitled "On an application of Guth-Katz theorem", Math. Res. Lett. 18 (2011), no. 4, 691-697. Let $F$ be the real or complex field and $ω$ a non-degenerate skew-symmetric bilinear form in the plane $F^2$. We prove that for finite a point set $P\subset F^2\setminus\{0\}$, the set $T_ω(P)$ of nonzero values of $ω$ in $P\times P$, if nonempty, has cardinality $Ω(N^{9/13}).$ A presumably near-sharp estimate $Ω(N/\log N)$ was claimed in the abovemnetioned paper over the reals for a symmetric or skew-symmetric form $ω$. However, the set-up for the proof was flawed. We discuss why we believe that justifying this claim in full strength is a major open problem. In the special case when $P=A\times A$, where $A$ is a set of at least two reals, we establish the following sum-product type estimates: $$ |AA+ AA|= Ω\left(|A|^{19/12}\right), $$ and $$|AA-AA|= Ω\left( \frac{|A|^{26/17}}{\log^{2/17}|A|}\right).$$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alex Iosevich, Oliver Roche-Newton, Misha Rudnev. 2015-12-08. On discrete values of bilinear forms. https://arxiv.org/abs/1512.02670

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO