Related papers: Leaper Tours

Let $G$ be a strongly regular graph of prime order $p$ with connection degree $k \geq 6$. We prove that the \emph{quantum walk characteristic polynomial} $\chi_q(G,\lambda) \coloneqq \det(\lambda I - U_G)$, where $U_G$ is the coined quantum…

We introduce the random graph $\mathcal{P}(n,q)$ which results from taking the union of two paths of length $n\geq 1$, where the vertices of one of the paths have been relabelled according to a Mallows permutation with parameter $0<q(n)\leq…

A cap in PG(r,q) is a set of points, no three of which are collinear. A cap is said to be transitive if its automorphism group in PGammaL(r+1,q) acts transtively on the cap, and co-transitive if the automorphism group acts transtively on…

For integer $k\geq2$ and prime power $q$, the algebraic bipartite graph $D(k,q)$ proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also in coding theory and cryptography. This graph is…

In this paper, $p$ and $q$ are two different odd primes. First, We construct the congruent elliptic curves corresponding to $p$, $2p$, $pq$, and $2pq,$ then, in the cases of congruent numbers, we determine the rank of the corresponding…

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 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…

Let $P$ be an $N$-element point set in the plane. Consider $N$ (pointlike) grasshoppers sitting at different points of $P$. In a "legal" move, any one of them can jump over another, and land on its other side at exactly the same distance.…

The paper provides a complement to the classical results on Fourier multipliers on $L^p$ spaces. In particular, we prove that if $q\in (1,2)$ and a function $m:\mathbb{R} \rightarrow \mathbb{C}$ is of bounded $q$-variation uniformly on the…

A convolution operator in $\mathbb{R}^d$ with kernel in $L_q$ acts from $L_p$ to $L_s$, where $1/p+1/q=1+1/s$. The main theorem states that if $1<q,p,s<\infty$, then there exists an $L_p$ function of unit norm on which the $s$-norm of the…

The Fermat quotient $q_p(a):=(a^{p-1}-1)/p$, for prime $p\nmid a$, and the Wilson quotient $w_p:=((p-1)!+1)/p$ are integers. If $p\mid w_p,$ then $p$ is a Wilson prime. For odd $p,$ Lerch proved that $(\sum_{a=1}^{p-1} q_p(a) - w_p)/p$ is…

Suppose we are given a homogeneous tree $\mathcal{T}_q$ of degree $q\geq 3$, where at each vertex sits a lamp, which can be switched on or off. This structure can be described by the wreath product $(\mathbb{Z}/2)\wr \Gamma$, where…

A simple symmetric random walk is considered on a spider that is a collection of half lines (we call them legs) joined at the origin. We establish a strong approximation of this random walk by the so-called Brownian spider. Transition…

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…

We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…

Let $p>3$ be a prime and $b\ge 2$ an integer such that $p$ does not divide $b$. Then $1/p$ has a periodic digit expansion with respect to the basis $b$. The length $q$ of the period is the (multiplicative) order of $b$ mod $p$. In the case…

Parts I-IV showed that the number of ways to place $q$ nonattacking queens or similar chess pieces on an $n\times n$ chessboard is a quasipolynomial function of $n$ whose coefficients are essentially polynomials in $q$. For partial queens,…

A conjecture connected with quantum physics led N. Katz to discover some amazing mixed character sum identities over a field of q elements, where q is a power of a prime p > 3. His proof required deep algebro-geometric techniques, and he…

The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…

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…