Quantitative sum product estimates on different sets.

Shen, Chun-Yen

Displaying similar documents to “Quantitative sum product estimates on different sets.”

A quantified version of Bourgain's sum-product estimate in $𝔽_{p}$ for subsets of incomparable sizes.

Garaev, M.Z. (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Slightly improved sum-product estimates in fields of prime order

Liangpan Li (2011)

Acta Arithmetica

Similarity:

Certain subdirect sums of finite prime fields

Ferenc Szász (1972)

Colloquium Mathematicae

Similarity:

A quantitative lower bound for the greatest prime factor of (ab+1)(bc+1)(ca+1)

Yann Bugeaud, Florian Luca (2004)

Acta Arithmetica

Similarity:

Function fields with class number indivisible by a prime ℓ

Michael Daub, Jaclyn Lang, Mona Merling, Allison M. Pacelli, Natee Pitiwan, Michael Rosen (2011)

Acta Arithmetica

Similarity:

The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives

Gopalakrishna Hejmadi Gadiyar, Ramanathan Padma (2018)

Czechoslovak Mathematical Journal

Similarity:

We connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.

Asymptotic estimates for phi functions for subsets of ${m + 1, m + 2, ..., n}$ .

Nathanson, Melvyn B., Orosz, Brooke (2007)

Integers

Similarity:

Remark on the minimum discriminant of normal fields

Juraj Kostra (1989)

Czechoslovak Mathematical Journal

Similarity:

Prime valued polynomials and class numbers of quadratic fields.

Mollin, Richard A. (1990)

International Journal of Mathematics and Mathematical Sciences

Similarity:

On the number of subsets relatively prime to an integer.

Ayad, Mohamed, Kihel, Omar (2008)

Journal of Integer Sequences [electronic only]

Similarity:

Greatest prime divisors of polynomial values over function fields

Alexei Entin (2014)

Acta Arithmetica

Similarity:

For a function field K and fixed polynomial F ∈ K[x] and varying f ∈ F (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of F(f) in terms of the height of f, establishing a strong result for the function field analogue of a classical problem in number theory.

Numbers with a large prime factor

R. C. Baker, G. Harman (1995)

Acta Arithmetica

Similarity: