Related papers: Visualizing Marden's theorem with Scilab

Using Marden's Theorem from geometric theory of polynomials, we show that for every triangle there is a unique ellipse such that the triangle is a billiard trajectory within that ellipse. Since $3$-periodic trajectories of billiards within…

The Marden theorem of geometry of polynomials and the great Poncelet theorem from projective geometry of conics by their classical beauty occupy very special places. Our main aim is to present a strong and unexpected relationship between…

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

Meyerson's Theorem says that all but at most 2 points of any Jordan loop are vertices of inscribed equilateral triangles. We show that for any Jordan loop there are uncountable many other triangle shapes for which this same result is true.…

The representation theory of a 3-dimensional Sklyanin algebra $S$ depends on its (noncommutative projective algebro-) geometric data: an elliptic curve $E$ in $\mathbb{P}^2$, and an automorphism $\sigma$ of $E$ given by translation by a…

The Miquel-Steiner theorem for a quadrilateral in the Euclidean plane states that the circumcircles of the four component triangles intersect at a single point, which now is called the Miquel-Steiner point of the quadrilateral. In elliptic…

In this paper, we consider complex polynomials of degree three with distinct zeros and their polarization ((z1,z2,z3) with three complex variables. We show, through elementary means, that the variety P(z1,z2,z3)=0 is birationally equivalent…

We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

Given a complex polynomial $p(z)$ of degree $n$ and an ellipse, we find an algorithm of determining the number of zeros of $p$ in the interior and exterior of the ellipse. Our results generalize the previous results of Pt\'ak and Young…

If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…

Given polynomials a(z) of degree m and b(z) of degree n, we represent the inverse to the Sylvester resultant matrix of a(z) and b(z), if this inverse exists, as a canonical sum of m+n dyadic matrices each of which is a rational function of…

We present higher dimensional versions of the classical results of Euler and Fuss, both of which are special cases of the celebrated Poncelet porism. Our results concern polytopes, specifically simplices, parallelotopes and cross polytopes,…

Let R be a four-sided convex polygon in the xy plane and let M1 and M2 be the midpoints of the diagonals of R. It is well-known that if E is an ellipse inscribed in R, then the center of E must lie on Z, the open line segment connecting M1…

The B\^{o}cher-Grace Theorem can be stated as follows: Let $p$ be a third degree complex polynomial. Then there is a unique inscribed ellipse interpolating the midpoints of the triangle formed from the roots of $p$, and the foci of the…

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

The $f$-vector of a polytope consists of the numbers of its $i$-dimensional faces. An open field of study is the characterization of all possible $f$-vectors. It has been solved in three dimensions by Steinitz in the early 19th century. We…

In this paper, we analyze the nontrivial zeros of the Riemann zeta-function using the multidimensional scaling (MDS) algorithm and computational visualization features. The nontrivial zeros of the Riemann zeta-function as well as the…

A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…

We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…