arXiv subjects
Publications and source records attributed to Geoffrey B. Campbell.
We give a variety of magic hexagons of Orders from 3 to 7, many of which are extensions of known results. We also give a theorem that their are an infinite number of magic hexagons of Order $n$ for any fixed positive integer $n$ for any arbitrary magic sum $M=m$ to be any desired integer $m$. We instigate theory and ideas associated with formula-based versions of the magic hexagons, which seem to be new.
We cover rational and integer solutions for the equations $\mathbf{x^y = y^x}$ and $\mathbf{x^y y^x = v^w w^v}$. The former equation solutions go back to Euler, and the latter equation solutions appear to be new. Another definitely new related topic is application of VPV identities to give transforms of infinite products from our solutions. The present paper is essentially chapter 28 of the author's book appearing in June 2024.
We set out an elementary approach to derive Visible Point Identities summed on lattice points of inverted triangle (2D), pyramid (3D), hyperpyramid (4D, 5D and so on) utilizing the greatest common divisor for the nD Visible Point Vectors. This enables study of partitions in nD space into vector parts distributed along straight lines radial from the origin in first hyperquadrant where coordinates of lattice points are all positive integers. We also give several new combinatorial identities for Visible Point Vector partitions.
We set the scene with known values and functional relations for dilogarithms, trilogarithms and polylogarithms of various orders, along with more recent Euler sum values and multidimensional computations paying homage to the three late Professors Borwein \textit{et al.}. We then apply many of these sum values to tabulate some sixty new combinatorial identities for weighted partitions into Visible Point Vectors in 2D, 3D, 4D and 5D cases suggesting new $n$D first hyperquadrant and hyperpyramid lattice point identities.
We prove identities generating higher dimensional vector partitions. We derive theorems for integer lattice points in the 2D first quadrant, then generalize the approach to find 3D and $n$-space lattice point vector region extensions. We also state combinatorial identities for Visible Point Vectors in 2D up to 5D and $n$D first hyperquadrant and hyperpyramid lattices. 2D and 3D theorems for vector partitions with binary components are also derived.
We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions, including for binary and n-ary partitions.
In this paper we consider integers in base 10 like $abc$, where $a$, $b$, $c$ are digits of the integer, such that $abc^2 - (abc \cdot cba) \; = \; \pm n^2$, where $n$ is a positive integer, as well as equations $abc^2 - (abc \cdot cba) \; = \; \pm n^3$, and $abc^3 - (abc \cdot cba) \; = \; \pm n^2$ We consider asymptotic density of solutions. We also compare the results with ones with bases different from 10.
We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable Fermat Last Theorem equation.
We define an extension of the Ramanujan trigonometric function to arbitrary dimensions, and give the Dirichlet series generating function. The extension was first given by Eckford Cohen long ago. This links directly to visible point vector identities, and possibly to lattice sums in Physics and Chemistry presented by Baake et al. New generating functions and summations are given here, generalizing the Ramanujan function, Euler totient and the Jordan totient functions, based on visible lattice point ideas.