Finite canonization

Saharon Shelah

Commentationes Mathematicae Universitatis Carolinae (1996)

  • Volume: 37, Issue: 3, page 445-456
  • ISSN: 0010-2628

Abstract

top
The canonization theorem says that for given m , n for some m * (the first one is called E R ( n ; m ) ) we have for every function f with domain [ 1 , , m * ] n , for some A [ 1 , , m * ] m , the question of when the equality f ( i 1 , , i n ) = f ( j 1 , , j n ) (where i 1 < < i n and j 1 < j n are from A ) holds has the simplest answer: for some v { 1 , , n } the equality holds iff v i = j . We improve the bound on E R ( n , m ) so that fixing n the number of exponentiation needed to calculate E R ( n , m ) is best possible.

How to cite

top

Shelah, Saharon. "Finite canonization." Commentationes Mathematicae Universitatis Carolinae 37.3 (1996): 445-456. <http://eudml.org/doc/247904>.

@article{Shelah1996,
abstract = {The canonization theorem says that for given $m,n$ for some $m^*$ (the first one is called $ER(n;m)$) we have for every function $f$ with domain $[\{1,\cdots ,m^*\}]^n$, for some $A \in [\{1,\cdots ,m^*\}]^m$, the question of when the equality $f(\{i_1,\cdots ,i_n\}) = f(\{j_1,\cdots ,j_n\})$ (where $i_1 < \cdots < i_n$ and $j_1 < \cdots j_n$ are from $A$) holds has the simplest answer: for some $v \subseteq \lbrace 1,\cdots ,n\rbrace $ the equality holds iff $\bigwedge _\{\ell \in v\} i_\ell = j_\ell $. We improve the bound on $ER(n,m)$ so that fixing $n$ the number of exponentiation needed to calculate $ER(n,m)$ is best possible.},
author = {Shelah, Saharon},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {Ramsey theory; Erdös-Rado theorem; canonization; Ramsey theory; Erdös-Rado theorem; canonization},
language = {eng},
number = {3},
pages = {445-456},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Finite canonization},
url = {http://eudml.org/doc/247904},
volume = {37},
year = {1996},
}

TY - JOUR
AU - Shelah, Saharon
TI - Finite canonization
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1996
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 37
IS - 3
SP - 445
EP - 456
AB - The canonization theorem says that for given $m,n$ for some $m^*$ (the first one is called $ER(n;m)$) we have for every function $f$ with domain $[{1,\cdots ,m^*}]^n$, for some $A \in [{1,\cdots ,m^*}]^m$, the question of when the equality $f({i_1,\cdots ,i_n}) = f({j_1,\cdots ,j_n})$ (where $i_1 < \cdots < i_n$ and $j_1 < \cdots j_n$ are from $A$) holds has the simplest answer: for some $v \subseteq \lbrace 1,\cdots ,n\rbrace $ the equality holds iff $\bigwedge _{\ell \in v} i_\ell = j_\ell $. We improve the bound on $ER(n,m)$ so that fixing $n$ the number of exponentiation needed to calculate $ER(n,m)$ is best possible.
LA - eng
KW - Ramsey theory; Erdös-Rado theorem; canonization; Ramsey theory; Erdös-Rado theorem; canonization
UR - http://eudml.org/doc/247904
ER -

References

top
  1. Erdös P., Rado R., A combinatorial theorem, Journal of the London Mathematical Society 25 (1950), 249-255. (1950) MR0037886
  2. Erdös P., Spencer J., Probabilistic Methods in Combinatorics, Academic Press, New York, 1974. MR0382007
  3. Graham R., Rothschild B., Spencer J., Ramsey Theory, Willey - Interscience Series in Discrete Mathematics, Willey, New York, 1980. Zbl0705.05061MR0591457
  4. Lefmann H., Rödl V., On canonical Ramsey numbers for complete graphs versus paths, Journal of Combinatorial Theory, ser. B 58 (1993), 1-13. (1993) MR1214886
  5. Lefmann H., Rödl V., preprint, . 
  6. Rado R., Note on canonical partitions, Bulletin London Mathematical Society 18 (1986), 123-126. (1986) Zbl0584.05006MR0818813
  7. Shelah S., A two-cardinal theorem, Proceedings of the American Mathematical Society 48 (1975), 207-213. (1975) Zbl0302.02017MR0357105

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.