Search arXivSearch

arXiv · 2509.19114

Interpreting a Sum of Third Powers by using a Geometric Assembly in Four Dimensions

Abstract

We present new combinatorial proofs of Nicomachus's Theorem for the sum of the third powers of the first n natural numbers. The key step is that we define a 4-dimensional block which comprises unit hyper-cubes. In our first proof we assemble 4 copies of this block to construct a rectangular solid. In our second proof we partition the block into two parts, then map and reassemble them into a solid whose shape is a step triangle along two coordinate axes, and is likewise on the other two. For corollaries we present a q-analogue of this identity using taxicab distance, and we interpret q-analogues from 4 different (sets of) authors, using taxicab distances from different starting points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph Alfano, Emily Armstrong, Vincent DeNolf, Jonah Sagarin. 2025-09-28. Interpreting a Sum of Third Powers by using a Geometric Assembly in Four Dimensions. https://arxiv.org/abs/2509.19114

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO