arXiv subjects

John M. Campbell

Publications and source records attributed to John M. Campbell.

At least 19 recordsLinked to original sources

arXiv2026

Group maps on initial intervals

Let $S$ denote a $k$-subset of $\mathbb{Z}$. Let $G$ be a (multiplicative) group of size $k$. Assume that there exists a function $φ\colon S \to G$ that is injective and that satisfies the following: If $x, y, z \in S$ and $z = xy$, then $φ(z) = φ(x) φ(y)$. In 1990, Forcade and Pollington conjectured that if $S = \{ 1, 2, \ldots, k \}$, then $G$ is abelian. This has been a long-standing conjecture highlighted by Richard K. Guy as an unsolved problem, and this problem appears to have remained open, with its open status having been noted by Caicedo et al. in 2021 [Electron. J. Combin.]. We succeed in proving the Forcade-Pollington conjecture in the affirmative and in full generality.

math.GR↗

arXiv2026

A portable implementation of one-loop Feynman integrals

We present the first performance-portable implementation of a loop integral library for high-energy particle physics. The new code is based on the QCDLoop package, which provides an essential component in the software stack for perturbative precision calculations at collider experiments. Our implementation extends QCDLoop to modern computing architectures by means of the Kokkos portability framework, which allows to target most existing CPUs and GPUs.

hep-ph↗

arXiv2026

Subword enumeration up to stack-sorting equivalence

Defant and Kravitz introduced generalizations of West's stack-sorting map $s$ from permutations to finite words. This raises questions as to how such generalizations could be applied in the field of combinatorics on words. The Defant-Kravitz generalizations of $s$ depend on how repeated occurrences of the same character within a word may be repositioned, according to their $\textsf{tortoise}$ and $\textsf{hare}$ operations. As demonstrated in this paper, these operations provide a natural way of extending abelian complexity functions for infinite sequences, in a way that gives light to structural properties associated with infinite words. We apply these new ideas to two famous infinite words: the paperfolding word and the Thue-Morse word. In the case of the Thue-Morse word, we discover an interesting connection to the previous work of several authors, such as de Luca and Varricchio, on the ``special'' factors of the Thue-Morse word. This may be seen as providing a basis for a new and interdisciplinary area linking the combinatorics about the stack-sorting of permutations with the field of combinatorics on words.

math.CO↗

arXiv2026

Gosper's and Ramanujan's infinite products and generalizations

Gosper introduced many remarkable formulas involving infinite products. One such formula provides an evaluation of the product $$\prod_{n \geq 1} \frac{1}{e}\left(\frac{1}{3n} + 1\right)^{3n + \frac{1}{2}}. $$ It appears that a complete proof of this evaluation has not appeared in the literature. In this paper, we introduce some techniques to extend Gosper's evaluation. We prove a generalization of Gosper's formula involving three free parameters, which can also be applied to evaluate arbitrary multisections of Gosper's product. Then we investigate higher-order extensions involving higher-degree polynomials in $n$, relative to the polynomials $3n$ and $3n+\frac{1}{2}$ involved in Gosper's product, yielding a generalization of an infinite product evaluation due to Ramanujan and recently studied by Bradley--Thrush [\textit{\it Ramanujan J.} (2025)]. We also consider connections with infinite products due to Kurokawa and Rovinski\uı, building on the recent work of the first and fourth authors [\textit{\it Ramanujan J.} (2025)].

math.NT↗

arXiv2026

On a problem on Ramanujan-Sato series of level 11

A longstanding open problem concerning Ramanujan-Sato series is given by determining an expression for the coefficients $c_{11}(n)$ associated with Ramanujan-Sato series of level 11 with a fixed, nested, finite binomial sum for all nonnegative integers $n$, by direct analogy with the known formulas for the coefficients for lower-level Ramanujan-Sato series (and this is clarified and made explicit in our paper). This open problem was given by Cooper et al. in 2015 [J. Math. Anal. Appl.], in Cooper's 2017 textbook on Ramanujan's theta functions, and in Cooper's 2025 contribution to the Contemp. Math. series. This problem seems to have remained open. We succeed in solving this problem, by introducing and proving a double binomial sum formula for $c_{11}(n)$ that is directly analogous to the coefficient formulas for lower-level Ramanujan-Sato series.

math.NT↗

arXiv2026

Pinch's conjecture on $a$-convexity

