相关论文: Computing the Length of Sum of Squares and Pythago…

The problem of writing a totally positive element as a sum of squares has a long history in mathematics, going back to Bachet and Lagrange. While for some specific rings (like integers or polynomials over the rationals), there are known…

This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…

The Pythagoras number of a sum of squares is the shortest length among its sums of squares representations. In many algebras, for example real polynomial algebras in two or more variables, there exists no upper bound on the Pythagoras…

We prove that every sum of squares in the rational function field in two variables $K(X,Y)$ over a hereditarily pythagorean field $K$ is a sum of $8$ squares. More precisely, we show that the Pythagoras number of every finite extension of…

This paper gives an algorithm to determine whether a number in a biquadratic field is a sum of two squares, based on local-global principle of isotropy of quadratic forms.

This paper gives an algorithm to determine whether a number in a cyclic quartic field is a sum of two squares, mainly based on local-global principle of isotropy of quadratic forms.

Siegel proved that every totally positive element of a number field K is the sum of four squares, so in particular the Pythagoras number is uniformly bounded across number fields. The p-adic Kochen operator provides a p-adic analogue of…

We show that any sum of squares in a field of transcendence degree $1$ over $\mathbb{Q}$ is a sum of $5$ squares, answering a question of Pop and Pfister. We deduce this result from a representation theorem, in $k(C)$, for quadratic forms…

This article proves a Pythagoras-type formula for the sides and diagonals of a polygon inscribed in a semicircle having one of the sides of the polygon as diameter.

Pythagoras' theorem, the area of a triangle as one half the base times the height, and Heron's formula are amongst the most important and useful results of ancient Greek geometry. Here we look at all three in a new and improved light, using…

We bound the Pythagoras number of a real projective subvariety: the smallest positive integer $r$ such that every sum of squares of linear forms in its homogeneous coordinate ring is a sum of at most $r$ squares. Enhancing existing methods,…

Using only the principle of relativity and Euclidean geometry we show in this pedagogical article that the square of proper time or length in a two-dimensional spacetime diagram is proportional to the Euclidean area of the corresponding…

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

An almost forgotten gem of Gauss tells us how to compute the area of a pentagon by just going around it and measuring areas of each vertex triangles (i.e. triangles whose vertices are three consecutive vertices of the pentagon). We give…

Let $K$ be a complex bi-quadratic field with ring of integers $\mathcal{O}_{K}$. For $K = \mathbb{Q}(\sqrt{-m}$, $\sqrt{n}$), where $ m \equiv 3 \pmod 4 $ and $ n \equiv 1 \pmod 4$, we prove that every algebraic integer can be written as…

The Pythagorean Theorem has been proved in hundreds of ways, yet it inspires fresh insights through geometry and trigonometry. In this paper, we offer a new proof based on three circles that circumscribe the sides of a right triangle.…

The paper found a geometric and algebraic interpretation of the parameters m and n from the formulas for obtaining primitive Pythagorean triples, which are solutions of the equation ${x^2+y^2=z^2}$, namely: ${x=m^2-n^2}$, ${y=2mn}$,…

In this paper, we derive an explicit combinatorial formula for the number of $k$-subset sums of quadratic residues over finite fields.

We compute the length of geodesics on a Riemannian manifold by regular polynomial interpolation of the global solution of the eikonal equation related to the line element $ds^2=g_{ij}dx^idx^j$ of the manifold. Our algorithm approximates the…

We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…