The summatory function of the sum-of-digits function on polynomial sequences
Manfred Peter (2002)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Polynomial parametrizations of length 4 Büchi sequences”
The summatory function of the sum-of-digits function on polynomial sequences
Polynomially Bounded Sequences and Polynomial Sequences
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].
Explicit constructions of extractors and expanders
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
Transforming recurrent sequences by using the binomial and invert operators.
Barbero, Stefano, Cerruti, Umberto, Murru, Nadir (2010)
Journal of Integer Sequences [electronic only]
Similarity:
The reduced length of a polynomial with complex coefficients
A. Schinzel (2008)
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:
A generalization of a polynomial lemma of Leja
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
On the number of terms of a composite polynomial
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.
Alkiviadis G. Akritas (1987/88)
Numerische Mathematik
Similarity:
A formula for the supersingular polynomial
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
Elementary properties of the class of nondeterministic polynomial time computable functions
James P. Jones (1988)
Banach Center Publications
Similarity:
Addendum to the paper: "On the number of terms of a composite polynomial" (Acta Arith. 127 (2007), 157-167)
Umberto Zannier (2009)
Acta Arithmetica
Similarity:
Near solutions of polynomial equations
Shih Ping Tung (2006)
Acta Arithmetica
Similarity:
A generating function for the generalised Rice's polynomial
V. L. Deshpande, V. M. Bhise (1970)
Matematički Vesnik
Similarity:
Existence of Polynomial Solutions of a Class of Riccati-Type Differential Equations.
H. Kaufman, Mira Bhargava (1965)
Collectanea Mathematica
Similarity:
On perturbations of pluriregular sets generated by sequences of polynomial maps
Maciej Klimek (2003)
Annales Polonici Mathematici
Similarity:
It is shown that an infinite sequence of polynomial mappings of several complex variables, with suitable growth restrictions, determines a filled-in Julia set which is pluriregular. Such sets depend continuously and analytically on the generating sequences, in the sense of pluripotential theory and the theory of set-valued analytic functions, respectively.
On Waring's problem with polynomial summands II: Addendum
Hong Bing Yu (2001)
Acta Arithmetica
Similarity: