The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 1741 – 1760 of 1970

Showing per page

Arithmetic progressions in sumsets

Imre Z. Ruzsa (1991)

Acta Arithmetica

1. Introduction. Let A,B ⊂ [1,N] be sets of integers, |A|=|B|=cN. Bourgain [2] proved that A+B always contains an arithmetic progression of length e x p ( l o g N ) 1 / 3 - ε . Our aim is to show that this is not very far from the best possible. Theorem 1. Let ε be a positive number. For every prime p > p₀(ε) there is a symmetric set A of residues mod p such that |A| > (1/2-ε)p and A + A contains no arithmetic progression of length (1.1) e x p ( l o g p ) 2 / 3 + ε . A set of residues can be used to get a set of integers in an obvious way. Observe...

Arithmetic Properties of Generalized Rikuna Polynomials

Z. Chonoles, J. Cullinan, H. Hausman, A.M. Pacelli, S. Pegado, F. Wei (2014)

Publications mathématiques de Besançon

Fix an integer 3 . Rikuna introduced a polynomial r ( x , t ) defined over a function field K ( t ) whose Galois group is cyclic of order , where K satisfies some mild hypotheses. In this paper we define the family of generalized Rikuna polynomials { r n ( x , t ) } n 1 of degree n . The r n ( x , t ) are constructed iteratively from the r ( x , t ) . We compute the Galois groups of the r n ( x , t ) for odd over an arbitrary base field and give applications to arithmetic dynamical systems.

Currently displaying 1741 – 1760 of 1970