Related papers: The Second Leaper Theorem
In chomp on graphs, two players alternatingly pick an edge or a vertex from a graph. The player that cannot move any more loses. The questions one wants to answer for a given graph are: Which player has a winning strategy? Can a explicit…
The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…
In this paper, we consider a class of continuous maps characterized by a singularity of order $x^{q/p}$ (with $p,q \in \mathbb{N}$, $p>q$, and $(p,q)=1$) on one side of the discontinuity boundary $\Sigma$ and a linear behaviour on the other…
By means of the Ehrhart theory of inside-out polytopes we establish a general counting theory for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen, on a polygonal convex board. The number of ways…
This paper is inspired by the PQ penny flip game. It employs group-theoretic concepts to study the original game and also its possible extensions. We show that the PQ penny flip game can be associated with the dihedral group $D_{8}$. We…
We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…
Let $P$ be a graph with a vertex $v$ such that $P\backslash v$ is a forest, and let $Q$ be an outerplanar graph. We prove that there exists a number $p=p(P,Q)$ such that every 2-connected graph of path-width at least $p$ has a minor…
Aspects of Poisson-Lie T-duality are reviewed in more algebraic way than in our, rather geometric, previous papers. As a new result, a moment map is constructed for the Poisson-Lie symmetry of the system consisting of open strings…
Suppose that you add rigid bars between points in the plane, and suppose that a constant fraction $q$ of the points moves freely in the whole plane; the remaining fraction is constrained to move on fixed lines called sliders. When does a…
By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…
A discrete-time Quantum Walk (QW) is essentially an operator driving the evolution of a single particle on the lattice, through local unitaries. Some QWs admit a continuum limit, leading to well-known physics partial differential equations,…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
A planar dual billiard is a planar curve $\gamma$ equipped with a family $(\sigma_P)|_{P\in\gamma}$ of projective involutions of the projective lines $L_P$ tangent to $\gamma$ at $P$ that fix $P$. A dual billiard is called rationally…
Quantum random walk in a two-dimensional lattice with randomly distributed traps is investigated. Distributions of quantum walkers are evaluated dynamically for the cases of Hadamard, Fourier, and Grover coins, and quantum to classical…
We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the…
It is shown that the elliptic algebra ${\cal A}_{q,p}(\hat{sl}(2)_c)$ at the critical level c=-2 has a multidimensional center containing some trace-like operators t(z). A family of Poisson structures indexed by a non-negative integer and…
The Gilbert graph $\text{Gilbert}(q,n,d)$, which arises naturally in graph theory and coding theory, is the regular graph on $\mathbb{F}_q^n$ in which two vertices are adjacent if their Hamming distance is less than $d$, and it is…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
We classify the second order, linear, two by two systems for which the two fundamental theorems for planar harmonic mappings, the Rado'-Kneser-Choquet Theorem and the H. Lewy Theorem, hold. They are those which, up to a linear change of…