SearcharxivSearch

arXiv subjects

Andrew Pendleton

Publications and source records attributed to Andrew Pendleton.

3 recordsLinked to original sources

Multiplicities of eigenvalues and quadratic representations of integers

We study the set $M$ of all multiplicities of non-zero eigenvalues for the Laplace operator on a two-dimensional rectangle or torus. We show that for a rectangle with the side length ratio $r$, $M=\mathbb{N}$, the set of all positive integers, if and only if $r^2$ is rational. For a torus whose generating vectors have a length ratio $r$ and the angle between them $\theta$, we show that $M$ is an infinite set if and only if both $r\cos\theta$ and $r^2$ are rational. In this case, $M=2\mathbb{N}$, $4\mathbb{N}$, or $6\mathbb{N}$, and we obtain a characterization for each of these cases in term of $r\cos\theta$ and $r^2$. In the case when at least one of $r\cos\theta$ or $r^2$ is irrational, we show that $M=\{2\}$ or $\{2, 4\}$, and obtain a characterization for these cases. We prove these results by studying the number of integral lattice points on dilated ellipses.

math.NT

Enumeration and Distribution of Permutation Rows and Columns in Equi-$n$-Squares

We introduce consecutive equi-$n$-squares, a variant of equi-$n$-squares in which at least one row or column forms a fixed permutation of $\{1,\dots,n\}$, taken for concreteness to be $(1,\dots,n)$. More generally, the enumeration and probabilistic arguments presented here extend to the occurrence of any prescribed permutation as a row or column of an equi-$n$-square. We derive exact and asymptotic formulas for the number of consecutive equi-$n$-squares, showing precisely how their proportion among all equi-$n$-squares rapidly approaches zero as $n\to\infty$. We also analyze the distribution of consecutive equi-$n$-squares under uniform random sampling and explore connections to algebraic structures, interpreting equi-$n$-squares and consecutive equi-$n$-squares as Cayley tables. Finally, we supplement our theoretical results with Monte Carlo simulations for small values of $n$.

math.CO

Improved Bounds for the Index Conjecture in Zero-Sum Theory

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the last 30 years, it is only recently that the conjecture has been proven for $n>10^{20}$. In this paper, we prove that said upper bound can be reduced to $4.6\cdot10^{13}$, and lower under certain coprimality conditions. Further, we verify the conjecture for $n<1.8\cdot10^6$ through the application of High Performance Computing (HPC).

math.NT