Search arXivSearch

arXiv · 2502.17106

Ellipsoidal designs and the Prouhet--Tarry--Escott problem

Abstract

The notion of ellipsoidal design was first introduced by Pandey (2022) as a full generalization of spherical designs on the unit circle $S^1$. In this paper, we elucidate the advantages of examining the connections between ellipsoidal design and the two-dimensional Prouhet--Tarry--Escott problem, say ${\mathrm PTE}_2$, originally introduced by Alpers and Tijdeman (2007) as a natural generalization of the classical one-dimensional PTE problem (${\mathrm PTE}_1$). We first provide a combinatorial criterion for the construction of solutions of ${\mathrm PTE}_2$ from a pair of ellipsoidal designs. We also give an arithmetic proof of the Stroud-type bound for ellipsoidal designs, and then establish a classification theorem for designs with equality. Such a classification result is closely related to an open question on the existence of rational spherical $4$-designs on $S^1$, discussed in Cui, Xia and Xiang (2019). As far as the authors know, a solution found by Alpers and Tijdeman is the first and the only known parametric ideal solution of degree $5$ for ${\mathrm PTE}_2$. Moreover, as one of our main theorems, we prove that the Alpers--Tijdeman solution is equivalent to a certain two-dimensional extension of the famous Borwein solution for ${\mathrm PTE}_1$. As a by-product of this theorem, we discover a family of ellipsoidal $5$-designs among the Alpers--Tijdeman solution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hideki Matsumura, Masanori Sawa. 2025-04-29. Ellipsoidal designs and the Prouhet--Tarry--Escott problem. https://arxiv.org/abs/2502.17106

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