arXiv subjects
Publications and source records attributed to Ron Evans.
Given a real quadratic integer $u=A+B\sqrt{D}$ with cubic norm, we identify all the classes in a related form class group that represent primes $p$ for which $u$ is a cubic residue mod $p$. A special case of this result was conjectured in a 2025 paper of Evans, Lemmermeyer, Sun, and Van Veen.
For all $n > k \ge 1$, we give formulas for the nullity $N(n,k)$ of the $n \times n$ skew-symmetric Toeplitz band matrix whose first $k$ superdiagonals have all entries $1$ and whose remaining superdiagonals have all entries $0$. This is accomplished by counting the number of cycles in certain directed graphs. As an application, for each fixed integer $z\ge 0$ and large fixed $k$, we give an asymptotic formula for the percentage of $n > k$ satisfying $N(n,k)=z$. For the purpose of rapid computation, an algorithm is devised that quickly computes $N(n,k)$ even for extremely large values of $n$ and $k$.
Let $F$ be a field of $q$ elements, where $q$ is a power of an odd prime. Fix $n = (q+1)/2$. For each $s \in F$, we describe all the irreducible factors over $F$ of the polynomial $g_s(y): = y^n + (1-y)^n -s$, and we give a necessary and sufficient condition on $s$ for $g_s(y)$ to be irreducible.
Let $M_n(K)$ denote the algebra of $n \times n$ matrices over a field $K$ of characteristic zero. A nonunital subalgebra $N \subset M_n(K)$ will be called a nonunital intersection if $N$ is the intersection of two unital subalgebras of $M_n(K)$. Appealing to recent work of Agore, we show that for $n \ge 3$, the dimension (over $K$) of a nonunital intersection is at most $(n-1)(n-2)$, and we completely classify the nonunital intersections of maximum dimension $(n-1)(n-2)$. We also classify the unital subalgebras of maximum dimension properly contained in a parabolic subalgebra of maximum dimension in $M_n(K)$.
Let n > 1 be an integer, and let F denote a field of p elements for a prime p = 1 (mod n). By 2015, the question of existence or nonexistence of n-th power residue difference sets in F had been settled for all n < 24. We settle the case n = 24 by proving the nonexistence of 24-th power residue difference sets in F. We also prove the nonexistence of qualified 24-th power residue difference sets in F. The proofs make use of a Mathematica program which computes formulas for the cyclotomic numbers of order 24 in terms of parameters occurring in quadratic partitions of p.
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 expressed interest in finding a more straightforward direct proof. The first author recently gave such a proof of his identities when q = 1 (mod 4), and this paper provides such a proof for the remaining case q = 3 (mod 4). Our proofs are valid for all characteristics p > 2. Along the way we prove some elegant new character sum identities.
In 1984, the second author conjectured a quadratic transformation formula which relates two hypergeometric 2F1 functions over a finite field F_q. We prove this conjecture and give an application. The proof depends on a new linear transformation formula for pseudo hypergeometric functions over F_q.
Let P be a permutation expressed as a product of nontrivial disjoint cycles. When writing P as a product of distinct transpositions none equal to a factor of P, what is the smallest number of transpositions that can be used? We answer this question and give applications to mind-switching problems that have arisen in connection with the popular sci-fi television series Futurama and Stargate SG-1.
Many problems in additive number theory, such as Fermat's last theorem and the twin prime conjecture, can be understood by examining sums or differences of a set with itself. A finite set $A \subset \mathbb{Z}$ is considered sum-dominant if $|A+A|>|A-A|$. If we consider all subsets of ${0, 1, ..., n-1}$, as $n\to\infty$ it is natural to expect that almost all subsets should be difference-dominant, as addition is commutative but subtraction is not; however, Martin and O'Bryant in 2007 proved that a positive percentage are sum-dominant as $n\to\infty$. This motivates the study of "coordinate sum dominance". Given $V \subset (\Z/n\Z)^2$, we call $S:={x+y: (x,y) \in V}$ a coordinate sumset and $D:=\{x-y: (x,y) \in V\}$ a coordinate difference set, and we say $V$ is coordinate sum dominant if $|S|>|D|$. An arithmetically interesting choice of $V$ is $\bar{H}_2(a;n)$, which is the reduction modulo $n$ of the modular hyperbola $H_2(a;n) := {(x,y): xy \equiv a \bmod n, 1 \le x,y < n}$. In 2009, Eichhorn, Khan, Stein, and Yankov determined the sizes of $S$ and $D$ for $V=\bar{H}_2(1;n)$ and investigated conditions for coordinate sum dominance. We extend their results to reduced $d$-dimensional modular hyperbolas $\bar{H}_d(a;n)$ with $a$ coprime to $n$.
An episode of Futurama features a two-body mind-switching machine which will not work more than once on the same pair of bodies. After the Futurama community engages in a mind-switching spree, the question is asked, "Can the switching be undone so as to restore all minds to their original bodies?" Ken Keeler found an algorithm that undoes any mind-scrambling permutation with the aid of two "outsiders." We refine Keeler's result by providing a more efficient algorithm that uses the smallest possible number of switches. We also present best possible algorithms for undoing two natural sequences of switches, each sequence effecting a cyclic mind-scrambling permutation in the symmetric group S_n. Finally, we give necessary and sufficient conditions on m and n for the identity permutation to be expressible as a product of m distinct transpositions in S_n.