Related papers: The Second Leaper Theorem
Let $Q$ be a finite subgraph of the integer grid $G$ in the plane, and let $T$ be a set of pairs of distinct vertices in $G$, called `terminal pairs'. Escaping a subset $X\subset T\cap Q$ from $Q$ means finding edge disjoint paths from the…
Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing: On the one hand, they can be efficiently simulated on a quantum computer. On the other hand, they are themselves…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
The centipede game is a two-player non-zero-sum game. Each turn, a player can choose whether they want to take or pass a growing reward. The classical, rational solution of this game shows defection in the first round, when in reality,…
We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.
We study a duality transformation from the gauge-invariant subspace of a $\mathbb{Z}_N$ lattice gauge theory on a two-leg ladder geometry to an $N$-clock model on a single chain. The main feature of this mapping is the emergence of a…
Weiqi is one of the most complex board games played by two persons. The placement strategies adopted by Weiqi players are often used to analog the philosophy of human wars. Contrary to the western chess, Weiqi games are less studied by…
We construct an infinite ternary tree $\mathfrak{L}$ whose root is the knight and whose vertices are all skew free leapers. We define the descent of a skew free leaper to be its "address" within $\mathfrak{L}$. We introduce three…
We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…
This paper considers a game in which a single cop and a single robber take turns moving along the edges of a given graph $G$. If there exists a strategy for the cop which enables it to be positioned at the same vertex as the robber…
We study two types of two player, perfect information games with no chance moves, played on the edge set of the binomial random graph ${\mathcal G}(n,p)$. In each round of the $(1 : q)$ Waiter-Client Hamiltonicity game, the first player,…
We prove that the homotopy class of a Morin mapping f: P^p --> Q^q with p-q odd contains a cusp mapping. This affirmatively solves a strengthened version of the Chess conjecture [DS Chess, A note on the classes [S_1^k(f)], Proc. Symp. Pure…
We describe two BQP-complete problems concerning properties of sparse graphs having a certain symmetry. The graphs are specified by efficiently computable functions which output the adjacent vertices for each vertex. Let i and j be two…
Poisson-Lie duality is a generalization of abelian and non-abelian T-duality, and it can be viewed as a map between solutions of the low-energy effective equations of string theory, i.e. at the (super)gravity level. We show that this fact…
A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…
In this paper we generalize to the non-abelian context a classical theorem of Griffiths which studies the behavior of the $(p,q)$-components of a horizontal section in a variation of Hodge structures over a smooth projective variety.
New examples of Cameron-Liebler line classes in $\mathrm{PG}(3,q)$ are given with parameter $\frac{1}{2}(q^2 -1)$. These examples have been constructed for many odd values of $q$ using a computer search, by forming a union of line orbits…
We offer a reader-friendly introduction to the attracting edge problem (also known as the "triangle conjecture") and its most general current solution of Limic and Tarr\`es (2007). Little original research is reported; rather this article…