For $a$ in $\mathbb{R}$, a subset $V$ contained in $\mathbb{R}^{n}$ is said to be $a$-convex if $x, y \in V \Longrightarrow a x + (1-a) y \in V$. According to Pinch [Math. Proc. Cambridge Philos. Soc., 1985], the $a$-convex hull of $V$ is the intersection of all of the $a$-convex subsets of $\mathbb{R}^{n}$ that contain $V$, and Pinch also defines $D(a)$ as the $a$-convex hull of $\{ 0, 1 \}$ in $\mathbb{R}^{1}$. Pinch conjectured that if $a$ is a totally real algebraic integer and $D(a)$ has no limit points, then every algebraic conjugate of $a$ other than $a$ is in $(0, 1)$. We succeed in proving this conjecture, which seems to have remained open.

math.NT↗

arXiv2026

On a conjecture concerning antipodal labelings for cycles

Let $G$ denote a finite, connected, simple graph, and let $D$ denote its diameter, and let $d_{G}(u, v)$ denote the distance between vertices $u$ and $v$ in $V(G)$. An antipodal labeling of $G$ is a mapping $f\colon V(G) \to \mathbb{N}_{0}$ such that, for each pair $(u, v)$ consisting of distinct vertices in $V(G)$, the relation $ |f(u) - f(v)| \geq D - d_{G}(u, v) $ holds. The span of $f$ is then defined so that $\operatorname{sp}(f) = \max\{ f(u) - f(v) : u, v \in V(G) \}$. The antipodal number of $G$, denoted with $\operatorname{an}(G)$, may then be defined as the minimum possible span among all antipodal labelings of $G$. Juan and Liu [Ars Combin., 2012] proved the upper bound $\operatorname{an}(C_{4k}) \leq 2k^2 - 1$, and conjectured that $\operatorname{an}(C_{4k}) = 2k^2 - 1$ for each positive integer $k$, and Juan and Liu verified this conjecture for $k \leq 5$. We succeed in proving Juan and Liu's conjecture, which seems to have remained open. The openness of Juan and Liu's conjecture has been noted, over the years, by many authors, including Rao et al. [Contrib. Discrete Math., 2015] and Saha et al. [Theory Comput. Syst., 2022].

math.CO↗

arXiv2026

Abelian-normal decimal expansions

A landmark paper on normal numbers due to Champernowne [J. London Math. Soc., 1933] provided the first explicit construction of a normal number. Since many research works have concerned normality-preserving selection rules and operations on the sequence of digits of a given normal number, this leads us to introduce the concept of an abelian-normal number, in such a way so that subwords that are equivalent up to permutations are counted as being equivalent, and so that the number of occurrences of equivalent subwords appearing, up to a given point in a decimal expansion, is then normalized by the size of the associated equivalence class. This may be thought of as giving rise to an interdisciplinary area linking combinatorics on words and probabilistic number theory. Since every normal number is abelian-normal, this raises the question as to whether or not there exists an abelian-normal number that is not normal. We succeed in constructing such a constant in an explicit way.

math.CO↗

arXiv2026

Double-real corrections to color singlet decay in a parton-shower inspired scheme

We introduce a local infrared subtraction method for next-to-next-to-leading order QCD calculations in color singlet decays, which is modeled on the evolution algorithm of a parton shower. Overlapping singularities in the multipole radiation pattern are disentangled by partial fractioning, and the kinematics mapping corresponds to iterated next-to-leading order kinematics. We verify that the double-real remainder to $e^+e^-\to\;q\bar{q}$ is rendered finite in the single and double unresolved limits and investigate the numerical convergence of the Monte-Carlo integral. We compute the phase-space integrals of the scalar counterterms in the back-to-back configuration, both analytically and with the help of numerical techniques based on sector decomposition.

hep-ph↗

arXiv2026

On two conjectures on triangulations of 2-manifolds

For a closed, connected 2-manifold $M$, and for a triangulation $T$ of $M$, we write $V(T)$ in place of the vertex set associated with $T$. A cyclic coloration of a triangulation $T$ of $M$ refers to a face coloring of $T$ such that: For each $v \in V(T)$, the faces incident to $v$ have distinct colors. Chen and Lawrencenko [Yokohama Math. J., 1999] conjectured that there exists a constant $C(M)$ (depending only on $M$) such that $|V(T)| + C(M)$ colors suffice for there to exist a cyclic coloration of a triangulation $T$ of $M$. We prove this conjecture, using a greedy algorithm related to the Euler-Poincaré formula for surface triangulations. Chen and Lawrencenko also conjectured that: If $M$ is not the projective plane and $T$ is a triangulation of $M$ that is minimal with respect to the number of vertices, then $ξ(T) = |V(T)| = V_{\min}(M)$, where $V_{\min}(M)$ denotes the minimum possible number of vertices among all triangulations of the 2-manifold $M$, and where $ξ(T)$ denotes the minimal value $k$ such that $T$ admits a cyclic coloration with $k$ colors. We disprove this latter conjecture via an explicit counterexample, using an 8-vertex triangulation of the Klein bottle with 16 faces. It appears that both of the Chen-Lawrencenko conjectures have remained open, prior to our work.

