On the modes of polynomials derived from nondecreasing sequences.
Dou, Donna Q.J., Yang, Arthur L.B. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On the approximate roots of polynomials”
On the modes of polynomials derived from nondecreasing sequences.
Characterizing Frobenius semigroups by filtration.
Johnson, Inga, Powers, Sean, Starr, Colin, Trevelyan, Charles, Webster, Craig (2009)
Journal of Integer Sequences [electronic only]
Similarity:
On a linear Diophantine problem of Frobenius.
Tripathi, Amitabha (2006)
Integers
Similarity:
A curious identity involving binomial coefficients.
Sun, Zhiwei (2002)
Integers
Similarity:
On -thin sets
Pavel Kostyrko (1982)
Časopis pro pěstování matematiky
Similarity:
Some local asymptotic laws for the Cauchy process on the line.
Okoroafor, A.Chukwuemeka (2007)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
A common generalization of some identities.
Zhang, Zhizheng, Wang, Jun (2005)
Integers
Similarity:
On the number of representations of an integer by a linear form.
Alon, Gil, Clark, Pete L. (2005)
Journal of Integer Sequences [electronic only]
Similarity:
Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing
Petr Vaněk, Marian Brezina (2013)
Applications of Mathematics
Similarity:
We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. We use a special polynomial smoother that originates in the context of the smoothed aggregation method. Assuming the degree of the smoothing polynomial is, on each level , at least , we prove a convergence result independent of . The suggested smoother is cheaper than the overlapping Schwarz method that allows to prove the same result. Moreover, unlike in the case of the overlapping Schwarz...
On variants of Conway and Conolly's meta-Fibonacci recursions.
Isgur, Abraham, Rahman, Mustazee (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Regular Expression Quantifiers - m to n Occurrences
Michał Trybulec (2007)
Formalized Mathematics
Similarity:
This article includes proofs of several facts that are supplemental to the theorems proved in [10]. Next, it builds upon that theory to extend the framework for proving facts about formal languages in general and regular expression operators in particular. In this article, two quantifiers are defined and their properties are shown: m to n occurrences (or the union of a range of powers) and optional occurrence. Although optional occurrence is a special case of the previous operator (0...