Related papers: Yet another proof from the Book: the Gauss theorem…
In theory of one complex variable, Gauss-Lucas Theorem states that the critical points of a non constant polynomial belong to the convex hull of the set of zeros of the polynomial. The exact analogue of this result cannot hold, in general,…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
This is an expository paper in which we explain how basic, standard, results about simple Lie algebras can be obtained by geometric arguments, following ideas of Cartan, Richardson and others.
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the…
A simple theorem is proved: When a gauge-invariant local field theory is written in terms of matter fields alone, a composite gauge boson or bosons must be formed dynamically. The theorem results from the fact that the Noether current…
It is known that Plotkin's reduction theorem is very important for his theory of universal algebraic geometry [arXiv:math. GM/0210187], [arXiv:math. GM/0210194]. It turns out that this theorem can be generalized to arbitrary categories…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…
This paper is purely expositional. The statement of the Abel-Ruffini theorem on unsolvability of equations using radicals is simple and well-known. We sketch an elementary proof of this theorem. We do not use the terms 'field extension',…
Poncelet's theorem states that if there exists an n-sided polygon which is inscribed in a given conic C and circumscribed about another conic D, then there are infinitely many such n-gons. Proofs of this theorem that we are aware of,…
It is shown in our earlier paper that, using only tools of elementary geometry, the classical Routh's theorem for triangles can be fully extended to tetrahedra. In this article we first give another proof of Routh's theorem for tetrahedra…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.
In this paper, we study the structure of Newton polygons for compositions of polynomials over the rationals. We establish sufficient conditions under which the successive vertices of the Newton polygon of the composition $ g(f^n(x)) $ with…
Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…
Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.
This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…
Kapranov Theorem is a well known generalization of Newton-Puiseux theorem for the case of several variables. This theorem is stated mainly in the context of tropical geometry. We present a new, constructive proof, that also characterizes…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
This is an attempt to present axioms for Euclidean geometry, aiming at the following goals: to work with geometric notions (thus not merely identify points with pairs of numbers, giving a special status to a particular coordinate system);…
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.