math.GT↗

arXiv2026

The finitude of the fibers of the complementary Bell numbers

Subbarao and Verma introduced, in 1999, a number of open problems concerning the sequence $(f(n))_{n \geq 0}$ of complementary Bell numbers, which may be defined via Bell polynomials $B_{n}(x) = \sum_{k=0}^{n} \left\{ \begin{smallmatrix} n \\ k \end{smallmatrix} \right\} x^k$ so that $f(n) = B_{n}(-1)$. Yang [Electron. J. Combin., 2001] subsequently solved the first two problems from Subbarao and Verma, but the third such problem has remained open, to the best of our knowledge. The first part of this third problem asks whether or not $f(n)$ takes any given value only a finite number of times. We solve this problem in the affirmative, through a combined application of finite difference-based methods, partial Motzkin paths, the completeness of the Tate algebra with respect to the Gauss norm, and Strassmann's theorem.

math.CO↗

arXiv2026

Disproofs of two conjectures concerning nondeficient numbers

A positive integer $n$ is said to be nondeficient if $σ(n) \geq 2n$. Letting the positive divisors of a positive integer $n$ be written as $1 = d_0 < d_1 < \cdots < d_k < d_{k+1} = n$, and letting $\mathcal{S}$ denote a set of integers, if there exist values $λ_j \in \mathcal{S}$ such that $1 + \sum_{j=1}^{k} λ_j d_j = n$, then $n$ is said to be an $\mathcal{S}$-perfect number. Ross, in 2024, introduced the study of $\mathcal{S}$-perfect numbers, and concluded with two conjectures that each concern both $\{ -1, 1 \}$-perfect numbers and nondeficient numbers. We disprove both of these conjectures.

math.NT↗

arXiv2026

On a conjecture on $k$-antichains in the unit $n$-cube

Let $[0, 1]^{n} \subseteq \mathbb{R}^{n}$ be endowed with its pointwise order, and let $k$ be a positive integer. A subset $A$ of $[0, 1]^{n}$ is said to be a \emph{$k$-antichain} if $\operatorname{card}(A \cap C) \leq k$ for each chain $C \subseteq [0, 1]^{n}$. Letting $\mathcal{H}^{m}$ denote the $m$-dimensional Hausdorff outer measure, Pelekis and Vlasák [Publ.\ Math.\ Debrecen, 2020] conjectured that there exists a $k$-antichain $A \subseteq [0, 1]^{n}$ satisfying $\mathcal{H}^{n-1}(A) = k n$, and proved the special case of this conjecture for $n = 2$, whereas Janzer [Mathematika, 2020] proved the $k = 1$ case of Pelekis and Vlasák's conjecture. This conjecture is motivated by a result due to Erdős on $k$-antichains in $\{ 0, 1 \}^{n}$. We prove Pelekis and Vlasák's conjecture in full generality, thus establishing that their upper bound $\mathcal{H}^{n-1}(A) \leq k n$ is sharp for $k$-antichains $A$ in $[0, 1]^{n}$.

math.CO↗

arXiv2026

On a problem on a generalization of Euler's totient function

Büyükaşik et al. [Publ. Math. Debrecen, 2024] introduced a family of generalizations of Euler's totient function $φ(n)$, by setting $φ_k(n) = \sum_{a} a^k$ for $a \in [1, n]$ such that $(a, n) = 1$, with $φ_0(n) = φ(n)$. Letting $\mathcal{D}_{s} = \{ k \geq s : \forall n \geq 1 \ φ_s(n) \mid φ_k(n) \}$, Büyükaşik et al. proved that $\mathcal{D}_{s}$ is finite for each $s \geq 0$, and conjectured that $\mathcal{D}_{1} = \{ 1, 3, 15 \}$ and provided computations to support this conjecture. We succeed in proving this conjecture, using an argument based on our extensive interactions with GPT-5.5 Pro.

