Add to ORKGreduce to searching for squares in specific sequences. For instance, we would like to know whether there are infinitely many squares of type p − 1, where p ranges over primes. Of particular interest is the general problem whether the difference se
Perfect difference sets are a set of residues, or remainders, under the modulo difference operation....
AbstractWe prove that for any primes p1,…,ps there are only finitely many numbers ∏i=1spiαi,αi∈Z+, w...
AbstractSquares are strings of the form ww where w is any nonempty string. Two squares ww and w′w′ a...
The aim of this paper is to study sequences of integers for which the second differences between the...
For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinal...
The problem addressed is this: Do there exist nonconsecutive integers n0, n1, n2, . . ., such that t...
AbstractAll our words (strings) are over afixedalphabet. A square is a subword of the formuu=u2, whe...
AbstractWe are interested in dissecting squares into distinct squares. We impose the condition that ...
. All our words (strings) are over a fixed alphabet. A square is a subword of the form uu = u 2 ,...
In this paper, some important properties of squares of whole numbers are reported. An algorithm is p...
Abstract. We prove a quantitative version of the Polynomial Szemerédi Theorem for difference sets. ...
The P-difference between two sets A and B is the set of all points, C, such that the sum of B to any...
This work is based on an article which provides a construction of the first infinite word over a fin...
In this article, we study short intervals that contain “almost squares” of the type: any integer n w...
International audienceA partial word is a word with holes (also called don't cares: special symbols ...
Perfect difference sets are a set of residues, or remainders, under the modulo difference operation....
AbstractWe prove that for any primes p1,…,ps there are only finitely many numbers ∏i=1spiαi,αi∈Z+, w...
AbstractSquares are strings of the form ww where w is any nonempty string. Two squares ww and w′w′ a...
The aim of this paper is to study sequences of integers for which the second differences between the...
For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinal...
The problem addressed is this: Do there exist nonconsecutive integers n0, n1, n2, . . ., such that t...
AbstractAll our words (strings) are over afixedalphabet. A square is a subword of the formuu=u2, whe...
AbstractWe are interested in dissecting squares into distinct squares. We impose the condition that ...
. All our words (strings) are over a fixed alphabet. A square is a subword of the form uu = u 2 ,...
In this paper, some important properties of squares of whole numbers are reported. An algorithm is p...
Abstract. We prove a quantitative version of the Polynomial Szemerédi Theorem for difference sets. ...
The P-difference between two sets A and B is the set of all points, C, such that the sum of B to any...
This work is based on an article which provides a construction of the first infinite word over a fin...
In this article, we study short intervals that contain “almost squares” of the type: any integer n w...
International audienceA partial word is a word with holes (also called don't cares: special symbols ...
Perfect difference sets are a set of residues, or remainders, under the modulo difference operation....
AbstractWe prove that for any primes p1,…,ps there are only finitely many numbers ∏i=1spiαi,αi∈Z+, w...
AbstractSquares are strings of the form ww where w is any nonempty string. Two squares ww and w′w′ a...