Displaying 221 – 240 of 296

Showing per page

Sumsets in quadratic residues

I. D. Shkredov (2014)

Acta Arithmetica

We describe all sets A p which represent the quadratic residues R p in the sense that R = A + A or R = A ⨣ A. Also, we consider the case of an approximate equality R ≈ A + A and R ≈ A ⨣ A and prove that A is then close to a perfect difference set.

Sumsets of Sidon sets

Imre Z. Ruzsa (1996)

Acta Arithmetica

1. Introduction. A Sidon set is a set A of integers with the property that all the sums a+b, a,b∈ A, a≤b are distinct. A Sidon set A⊂ [1,N] can have as many as (1+o(1))√N elements, hence  N/2 sums. The distribution of these sums is far from arbitrary. Erdős, Sárközy and T. Sós [1,2] established several properties of these sumsets. Among other things, in [2] they prove that A + A cannot contain an interval longer than C√N, and give an example that N 1 / 3 is possible. In [1] they show that A + A contains...

Supercongruences for the Almkvist-Zudilin numbers

Tewodros Amdeberhan, Roberto Tauraso (2016)

Acta Arithmetica

We prove a conjecture on supercongruences for sequences that have come to be known as the Almkvist-Zudilin numbers. Some other (naturally) related family of sequences will be considered in a similar vain.

Sur la complexité de mots infinis engendrés par des q -automates dénombrables

Marion Le Gonidec (2006)

Annales de l’institut Fourier

On étudie, dans cet article, les propriétés combinatoires de mots engendrés à l’aide de q -automates déterministes dénombrables de degré borné, ou de manière équivalente, engendrés par des substitutions de longueur constante uniformément bornées sur un alphabet dénombrable. En particulier, on montre que la complexité de tels mots est au plus polynomiale et que, sur plusieurs exemples, elle est au plus de l’ordre de grandeur de n ( log n ) p .

Currently displaying 221 – 240 of 296