math.NT↗

arXiv2026

Meta-automatic Sequences

Nested (or meta-Fibonacci) recurrences, such as the recurrence used to define Hofstadter's Q-sequence, along with the digit-based recurrences that underlie automatic sequences are of interest from both number-theoretic and combinatorial points of view. In this direction, Allouche and Shallit showed how the frequency sequence of a variant of the $Q$-sequence is $2$-automatic. This inspires us to introduce what may be seen as a natural combination of the recurrences for meta-Fibonacci and automatic sequences, by introducing the concept of a meta-automatic sequence. We exhibit two binary meta-automatic sequences $M_1$ and $M_2$ whose defining recurrences do not satisfy the Allouche-Shallit automaticity criterion directly, and this is formalized in our paper. For each of these integer sequences $M_1$ and $M_2$, we prove explicit DFAO evaluations, together with $4$-uniform morphisms, and we also consider the factor complexities of these sequences.

math.NT↗

arXiv2026

On the binary digits of the Erdős-Borwein constant

In a landmark paper on arithmetical properties of Lambert series, Erdős proved that $\sum_{n=1}^{\infty} \frac{1}{2^{n} - 1}$ is irrational. This value $E$ is now referred to as the Erdős-Borwein constant. Crandall, in 2012, studied properties of the base-2 expansion of this constant, and left the following as an open problem: Does the string $11$ occur infinitely often in the base-2 expansion of $E$? This open problem was also subsequently noted by Shallit. We succeed in introducing a full proof that solves Crandall's problem in the affirmative. Our proof combines a congruence construction in the spirit of Erdős and an estimate due to Alford, Granville, and Pomerance for the counting function for primes in arithmetic progressions. Our argument was developed through extensive interactions with GPT-5.5 Pro.

math.NT↗

arXiv2026

On divisor sums due to Erdős and Ramanujan

Let $d(n)$ denote the number of divisors of a positive integer $n$. A classical problem in analytic number theory is given by the asymptotic behavior of the divisor sum $\sum_{n \leq x} \frac{1}{d(n)}$, with Ramanujan having introduced an asymptotic formula for this sum with an explicit evaluation for the constant $A_1$ for the leading term $A_1 \frac{x}{\sqrt{\log x}}$. Gabdullin et al. recently considered a hybrid of this problem and the Titchmarsh divisor problem concerning $\sum_{p\leq x} d(p-1)$, proving that $$\sum_{p\leq x} \frac{1}{d(p-1)} \asymp \frac{x}{(\log x)^{3/2}}.$$ This result, together with Erdős's asymptotic formula $\sum_{n \leq x} d(d(n)) \sim c \, x \log \log x $ for a constant $c \in (0, \infty)$, lead us to consider the hybrid $\sum_{n \leq x} \frac{1}{d(d(n))}$ of the Erdős and Ramanujan divisor sums. The presence of the reciprocal significantly complicates the analysis, as it amplifies the contribution of integers for which $d(d(n))$ is exceptionally small. In this paper, we prove that $$\sum_{n \leq x} \frac{1}{d(d(n))} \asymp \frac{x}{ \log \log x}, $$ through a combined application of Golomb's estimate for powerful numbers and Turán's quantitative form of the Hardy-Ramanujan theorem.

math.NT↗

arXiv2026

Kronecker coefficients via the Giambelli identity for Schur functions

One of the central open problems in both algebraic combinatorics and representation theory is to find a positive combinatorial rule for Kronecker coefficients $ g_{λ\, μ\, ν}$. A notable advance in this direction is due to Blasiak, who proved a combinatorial interpretation in terms of colored Yamanouchi tableaux for the case whereby one of the indexing partitions is hook-shaped. In this paper, we introduce a framework for the evaluation and combinatorial interpretation of Kronecker coefficients, combining a Schur function identity of Littlewood, the Giambelli identity for Schur functions, and Blasiak's combinatorial rule. This framework reduces the study of Kronecker coefficients to alternating sums involving hook-indexed cases. As an application of this framework, we obtain combinatorial interpretations of $g_{t, h^{(1)}, h^{(2)}}$ for two-row partitions $t$ and hook-like partitions $h^{(1)}$ and $h^{(2)}$ satisfying natural conditions. More broadly, our approach provides a systematic method for extending hook-based combinatorial rules to wider families of Kronecker coefficients.

math.CO↗