Related papers: The Second Leaper Theorem
We provide the following result and its discrete equivalent: Let $f \colon I^n \to \mathbb{R}^{n-1}$ be a continuous function. Then, there exist a point $p \in \mathbb{R}^{n-1}$ and a compact subset $S \subset…
A generalized attracting horseshoe is introduced as a new paradigm for describing chaotic strange attractors (of arbitrary finite rank) for smooth and piecewise smooth maps f from Q to Q, where Q is a homeomorph of the unit interval in real…
In classical homotopy theory, two spaces are homotopy equivalent if one space can be continuously deformed into the other. This theory, however, does not respect the discrete nature of graphs. For this reason, a discrete homotopy theory…
The rook graph is a graph whose edges represent all the possible legal moves of the rook chess piece on a chessboard. The problem we consider is the following. Given any set $M$ containing pairs of cells such that each cell of the $m_1…
We provide two methodologies in the area of computation theory to solve optimal strategies for board games such as Xi Gua Qi and Go. From experimental results, we find relevance to graph theory, matrix representation, and mathematical…
A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalities between these pieces. It provides a stability certificate…
The Maker-Breaker connectivity game and Hamilton cycle game belong to the best studied games in positional games theory, including results on biased games, games on random graphs and fast winning strategies. Recently, the Connector-Breaker…
Seymour's second neighbourhood conjecture asserts that every oriented graph has a vertex whose second out-neighbourhood is at least as large as its out-neighbourhood. In this paper, we prove that the conjecture holds for quasi-transitive…
Once recognizing that point particles moving inside the extended version of the rippled billiard perform L\'evy flights characterized by a L\'evy-type distribution $P(\ell)\sim \ell^{-(1+\alpha)}$ with $\alpha=1$, we derive a generalized…
Chess graphs encode the moves that a particular chess piece can make on an $m\times n$ chessboard. We study through these graphs through the lens of chip-firing games and graph gonality. We provide upper and lower bounds for the gonality of…
Cops and robbers is a pursuit-evasion game played on graphs. We completely classify the cop numbers for $n \times n$ knight graphs and queen graphs. This completes the classification of the cop numbers for all $n \times n$ classical chess…
We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…
Clobber is an alternate-turn two-player game introduced in 2001 by Albert, Grossman, Nowakowski and Wolfe. The board is a graph with each node colored black (x), white (o), or empty (-). Player Left has black stones, player Right has white…
We address the properties of continuous-time quantum walks with Hamiltonians of the form $\mathcal{H}= L + \lambda L^2$, being $L$ the Laplacian matrix of the underlying graph and being the perturbation $\lambda L^2$ motivated by its…
In a set of experiments, Couder et. al. demonstrate that an oscillating fluid bed may propagate a bouncing droplet through the guidance of the surface waves. We present a dynamical systems model, in the form of an iterative map, for a…
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…
In this paper, we prove a second main theorem for a holomorphic curve $f$ into $\mathbb P^N (\mathbb C)$ with a family of slowly moving hypersurfaces $D_1,...,D_q$ with respect to $f$ in $m$-subgeneral position, proving an inequality with…
A class of graphs $\mathscr{C}$ is monadically stable if for any unary expansion $\widehat{\mathscr{C}}$ of $\mathscr{C}$, one cannot interpret, in first-order logic, arbitrarily long linear orders in graphs from $\widehat{\mathscr{C}}$. It…
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…
Finding a Hamiltonian cycle in a given graph is computationally challenging, and in general remains so even when one is further given one Hamiltonian cycle in the graph and asked to find another. In fact, no significantly faster algorithms…