Polynomial parametrizations of length 4 Büchi sequences
Xavier Vidaux (2011)
Acta Arithmetica
Similarity:
Xavier Vidaux (2011)
Acta Arithmetica
Similarity:
Manfred Peter (2002)
Acta Arithmetica
Similarity:
Roshan Lal, Susheel Kumar, Sunil Hans (2011)
Annales UMCS, Mathematica
Similarity:
For a polynomial of degree n, we have obtained some results, which generalize and improve upon the earlier well known results (under certain conditions). A similar result is also obtained for analytic function.
Joanna Szczawińska (1996)
Annales Polonici Mathematici
Similarity:
The aim of this paper is to give a necessary and sufficient condition for a set-valued function to be a polynomial s.v. function of order at most 2.
Bhaskaran, R., Karunakaran, V. (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
Hiroyuki Okazaki, Yuichi Futa (2015)
Formalized Mathematics
Similarity:
In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12]. It takes polynomially bounded amount of computation time to solve polynomial-time decision problems by the deterministic Turing machine. Moreover we formalize polynomial sequences [5].
Ewa Ligocka (2006)
Annales Polonici Mathematici
Similarity:
We give a simple algebraic condition on the leading homogeneous term of a polynomial mapping from ℝ² into ℝ² which is equivalent to the fact that the complexification of this mapping can be extended to a polynomial endomorphism of ℂℙ². We also prove that this extension acts on ℂℙ²∖ℂ² as a quotient of finite Blaschke products.
Barbero, Stefano, Cerruti, Umberto, Murru, Nadir (2010)
Journal of Integer Sequences [electronic only]
Similarity:
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Jason Lucier (2006)
Acta Arithmetica
Similarity:
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
A. Schinzel (2008)
Acta Arithmetica
Similarity:
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
A. Płoski (1985)
Annales Polonici Mathematici
Similarity:
V. L. Deshpande, V. M. Bhise (1970)
Matematički Vesnik
Similarity:
Henryk Żołądek (1993)
Studia Mathematica
Similarity:
We show that any equation dy/dx = P(x,y) with P a polynomial has a global (on ℝ²) smooth first integral nonconstant on any open domain. We also present an example of an equation without an analytic primitive first integral.
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.
Shih Ping Tung (2006)
Acta Arithmetica
Similarity: