Multivariable polynomial injections on rational numbers
Bjorn Poonen (2010)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Computing the period of an Ehrhart quasi-polynomial.”
Multivariable polynomial injections on rational numbers
A finite calculus approach to Ehrhart polynomials.
Sam, Steven V., Woods, Kevin M. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A generating function for the generalised Rice's polynomial
V. L. Deshpande, V. M. Bhise (1970)
Matematički Vesnik
Similarity:
The reduced length of a polynomial with complex coefficients
A. Schinzel (2008)
Acta Arithmetica
Similarity:
An algorithm for detecting “linear” solutions of nonlinear polynomial differential equations.
Kotsios, Stelios (2007)
Applied Mathematics E-Notes [electronic only]
Similarity:
A generalization of a polynomial lemma of Leja
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
Selected Chapters from Algebra, II
I. R. Shafarevich (1999)
The Teaching of Mathematics
Similarity:
Explicit constructions of extractors and expanders
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
On some properties of polynomial functions
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Intersective sets given by a polynomial
Jason Lucier (2006)
Acta Arithmetica
Similarity:
On the number of terms of a composite polynomial
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
Generating functions and special functions.
Sadeghi, J., Amani, A., Pourdarvish, A. (2006)
APPS. Applied Sciences
Similarity:
Degrees of Polynomial Solutions of a Class of Riccati - tipe Differential Equations*.
Mira Bhargava (1964)
Collectanea Mathematica
Similarity:
A formula for the supersingular polynomial
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
Combinatorial Nullstellensatz approach to polynomial expansion
Fedor Petrov (2014)
Acta Arithmetica
Similarity:
Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of |f(A,B)| for finite subsets A, B of a field, and a polynomial f(x,y) of the form f(x,y) = g(x) + yh(x), where the degree of g is greater than that of h.