A Finite Partition Theorem with Double Exponential Bound
نویسنده
چکیده
We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set. I thank Alice Leonhardt for excellent typing. Research supported by the United States-Israel Binational Science Foundation Publication number 515; Latest Revision 02/95 Done Erdős 80th birthday meeting in Keszthely, Hungary; July 1993 Typeset by AMS-TEX 1
منابع مشابه
Solution of Troesch's problem through double exponential Sinc-Galerkin method
Sinc-Galerkin method based upon double exponential transformation for solving Troesch's problem was given in this study. Properties of the Sinc-Galerkin approach were utilized to reduce the solution of nonlinear two-point boundary value problem to same nonlinear algebraic equations, also, the matrix form of the nonlinear algebraic equations was obtained.The error bound of the method was found. ...
متن کاملA Practical Algorithm for Reformulation of Deductive Databases
Database Reformulation is the process of rewriting the data and rules in deductive databases in a functionally equivalent manner, ideally in ways that decrease query processing time while keeping storage costs within acceptable bounds. Early research in this area focussed on materializing existing views, i.e. caching those views as data. Subsequent research extended this work to the problem of ...
متن کاملAnalysis of Axisymmetric Extrusion Process through Dies of any Shape with General Shear Boundaries
In this paper, a generalized expression for the flow field in axisymmetric extrusion process is suggested to be valid for any dies and the boundary shapes of the plastic deformation zone. The general power terms are derived and the extrusion force is calculated by applying upper bound technique for a streamlined die shape and exponential functions for shear boundaries. It is shown that assuming...
متن کاملExponential Triples
Using ultrafilter techniques we show that in any partition of N into 2 cells there is one cell containing infinitely many exponential triples, i.e. triples of the kind a, b, ab (with a, b > 1). Also, we will show that any multiplicative IP ∗ set is an “exponential IP set”, the analogue of an IP set with respect to exponentiation. Introduction A well-known theorem by Hindman states that given an...
متن کاملCompositional Abstraction for Concurrent Programs
We present a methodology for automatically constructing an abstraction of concurrent programs against safety specifications based on finite state machine. And then automatically extract an initial abstract model from source code using predicate abstraction and theorem proving. However, the process of extracting a finite model from a program using predicate abstraction can be exponential in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013