Covering a chessboard with staircase walks
نویسندگان
چکیده
An ascending (resp., descending) staircase walk on a chessboard is a rook’s path that goes either right or up (resp., down) in each step. We show that the minimum number of staircase walks that together visit every square of an n× n chessboard is d 3ne .
منابع مشابه
Covering a rectangular chessboard with staircase walks
Let C(n,m) be a n×m chessboard. An ascending (respectively descending) staircasewalk on C(n,m) is a rook’s path on C(n,m) that in every step goes either right or up (respectively right or down). We determine the minimal number of ascending and descending staircase walks covering C(n,m). © 2015 Elsevier B.V. All rights reserved.
متن کاملSampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method
Staircase walks are lattice paths from to which take diagonal steps and which never fall below the -axis. A path hitting the -axis times is assigned a weight of where . A simple local Markov chain which connects the state space and converges to the Gibbs measure (which normalizes these weights) is known to be rapidly mixing when , and can easily be shown to be rapidly mixing when . We give the ...
متن کاملStaircase polygons: moments of diagonal lengths and column heights
We consider staircase polygons, counted by perimeter and sums of k-th powers of their diagonal lengths, k being a positive integer. We derive limit distributions for these parameters in the limit of large perimeter and compare the results to Monte-Carlo simulations of self-avoiding polygons. We also analyse staircase polygons, counted by width and sums of powers of their column heights, and we ...
متن کاملOn Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملSelf-avoiding walks and trails on the 3.12 lattice
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 313 شماره
صفحات -
تاریخ انتشار 2013