Displaying similar documents to “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].

Elementary sequences.

Beslin, Scott J. (1992)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Sturm Sequences and Modified Subresultant Polynomial Remainder Sequences

Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis (2014)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): F.2.1, G.1.5, I.1.2. In 1971 using pseudo-divisions - that is, by working in Z[x] - Brown and Traub computed Euclid’s polynomial remainder sequences (prs’s) and (proper) subresultant prs’s using sylvester1, the most widely known form of Sylvester’s matrix, whose determinant defines the resultant of two polynomials. In this paper we use, for the first time in the literature, the Pell-Gordon Theorem of 1917, and sylvester2, a little...