Related papers: Concerning the bookshelf problem
A deck of $n$ cards is shuffled by repeatedly moving the top card to one of the bottom $k_n$ positions uniformly at random. We give upper and lower bounds on the total variation mixing time for this shuffle as $k_n$ ranges from a constant…
We generalize the recent results of Chaiken et al. to a rectangular $m\times n$ chessboard. An explicit formula for the number of nonattacking configurations of one-move riders on such a chessboard is calculated in two different ways, one…
It is demonstrated that the canonical distribution for a subsystem of a closed system follows directly from the solution of the time-reversible Newtonian equation of motion in which the total energy is strictly conserved. It is shown that…
The Tsetlin library is a very well studied model for the way an arrangement of books on a library shelf evolves over time. One of the most interesting properties of this Markov chain is that its spectrum can be computed exactly and that the…
The pebble-motion on graphs is a subcategory of multi-agent pathfinding problems dealing with moving multiple pebble-like objects from a node to a node in a graph with a constraint that only one pebble can occupy one node at a given time.…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
A simple random walk and a Brownian motion are considered on a spider that is a collection of half lines (we call them legs) joined in the origin. We give a strong approximation of these two objects and their local times. For fixed number…
The frog model is a stochastic model for the spreading of an epidemic on a graph, in which a dormant particle starts to perform a simple random walk on the graph and to awake other particles, once it becomes active. We study two versions of…
Given two positive real numbers $M$ and $m$ and an integer $n>2$, it is well known that we can find a family of solutions of the $(n+1)$-body problem where the body with mass $M$ stays put at the origin and the other $n$ bodies, all with…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
We study the probability of making an error if, by querying an oracle a fixed number of times, we declare constant a randomly chosen n-bit Boolean function. We compare the classical and the quantum case, and we determine for how many…
I discuss how five reasonably sounding assumptions lead to a dilemma -- the Page-time paradox -- , which appears to challenge a conventional statistical mechanical underpinning of black hole thermodynamics. By inspecting the conceptual…
Given a positive integer $n$, consider a random permutation $\tau$ of the set $\{1,2,\ldots, n\}$. In $\tau$, we look for sequences of consecutive integers that appear in adjacent positions: a maximal such a sequence is called a block. Each…
We study the algorithmic problem of optimally covering a tree with $k$ mobile robots. The tree is known to all robots, and our goal is to assign a walk to each robot in such a way that the union of these walks covers the whole tree. We…
Given $k\ge 3$ heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most $k-1$ heaps, or to remove the {\sl same} positive number of tokens from all the $k$ heaps. We analyse…
In the classical (non-quantum) relativity theory the course of the moving clock is dilated as compared to the course of the clock at rest (the Einstein dilation). Any unstable system may be regarded as a clock. The time evolution (e.g., the…
In this paper we treat the so called clock paradox in an analytical way by assuming that a constant and uniform force F of finite magnitude acts continuously on the moving clock along the direction of its motion assumed to be rectilinear.…
We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically…
We model a long queue of humans by a continuous-space model in which, when a customer moves forward, they stop a random distance behind the previous customer, but do not move at all if their distance behind the previous customer is below a…
We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…