Related papers: A conjecture on the Crazy Knight's Tour Problem

Chaos, namely exponential sensitivity to initial conditions, is generally considered a nuisance, inasmuch as it prevents long-term predictions in physical systems. Here, we present an easily accessible approach to undo deterministic chaos…

We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard. The proposed algorithm for this problem has…

We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…

In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…

We treat $n$-dimensional piecewise-linear continuous maps with two pieces, each of which has exactly one unstable direction, and identify an explicit set of sufficient conditions for the existence of a chaotic attractor. The conditions…

We propose that the statistics of the optimal tour in the planar random Euclidean traveling salesman problem is conformally invariant on large scales. This is exhibited in power-law behavior of the probabilities for the tour to zigzag…

A graph $G$ is {\em well-covered} if every maximal independent set has the same cardinality $q$. Let $i_k(G)$ denote the number of independent sets of cardinality $k$ in $G$. Brown, Dilcher, and Nowakowski conjectured that the independence…

The long standing issue known as the hot QCD collinear singularity problem has been proven to rely on an incorrect sequence of two mathematical operations. Here, the original derivation of this problem is entirely revisited within the…

A Latin square of order $n$ is an $n$ by $n$ grid filled using $n$ symbols so that each symbol appears exactly once in each row and column. A transversal in a Latin square is a collection of cells which share no symbol, row or column. The…

We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…

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…

The classical spectral Tur\'{a}n problem is to determine the maximum spectral radius of an $\mathcal{F}$-free graph of order $n$. Zhai and Wang [Linear Algebra Appl, 437 (2012) 1641-1647] determined the maximum spectral radius of…

We prove that for a large and important class of $C^1$ twist maps of the torus periodic and quasi-periodic orbits of a new type exist, provided that there are no rotational invariant circles (R.I.C's). These orbits have a non-zero…

During their investigation of power-sequence terraces, Anderson and Preece briefly mention a construction of a terrace for the cyclic group $\mathbb{Z}_n$ when $n$ is odd and $2n+1$ is prime; it is built using the discrete logarithm modulo…

We study graduated orders over completed group rings of $1$-dimensional admissible $p$-adic Lie groups, and verify the equivariant $p$-adic Artin conjecture for such orders. Following Jacobinski and Plesken, we obtain a formula for the…

The Covering Salesman Problem (CSP) is a generalization of the Traveling Salesman Problem in which the tour is not required to visit all vertices, as long as all vertices are covered by the tour. The objective of CSP is to find a minimum…

Building on the results of our previous work on Euclidean leaper tours, considering all integers $k>1$ and $h>0$, we study the existence of Hamiltonian cycles in the vertex set $C(2,k):=\{0,1\}^k$ of the $k$-dimensional hypercube when the…

In this paper we study the inverse Dirichlet-to-Neumann problem for certain cylindrical electrical networks. We define and study a birational transformation acting on cylindrical electrical networks called the electrical $R$-matrix. We use…

The Traveling Tournament Problem is a sports-scheduling problem where the goal is to minimize the total travel distance of teams playing a double round-robin tournament. The constraint 'k' is an imposed upper bound on the number of…

This paper is concerned with closed orbits of non-smooth vector fields on the plane. For a subclass of non-smooth vector fields we provide necessary and sufficient conditions for the existence of canard kind solutions. By means of a…