#### Filter Results:

#### Publication Year

1990

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Antal Balog, Endre Szemerédi
- Combinatorica
- 1994

In 1998, the second author raised the problem of classifying the irreducible characters of S n of prime power degree. Zalesskii proposed the analogous problem for quasi-simple groups, and he has, in joint work with Malle, made substantial progress on this latter problem. With the exception of the alternating groups and their double covers, their work… (More)

- Antal Balog, Imre Bárány
- Symposium on Computational Geometry
- 1990

Let Pr denote the convex hull of the integer points in the disc of radius r. W: prove that thq number of vertices of Pr is essentially 73 as r ~ w

- ANTAL BALOG
- 2007

Let E be an elliptic curve over Q. In 1988, N. Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over Fp is prime. This is an analogue of the Hardy–Littlewood twin prime conjecture in the case of elliptic curves. Koblitz's Conjecture is still widely open. In this paper we prove that… (More)

- Antal Balog, Ken Ono, KEN ONO
- 2004

Congruences for Fourier coefficients of integer weight modular forms have been the focal point of a number of investigations. In this note we shall exhibit congruences for Fourier coefficients of a slightly different type. Let f (z) = P ∞ n=0 a(n)q n be a holomorphic half integer weight modular form with integer coefficients. If is prime, then we shall be… (More)

- Antal Balog, Ken Ono, KEN ONO
- 2003

The problem of estimating the number of imaginary quadratic fields whose ideal class group has an element of order ≥ 2 is classical in number theory. Analogous questions for quadratic twists of elliptic curves have been the focus of recent interest. Whereas works of Stewart and Top [St-T], and of Gouvêa and Mazur [G-M] address the nontriviality of… (More)

- Antal Balog, László Pyber, Avinoam Mann
- IJAC
- 2000

- Antal Balog, Oliver Roche-Newton
- Discrete & Computational Geometry
- 2015

We give bounds on the number of distinct differences N a − a as a varies over all elements of a given finite set A ⊆ (R/Z) d , d ≥ 1, and N a is a nearest neighbour to a.