401 and beyond: improved bounds and algorithms for the Ramsey algebra search
نویسنده
چکیده
In this paper, we discuss an improvement of an algorithm to search for primes p and coset-partitions of (Z/pZ) that yield Ramsey algebras over Z/pZ. We also prove an upper bound on the modulus p in terms of the number of cosets. We have, as a corollary, that there is no prime p for which there exists a partition of (Z/pZ) into 13 cosets that yields a 13-color Ramsey algebra. Thus A263308(13) = 0.
منابع مشابه
Zarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملExperiments of Intelligent Algorithms on Ramsey Graphs
Ramsey numbers are known to be hard combinatorial problems that have many important applications including number theory, algebra, geometry, topology, set theory, logic, ergodic theory, information theory, and theoretical computer science. The evaluation of Ramsey numbers using intelligent algorithms has been extensively studied in the last decades and only few numbers are currently known. Almo...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملOn Some Small Classical Ramsey Numbers
This note is a report on a computer investigation of some small classical Ramsey numbers. We establish new lower bounds for the classical Ramsey numbers R(3, 11) and R(4, 8). In the first case, the bound is improved from 46 (a record that had stood for 46 years) to 47; and in the second case the bound is improved from 57 to 58. The classical Ramsey number R(s, t) is the smallest integer n such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1609.01817 شماره
صفحات -
تاریخ انتشار 2016