scholarly journals Hindmanʼs coloring theorem in arbitrary semigroups

2013 ◽  
Vol 395 ◽  
pp. 111-120 ◽  
Author(s):  
Gili Golan ◽  
Boaz Tsaban
Keyword(s):  
2013 ◽  
Vol 78 (1) ◽  
pp. 17-38 ◽  
Author(s):  
Todd Eisworth

AbstractWe formulate and prove (in ZFC) a strong coloring theorem which holds at successors of singular cardinals, and use it to answer several questions concerning Shelah's principle Pr1(μ+,μ+,μ+, cf (μ)) for singularμ.


1985 ◽  
Vol 58 (3) ◽  
pp. 131 ◽  
Author(s):  
Saul Stahl

1985 ◽  
Vol 58 (3) ◽  
pp. 131-145 ◽  
Author(s):  
Saul Stahl

2011 ◽  
Vol 48 (3) ◽  
pp. 766-777 ◽  
Author(s):  
Kouji Yano ◽  
Kenji Yasutomi

An ergodic Markov chain is proved to be the realization of a random walk in a directed graph subject to a synchronizing road coloring. The result ensures the existence of appropriate random mappings in Propp-Wilson's coupling from the past. The proof is based on the road coloring theorem. A necessary and sufficient condition for approximate preservation of entropies is also given.


1997 ◽  
Vol 11 (21n22) ◽  
pp. 923-928
Author(s):  
Ranjan Chaudhury ◽  
Debashis Gangopadhyay ◽  
Samir K. Paul

We find a non-invertible matrix representation for Van der Waerden's coloring theorem for two distinct colors in a one-dimensional periodic lattice. Using this, an infinite one-dimensional antiferromagnetic Ising system is mapped to a pseudo-ferromagnetic one, thereby relating the couplings. All this is reminiscent of renormalization group.


2001 ◽  
Vol 17 (2) ◽  
pp. 329-341 ◽  
Author(s):  
Daniel P. Sanders ◽  
Yue Zhao
Keyword(s):  

COMBINATORICA ◽  
2005 ◽  
Vol 25 (3) ◽  
pp. 355-366 ◽  
Author(s):  
Radhika Ramamurthi ◽  
Douglas B. West*

Sign in / Sign up

Export Citation Format

Share Document