Related papers: Leaper Tours

Fix distinct primes $p$ and $q$ and let $E$ be an elliptic curve defined over a number field $K$. The $(p,q)$-entanglement type of $E$ over $K$ is the isomorphism class of the group $\operatorname{Gal}(K(E[p])\cap K(E[q])/K)$. The size of…

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 study variations of classical combinatorial games on two finite heaps of tokens, a.k.a. \emph{subtraction games}. Given non-negative integers $p_1,q_1, p_2,q_2$, where $p_1q_2 > q_1p_2$, $p_1>0$ and $q_2>0$, two players alternate in…

The authors propose a new variation of random walks called ladder chains $L(r,s,p)$. We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take $L(2,2,p)$ for instance, we find…

We find all elliptic curves defined over $\mathbb{Q}$ that have a rational point of order $N$, $N\ge 4$, and whose conductor is of the form $p^aq^b$, where p, q are two distinct primes, a, b are two positive integers. In particular, we…

We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$. For a quadratic number field $K$ and an odd prime number $p$, let $L$ be a $\mathbb{Z}_p$-extension of $K$. We prove that $E(L)_{\text{tors}}=E(K)_{\text{tors}}$ when $p>5$. It enables…

We prove that a Hopf algebra of prime dimension $p$ over an algebraically closed field, whose characteristic is equal to $p$, is either a group algebra or a restricted universal enveloping algebra. Moreover, we show that any Hopf algebra of…

In this paper we contribute to the classification of Hopf algebras of dimension pq, where p,q are distinct prime numbers. More precisely, we prove that if p and q are odd primes with p<q<2p+3, then any complex Hopf algebra of dimension pq…

We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…

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…

We provide upper bounds on the $L(p,q)$-labeling number of graphs which have interval (or circular-arc) representations via simple greedy algorithms. We prove that there exists an $L(p,q)$-labeling with span at most…

Let K be a field of characteristic zero, n>4 an integer, f(x) an irreducible polynomial over K of degree n, whose Galois group is doubly transitive simple non-abelian group. Let p be an odd prime, Z[\zeta_p] the ring of integers in the p-th…

Let q be a power of a prime and n a positive integer. Let P(q) be a parabolic subgroup of the finite general linear group GL(n,q). We show that the number of P(q)-conjugacy classes in GL(n,q) is, as a function of q, a polynomial in q with…

For the integer $ D=pq$ of the product of two distinct odd primes, we construct an elliptic curve $E_{2rD}:y^2=x^3-2rDx$ over $\mathbb Q$, where $r$ is a parameter dependent on the classes of $p$ and $q$ modulo 8, and show, under the parity…

The Polya number of a classical random walk on a regular lattice is known to depend solely on the dimension of the lattice. For one and two dimensions it equals one, meaning unit probability to return to the origin. This result is extremely…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

In this paper we answer a question posed by R. Stanley in his collection of Bijection Proof Problems (Problem 240). We present a bijective proof for the enumeration of walks of length $k$ a chess rook can move along on an $m\times n$ board…

The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…

We show that two independent elephant random walks on the integer lattice $\mathbb{Z}$ meet each other finitely often or infinitely often depends on whether the memory parameter $p$ is strictly larger than $3/4$ or not. Asymptotic results…