On a quadratic Waring's problem with congruence conditions

Abstract

For each positive integer n, let g(n) be the smallest positive integer g such that every complete quadratic polynomial in n variables which can be represented by a sum of odd squares is represented by a sum of at most g odd squares. In this paper, we analyze g(n) by studying representations of integral quadratic forms by sums of squares with certain congruence condition. We prove that the growth of g(n) is at most an exponential of n, which is the same as the best known upper bound on the g-invariants of the original quadratic Waring's problem. We also determine the exact value of g(n) for each positive integer less than or equal to 4.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…