The Maximal Order of Hyper-($b$-ary)-expansions
نویسندگان
چکیده
منابع مشابه
The Maximal Order of Hyper-(b-ary)-expansions
Using methods developed by Coons and Tyler, we give a new proof of a recent result of Defant, by determining the maximal order of the number of hyper-(b-ary)expansions of a nonnegative integer n for general integral bases b > 2.
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولMaximal Expansions of Database Updates
Databases with integrity constraints IC are considered For each DB update i e a set of facts to add and of facts to delete the IC implies its correct expansion new facts to add and new facts to delete Simultaneously each expanded update induces a correct simpli cation of the IC In the limit this sequence of expansions and simpli ca tions converges to the maximal correct update expansion indepen...
متن کاملCongruences for Hyper M-ary Overpartition Functions
We discuss a new restricted m-ary overpartition function hm(n), which is the number of hyper m-ary overpartitions of n, such that each power of m is allowed to be used at most m times as a non-overlined part. In this note we use generating function dissections to prove the following family of congruences for all n ≥ 0, m ≥ 4, j ≥ 0, 3 ≤ k ≤ m− 1, and t ≥ 1: hm(mn + mj+t−1k + · · · + mk) ≡ 0(mod...
متن کاملTranscendence of certain k-ary continued fraction expansions
Let ξ ∈ (0, 1) be an irrational with aperiodic continued fraction expansion: ξ = [0; u0, u1, u2, . . .], and suppose the sequence (un)n≥0 of partial quotients takes only values from the finite set {a1, a2, . . . , ak} with 1 ≤ a1 < a2 < · · · < ak, k ≥ 2. We prove that if the frequency of a1 (or ak) in (un)n≥0 is at least 1/2, and (un)n≥0 begins with arbitrarily long blocks that are almost squa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/5441