اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFirefighting on the Hexagonal Grid and on Infinite Trees
71
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The firefighter problem with $k$ firefighters on an infinite graph $G$ is an iterative graph process, defined as follows: Suppose a fire breaks out at a given vertex $vin V(G)$ on Turn 1. On each subsequent even turn, $k$ firefighters protect $k$ vertices that are not on fire, and on each subsequent odd turn, any vertex that is on fire spreads the fire to all adjacent unprotected vertices. The firefighters goal is to eventually stop the spread of the fire. If there exists a strategy for $k$ firefighters to eventually stop the spread of the fire, then we say $G$ is $k$-containable. We consider the firefighter problem on the hexagonal grid, which is the graph whose vertices and edges are exactly the vertices and edges of a regular hexagonal tiling of the plane. It is not known if the hexagonal grid is $1$-containable. In arXiv:1305.7076 [math.CO], it was shown that if the firefighters have one firefighter per turn and one extra firefighter on two turns, the firefighters can contain the fire. We improve on this result by showing that even with only one extra firefighter on one turn, the firefighters can still contain the fire. In addition, we explore $k$-containability for birth sequence trees, which are infinite rooted trees that have the property that every vertex at the same level has the same degree. A birth sequence forest is an infinite forest, each component of which is a birth sequence tree. For birth sequence trees and forests, the fire always starts at the root of each tree. We provide a pseudopolynomial time algorithm to decide if all the vertices at a fixed level can be protected or not.
قيم البحث
اقرأ أيضاً
Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called typical pr
ocesses) on the infinite $d$-regular tree $T_d$. This correspondence between ergodic theory on $T_d$ and random regular graphs is already proven to be fruitful in both directions. This paper continues the investigation of typical processes with a special emphasis on entropy. We study a natural notion of micro-state entropy for invariant processes on $T_d$. It serves as a quantitative refinement of the notion of typicality and is tightly connected to the asymptotic free energy in statistical physics. Using entropy inequalities, we provide new sufficient conditions for typicality for edge Markov processes. We also extend these notions and results to processes on unimodular Galton-Watson random trees.
We prove that for any tree with a vertex of degree at least six, its chromatic symmetric function is not $e$-positive, that is, it cannot be written as a nonnegative linear combination of elementary symmetric functions. This makes significant progres
s towards a recent conjecture of Dahlberg, She, and van Willigenburg, who conjectured the result for all trees with a vertex of degree at least four. We also provide a series of conditions that can identify when the chromatic symmetric function of a spider, a tree consisting of multiple paths identified at an end, is not $e$-positive. These conditions also generalize to trees and graphs with cut vertices. Finally, by applying a result of Orellana and Scott, we provide a method to inductively calculate certain coefficients in the elementary symmetric function expansion of the chromatic symmetric function of a spider, leading to further $e$-positivity conditions for spiders.
Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $alphainleft[ 0,1right],$ define the matrix $A_{alpha}left(Gright) $ as [ A_{alpha}left(Gright) =alpha Dleft(Gright) +(1-alpha
)Aleft(Gright) ] where $0leqalphaleq1$. This paper gives several results about the $A_{alpha}$-matrices of trees. In particular, it is shown that if $T_{Delta}$ is a tree of maximal degree $Delta,$ then the spectral radius of $A_{alpha}(T_{Delta})$ satisfies the tight inequality [ rho(A_{alpha}(T_{Delta}))<alphaDelta+2(1-alpha)sqrt{Delta-1}. ] This bound extends previous bounds of Godsil, Lovasz, and Stevanovic. The proof is based on some new results about the $A_{alpha}$-matrices of Bethe trees and generalized Bethe trees. In addition, several bounds on the spectral radius of $A_{alpha}$ of general graphs are proved, implying tight bounds for paths and Bethe trees.
The size-Ramsey number of a graph $F$ is the smallest number of edges in a graph $G$ with the Ramsey property for $F$, that is, with the property that any 2-colouring of the edges of $G$ contains a monochromatic copy of $F$. We prove that the size-Ra
msey number of the grid graph on $ntimes n$ vertices is bounded from above by $n^{3+o(1)}$.
An odd-rule cellular automaton (CA) is defined by specifying a neighborhood for each cell, with the rule that a cell turns ON if it is in the neighborhood of an odd number of ON cells at the previous generation, and otherwise turns OFF. We classify a
ll the odd-rule CAs defined by neighborhoods which are subsets of a 3 X 3 grid of square cells. There are 86 different CAs modulo trivial symmetries. When we consider only the different sequences giving the number of ON cells after n generations, the number drops to 48, two of which are the Moore and von Neumann CAs. This classification is carried out by using the meta-algorithm described in an earlier paper to derive the generating functions for the 86 sequences, and then removing duplicates. The fastest-growing of these CAs is neither the Fredkin nor von Neumann neighborhood, but instead is one defined by Odd-rule 365, which turns ON almost 75% of all possible cells.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
