Jozsef Solymosi
ABSTRACT
Given a finite set of complex numbers A we say that a transformation on the complex numbers, T: C → C is k-rich on A if |A ∩ T(A)|≥ k. In this paper we give a bounds on the number of k-rich linear and Möbius transformations for any given set A. Our results have applications to discrete geometry and to additive combinatorics.
- Bernardo Abrego, György Elekes, and Silvia Fernandez. Structural results for planar sets with many similar subsets. Combinatorica, 24 (4) (2004), 541--555. Google Scholar
Digital Library
- Marshall W. Bern and David Eppstein. Optimal Möbius Transformations for Information Visualization and Meshing, in:Proceedings of the 7th International Workshop on Algorithms and Data Structures, August 08-10, 2001, 14--25. Google ScholarDigital Library
- Peter Brass, William Moser, and János Pach. Research Problems in Discrete Geometry. Springer, New York, 2005.Google Scholar
- Mei-Chu Chang. A sum-product estimate in algebraic division algebras. Israel J. Math., Vol. 150 , 369--380, 2005.Google ScholarCross Ref
- György Elekes. On the number of sums and products. Acta Arith., 81 (4) (1997), 365--367.Google ScholarCross Ref
- György Elekes. SUMS versus PRODUCTS in number theory, algebra and Erdos geometry. In Paul Erdos and his mathematics, II (Budapest, 1999), volume 11 of Bolyai Soc. Math. Stud. János Bolyai Math. Soc., Budapest, 2002, 241--290.Google Scholar
- P. Erdos and E. Szemerédi. On sums and products of integers. In Studies in pure mathematics. Birkhäuser, Basel, 1983, 213--218.Google Scholar
- Kevin Ford. Sums and products from a finite set of real numbers. Ramanujan J., 2 (1--2) (1998), 59--66.Google Scholar
- Melvyn B. Nathanson. On sums and products of integers. Proc. Amer. Math. Soc., 125 (1) (1997), 9--16.Google ScholarCross Ref
- Tristam Needham. Visual Complex Analysis. The Clarendon Press, Oxford University Press, New York, 1997.Google Scholar
- János Pach and Pankaj K. Agarwal. Combinatorial Geometry. Wiley, New York, 1995.Google ScholarCross Ref
- József Solymosi On the number of sums and products. The Bulletin of the London Mathematical Society 37 (4) (2005), 491--494.Google ScholarCross Ref
- Boris A. Springborn A unique representation of polyhedral types. Centering via Möbius transformations. Mathematische Zeitschrift, 249 (3) (2005), 513--517.Google ScholarCross Ref
- Endre Szemerédi and William T. Trotter, Jr. Extremal problems in discrete geometry. Combinatorica, 3 (3--4) (1983), 381--392.Google ScholarCross Ref
- Csaba D. Tóth. The szemerédi-trotter theorem in the complex plane. Math ArXiV, eprint:math/0305283, 2003.Google Scholar
Index Terms
- On the number of k-rich transformations
Recommendations
Dense Arrangements are Locally Very Dense. I
The Szemere´di-Trotter theorem [Combinatorica, 3 (1983), pp. 381-392] gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ ...
Bounding the piercing number
It is shown that for everyk and everyp q d+1 there is ac=c(k,p,q,d)< such that the following holds. For every family whose members are unions of at mostk compact convex sets inRd in which any set ofp members of the family contains a subset of ...
On the number of corner cuts
A corner cut in dimension d is a finite subset of N"0^d that can be separated from its complement in N"0^d by an affine hyperplane disjoint from N"0^d. Corner cuts were first investigated by Onn and Sturmfels [Adv. Appl. Math. 23 (1999) 29-48], their ...
Comments