Displaying similar documents to “Effective bounds for the zeros of linear recurrences in function fields”

On blocks of arithmetic progressions with equal products

N. Saradha (1997)

Journal de théorie des nombres de Bordeaux

Similarity:

Let f ( X ) [ X ] be a monic polynomial which is a power of a polynomial g ( X ) [ X ] of degree μ 2 and having simple real roots. For given positive integers d 1 , d 2 , , m with < m and gcd ( , m ) = 1 with μ m + 1 whenever m < 2 , we show that the equation f ( x ) f ( x + d 1 ) f ( x + ( k - 1 ) d 1 ) = f ( y ) f ( y + d 2 ) f ( y + ( m k - 1 ) d 2 ) with f ( x + j d 1 ) 0 for 0 j < k has only finitely many solutions in integers x , y and k 1 except in the case m = μ = 2 , = k = d 2 = 1 , f ( X ) = g ( X ) , x = f ( y ) + y .

CAPS in Z(2,n)

Kurz, Sascha (2009)

Serdica Journal of Computing

Similarity:

We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.