ترغب بنشر مسار تعليمي؟ اضغط هنا

Symmetric 1-Dependent Colorings of the Integers

170   0   0.0 ( 0 )
 نشر من قبل Alexander E. Holroyd
 تاريخ النشر 2014
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

In a recent paper by the same authors, we constructed a stationary 1-dependent 4-coloring of the integers that is invariant under permutations of the colors. This was the first stationary k-dependent q-coloring for any k and q. When the analogous construction is carried out for q>4 colors, the resulting process is not k-dependent for any k. We construct here a process that is symmetric in the colors and 1-dependent for every q>=4. The construction uses a recursion involving Chebyshev polynomials evaluated at $sqrt{q}/2$.



قيم البحث

اقرأ أيضاً

This paper is concerned with symmetric $1$-dependent colorings of the $d$-ray star graph $mathscr{S}^d$ for each $d ge 2$. We compute the critical point of the $1$-dependent hard-core processes on $mathscr{S}^d$, which gives a lower bound for the num ber of colors needed for a $1$-dependent coloring of $mathscr{S}^d$. We provide an explicit construction of a $1$-dependent $q$-coloring for any $q ge 5$ of the infinite subgraph $mathscr{S}^3_{(1,1,infty)}$, which is symmetric in the colors and whose restriction to any copy of $mathbb{Z}$ is some symmetric $1$-dependent $q$-coloring of $mathbb{Z}$. We also prove that there is no such coloring of $mathscr{S}^3_{(1,1,infty)}$ with $q = 4$ colors. A list of open problems are presented.
Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami models with on e module per skeleton edge. Consider a coloring in which each edge of a given component receives a different color, and where the coloring (up to global color permutation) is invariant under the polypolyhedrons symmetry group. On the Five Intersecting Tetrahedra, the edges of each color form visual bands on the model, and correspond to matchings on the dodecahedron graph. We count the number of such colorings and give three proofs. For each of the non-polygon-component polypolyhedra, there is a corresponding matching coloring, and we count the number of these matching colorings. For some of the non-polygon-component polypolyhedra, there is a corresponding visual-band coloring, and we count the number of these band colorings.
We prove that proper coloring distinguishes between block-factors and finitely dependent stationary processes. A stochastic process is finitely dependent if variables at sufficiently well-separated locations are independent; it is a block-factor if i t can be expressed as an equivariant finite-range function of independent variables. The problem of finding non-block-factor finitely dependent processes dates back to 1965. The first published example appeared in 1993, and we provide arguably the first natural examples. More precisely, Schramm proved in 2008 that no stationary 1-dependent 3-coloring of the integers exists, and conjectured that no stationary k-dependent q-coloring exists for any k and q. We disprove this by constructing a 1-dependent 4-coloring and a 2-dependent 3-coloring, thus resolving the question for all k and q. Our construction is canonical and natural, yet very different from all previous schemes. In its pure form it yields precisely the two finitely dependent colorings mentioned above, and no others. The processes provide unexpected connections between extremal cases of the Lovasz local lemma and descent and peak sets of random permutations. Neither coloring can be expressed as a block-factor, nor as a function of a finite-state Markov chain; indeed, no stationary finitely dependent coloring can be so expressed. We deduce extensions involving d dimensions and shifts of finite type; in fact, any non-degenerate shift of finite type also distinguishes between block-factors and finitely dependent processes.
50 - Will Perkins , Changji Xu 2021
We prove, under an assumption on the critical points of a real-valued function, that the symmetric Ising perceptron exhibits the `frozen 1-RSB structure conjectured by Krauth and Mezard in the physics literature; that is, typical solutions of the mod el lie in clusters of vanishing entropy density. Moreover, we prove this in a very strong form conjectured by Huang, Wong, and Kabashima: a typical solution of the model is isolated with high probability and the Hamming distance to all other solutions is linear in the dimension. The frozen 1-RSB scenario is part of a recent and intriguing explanation of the performance of learning algorithms by Baldassi, Ingrosso, Lucibello, Saglietti, and Zecchina. We prove this structural result by comparing the symmetric Ising perceptron model to a planted model and proving a comparison result between the two models. Our main technical tool towards this comparison is an inductive argument for the concentration of the logarithm of number of solutions in the model.
We compute the best constant in the Khintchine inequality under assumption that the sum of Rademacher random variables is zero.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا