scholarly journals Constructions for the Elekes–Szabó and Elekes–Rónyai problems

10.37236/8668 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
Mehdi Makhul ◽  
Oliver Roche-Newton ◽  
Audie Warren ◽  
Frank De Zeeuw

We give a construction of a non-degenerate polynomial $F\in \mathbb R[x,y,z]$ and a set $A$ of cardinality $n$ such that $F$ vanishes on $\Omega(n^{3/2})$ points of $A \times A \times A$, thus providing a new lower bound construction for the Elekes–Szabó problem. We also give a related construction for the Elekes–Rónyai problem restricted to a subgraph. This consists of a polynomial $f\in \mathbb R[x,y]$ that is not additive or multiplicative, a set $A$ of size $n$, and a subset $P\subset A\times A$ of size $\Omega(n^{3/2})$ on which $f$ takes only $n$ distinct values.

2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.


10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.


10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.


Sign in / Sign up

Export Citation Format

Share Document