An application of a general Tauberian remainder theorem
نویسندگان
چکیده
منابع مشابه
Application of a Tauberian theorem to finite model theory
An extension of a Tauberian theorem of Hardy and Littlewood is proved. It is used to show that, for classes of finite models satisfying certain combinatorial and growth properties, Cesfiro probabilities (limits of average probabilities over second order sentences) exist. Examples of such classes include the class of unary functions and the class of partial unary functions. It is conjectured tha...
متن کاملA Tauberian Theorem for Stretchings
R. C. Buck fl] has shown that if a regular matrix sums every subsequence of a sequence x, then x is convergent. I. J. Maddox [4] improved Buck's theorem by showing that if a non-Schur matrix sums every subsequence of a sequence x, then x is convergent. Actually Maddox proved a stronger result: If x is divergent and A sums every subsequence of x, then A is a Schur matrix, i.e., It should be rema...
متن کاملGeneral Secret Sharing Based on the Chinese Remainder Theorem
In this paper we extend the threshold secret sharing schemes based on the Chinese remainder theorem in order to deal with more general access structures. Aspects like verifiability, secret sharing homomorphisms and multiplicative properties are also discussed. AMS Subject Classification: 94A62, 11A07
متن کاملA uniform Tauberian theorem in optimal control
In an optimal control framework, we consider the value VT (x) of the problem starting from state x with finite horizon T , as well as the value Wλ(x) of the λ-discounted problem starting from x. We prove that uniform convergence (on the set of states) of the values VT (·) as T tends to infinity is equivalent to uniform convergence of the values Wλ(·) as λ tends to 0, and that the limits are ide...
متن کاملA Multivariable Chinese Remainder Theorem
Using an adaptation of Qin Jiushao’s method from the 13th century, it is possible to prove that a system of linear modular equations ai1xi + · · · + ainxn = ~bi mod ~ mi, i = 1, . . . , n has integer solutions if mi > 1 are pairwise relatively prime and in each row, at least one matrix element aij is relatively prime to mi. The Chinese remainder theorem is the special case, where A has only one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arkiv för Matematik
سال: 1975
ISSN: 0004-2080
DOI: 10.1007/bf02386206