Semicomplete Arithmetic Sequences, Division of Hypercubes, and the Pell Constant

preprint2021arXivOpen access

Abstract

In this paper we produce a few continuations of our previous work on partitions into fractions. Specifically, we study strictly increasing integer sequences {nj}\{n_j\} such that there are partitions for all integers less than the floor of GG, where G=n1j+n2j+⋯+nj−1j+njjG=\frac{n_1}{j} + \frac{n_2}{j} + \cdots + \frac{n_{j-1}}{j}+\frac{n_j}{j}, and all summands are distinct terms drawn from n1j+n2j+⋯+nj−1j+njj\frac{n_1}{j} + \frac{n_2}{j} + \cdots + \frac{n_{j-1}}{j}+\frac{n_j}{j}. We call such sequences \enquote{semicomplete}. We find that there are only three semicomplete arithmetic sequences. We also study sequences that give the maximum number of pieces that an MM dimensional hypercube can be cut into using N−1N-1 hyperplanes. We find that these are semicomplete in one, two, three, and four dimensions. As an aside, we use one of our generating functions to produce what appears to be a new identity for the Pell constant, a number which is closely connected to the density of solutions to the negative Pell equation.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.