Displaying 81 – 100 of 350

Showing per page

Determining Integer-Valued Polynomials From Their Image

Vadim Ponomarenko (2010)

Actes des rencontres du CIRM

This note summarizes a presentation made at the Third International Meeting on Integer Valued Polynomials and Problems in Commutative Algebra. All the work behind it is joint with Scott T. Chapman, and will appear in [2]. Let Int ( ) represent the ring of polynomials with rational coefficients which are integer-valued at integers. We determine criteria for two such polynomials to have the same image set on .

Distributional properties of powers of matrices

Fernando Chamizo, Dulcinea Raboso (2014)

Czechoslovak Mathematical Journal

We apply the larger sieve to bound the number of 2 × 2 matrices not having large order when reduced modulo the primes in an interval. Our motivation is the relation with linear recursive congruential generators. Basically our results establish that the probability of finding a matrix with large order modulo many primes drops drastically when a certain threshold involving the number of primes and the order is exceeded. We also study, for a given prime and a matrix, the existence of nearby non-similar...

Effective Nullstellensatz for arbitrary ideals

János Kollár (1999)

Journal of the European Mathematical Society

Let f i be polynomials in n variables without a common zero. Hilbert’s Nullstellensatz says that there are polynomials g i such that g i f i = 1 . The effective versions of this result bound the degrees of the g i in terms of the degrees of the f j . The aim of this paper is to generalize this to the case when the f i are replaced by arbitrary ideals. Applications to the Bézout theorem, to Łojasiewicz–type inequalities and to deformation theory are also discussed.

Équations diophantiennes polynomiales à hautes multiplicités

Michel Langevin (2001)

Journal de théorie des nombres de Bordeaux

On montre comment écrire de grandes familles, avec de hautes multiplicités, de cas d’égalité A + B = C pour l’inégalité de Stothers-Mason (si A ( X ) , B ( X ) , C ( X ) sont des polynômes premiers entre eux, le nombre exact de racines du produit A B C dépasse de 1 le plus grand des degrés des composantes A , B , C ) . On développera pour cela des techniques polynomiales itératives inspirées des décompositions de Dunford-Schwartz et de fonctions de Belyi. Des exemples d’application avec les conjectures ( a b c ) ou de M. Hall sont développés.

Currently displaying 81 – 100 of 350