b

Forum Geometricorum Volume 6 (2006) 285–288.

b

b

FORUM GEOM ISSN 1534-1178

On the Derivative of a Vertex Polynomial James L. Parish

Abstract. A geometric characterization of the critical points of a complex polynomial f is given, in the special case where the zeros of f are the vertices of a polygon affine-equivalent to a regular polygon.

1. Steiner Polygons The relationship between the locations of the zeros of a complex polynomial f and those of its derivative has been extensively studied. The best-known theorem in this area is the Gauss-Lucas Theorem, that the zeros of f lie in the convex hull of the zeros of f . The following theorem [1, p.93], due to Linfield, is also of interest: Theorem 1. Let λj ∈ R\{0}, j = 1, . . . , k, and let zj , j = 1, . . . , k be distinct  λ complex numbers. Then the zeros of the rational function R(z) := kj=1 z−zj j are the foci of the curve of class k − 1 which touches each of the k(k − 1)/2 line segments zµ , zν in a point dividing that line segment in the ratio λµ : λν .  1 , where the zj are the zeros of f , Linfield’s Theorem Since f  = f · kj=1 z−z j can be used to locate the zeros of f which are not zeros of f . In this paper, we will consider the case of a polynomial whose zeros form the vertices of a polygon which is affine-equivalent to a regular polygon; the zeros of the derivative can be geometrically characterized in a manner resembling Linfield’s Theorem. First, let ζ be a primitive nth root of unity, for some n ≥ 3. Define G(ζ) to be the n-gon whose vertices are ζ0 , ζ 1 , . . . , ζ n−1 . Proposition 2. Let n ≥ 3, and let G be an n-gon with vertices v0 , . . . , vn−1 , no three of which are collinear. The following are equivalent. (1) There is an ellipse which is tangent to the edges of G at their midpoints. (2) G is affine-equivalent to G (ζ) for some primitive nth root of unity ζ. (3) There is a primitive nth root of unity ζ and complex constants g, u, v such that |u| = |v| and, for k = 0, . . . , n − 1, vk = g + uζ k + vζ −k . Proof. 1)=⇒2): Applying an affine transformation if necessary, we may assume that the ellipse is a circle centered at 0 and that v0 = 1. Let m0 be the midpoint of the edge v0 v1 . v0 v1 is then perpendicular to 0m0 , and v0 , v1 are equidistant from m0 ; it follows that the right triangles 0m0 v0 and 0m0 v1 are congruent, and in Publication Date: November 13, 2006. Communicating Editor: Paul Yiu.

286

J. L. Parish

particular that v1 also lies on the unit circle. Now let m1 be the midpoint of v1 v2 ; since m0 and m1 are equidistant from 0 and the triangles 0m0 v1 , 0m1 v1 are right, they are congruent, and m0 , m1 are equidistant from v1 . It follows that the edges v0 v1 and v1 v2 have the same length. Furthermore, the triangles 0v0 v1 and 0v1 v2 are congruent, whence v2 = v12 . Similarly we obtain vk = v1k for all k, and in particular that v1n = v0 = 1. ζ = v1 is a primitive nth root of unity since none of v0 , . . . , vn−1 coincide, and G = G(ζ). 2)=⇒1): G(ζ) has an ellipse – indeed, a circle – tangent to its edges at their midpoints; an affine transformation preserves this. 2)⇐⇒3): Any real-linear transformation of C can be put in the form z → uz + vz for some choice of u, v, and conversely; the transformation is invertible iff |u| = |v|.  We will refer to an n-gon satisfying these conditions as a Steiner n-gon; when needed, we will say it has root ζ. The ellipse is its Steiner inellipse. (This is a generalization of the case n = 3; every triangle is a Steiner triangle.) The parameters g, u, v are its Fourier coordinates. Note that a Steiner n-gon is regular iff either u or v vanishes. 2. The Foci of the Steiner Inellipse Now, let Sζ be the set of Steiner n-gons with root ζ for which the constant g, above, is 0. We may use the Fourier coordinates u, v to identify it with an open subset of C2 . Let Φ be the map taking the n-gon with vertices v0 , v1 , . . . , vn−1 to the n-gon with vertices v1 , . . . , vn−1 , v0 . If f is a complex-valued function whose domain is a subset of Sζ which is closed under Φ, write ϕf for f ◦ Φ. Note that ϕu = ζu and ϕv = ζ −1 v; this will prove useful. Note also that special points associated with n-gons may be identified with complex-valued functions on appropriate subsets of Sζ . We define several useful fields associated with Sζ . First, let F = C(u, v, u, v), where u, v are as in 3) of the above proposition. ϕ is an automorphism of F . Let K = C(x, y, x, y) be an extension field of F satisfying x2 = u, y 2 = v, x2 = u, y 2 = v. Let θ be a fixed square root of ζ; we extend ϕ to K by setting ϕx = θx, ϕy = θ −1 y, ϕx = θ −1 x, ϕy = θy. Let K0 be the fixed field of ϕ and K1 the fixed field of ϕn . Elements of F may be regarded as complex-valued functions defined on dense open subsets of Sζ . Functions corresponding to elements of K may only be defined locally; however, given G ∈ Sζ such that uv = 0 and f ∈ K1 defined at G, one may choose a small neighborhood U0 of G which is disjoint from Φk (U0 ), k = 1, . . . , n − 1 and on which neither u nor v vanish; f may then be  k defined on U = n−1 k=0 Φ (U0 ). For the remainder of this section, G is a fixed Steiner n-gon with root ζ. The vertices of G are v0 , . . . , vn−1 . We have the following. Proposition 3. The foci of the Steiner inellipse of G are located at f± = g ± (θ + θ −1 )xy.

On the derivative of a vertex polynomial

287

Proof. Translating if necessary, we may assume that g = 0, i.e., G ∈ Sζ . Note first that f± ∈ K0 . (This is to be expected, since the Steiner inellipse and its foci do not depend on the choice of initial vertex.) For k = 0, . . . , n − 1, let mk = (vk + vk+1 )/2, the midpoint of the edge vk vk+1 . Let d± be the distance from f± to m0 ; we will first show that d+ + d− is invariant under ϕ. (This will imply that the sum of the distances from f± to mk is the same for all k.) Now, m0 = (v0 +v1 )/2 = ((1+ζ)u+(1+ζ −1 )v)/2 = (θ+θ −1 )(θx2 +θ −1 y 2 )/2. Thus, m0 −f+ = (θ+θ −1 )(θx2 −2xy +θ −1y 2 )/2 = (ζ +1)(x−θ −1 y)2 /2. Hence d+ = |m0 − f+ | = |ζ + 1|(x − θ −1 y)(x − θy)/2. Similarly, d− = |ζ + 1|(x + θ −1 y)(x + θy)/2, and so d+ + d− = |ζ + 1|(xx + yy), which is invariant under ϕ as claimed. This shows that there is an ellipse with foci f± passing through the midpoints of the edges of G. If n ≥ 5, this is already enough to show that this ellipse is the Steiner inellipse; however, for n = 3, 4 it remains to show that this ellipse is tangent to the sides, or, equivalently, that the side vk vk+1 is the external bisector of the angle ∠f+ mk f− . It suffices to show that Ak = (mk − vk )(mk − vk+1 ) is a positive multiple of Bk = (mk − f+ )(mk − f− ). Now A0 = −(ζ − 1)2 (u − ζ −1 v)2 /4, and B0 = (ζ + 1)2 (x − θ −1 y)2 (x + θ −1 y)2 /4 = (ζ + 1)2 (u − ζ −1 v)2 /4; thus, A0 /B0 = −(ζ − 1)2 /(ζ + 1)2 = −(θ − θ −1 )2 /(θ + θ −1 )2 , which is evidently positive. This quantity is invariant under ϕ; hence Ak /Bk is also positive for all k.  Corollary 4. The Steiner inellipse of G is a circle iff G is similar to G(ζ). Proof. f+ = f− iff xy = 0, i.e., iff one of u and v is zero. (Note that θ + θ−1 = 0.)  n−1 Define the vertex polynomial fG (z) of G to be k=0 (z − vk ). We have the following. Proposition 5. The foci of the Steiner inellipse of G are critical points of fG . n−1 −1 Proof. Again, we may assume G ∈ Sζ . Since fG /fG = k=0 (z − vk ) , it suffices to show that at f± . Now f+ is invariant under ϕ, and this sum vanishes n−1 k −1 = −1 −1 = (f − v ) vk = ϕk v0 ; hence n−1 k k=0 + k=0 ϕ (f+ − v0 ) . (f+ − v0 ) 2 2 −θ/((θy − x)(y − θx)) Now let g = θ /((θ − 1)x(θy − x)). Note that g ∈ K1 ; that is, ϕn g = g. A straightforward calculation shows that (f+ − v0 )−1 = g − ϕg; n−1 k  k −1 = k+1 g) = g − ϕn g = 0, as therefore, n−1 k=0 ϕ (f+ − v0 ) k=0 (ϕ g − ϕ  desired. The proof that f− is a critical point of fG is similar. 3. Holomorphs Again, we let G be a Steiner n-gon with root ζ and vertices v0 , . . . , vn−1 . For any integer m, we set vm = vl where l = 0, . . . , n − 1 is congruent to m mod n. The following lemma is trivial. Lemma 6. Let k = 1, . . . , n/2. Then: k (1) If k is relatively prime to n, let Gk be the n-gon with vertices v0k , . . . , vn−1 k k k given by vj = vjk . Then G is a Steiner n-gon with root ζ , and its Fourier coordinates are g, u, v.

288

J. L. Parish

(2) If d = gcd(k, n) is greater than 1 and less than n/2, set m = n/d. Then, k,l for l = 0, . . . , d − 1, let Gk,l be the m-gon with vertices v0k,l , . . . , vm−1 given by vjk,l = vkj+l . Then, for each l, Gk,l is a Steiner m-gon with root ζ k , and the Fourier coordinates of Gk,l are g, ζ l u, ζ −l v. The Gk,l all have the same Steiner inellipse. (3) If k = n/2, the line segments vj vj+k all have midpoint g. In the three given cases, we will say k-holomorph of G to refer to Gk , the union of the m-gons Gk,l , or the union of the line segments vj vj+k . We extend the definition of Steiner inellipse to the k-holomorphs in Cases 2 and 3, meaning the common Steiner inellipse of the Gk,l or the point g, respectively. The propositions of Section II clearly extend to Case 2; since the foci are critical points of the vertex polynomials of each of the Gk,l , they are also critical points of their product. In Case 3, taking g as a degenerate ellipse – indeed, circle – with focus at g, the propositions likewise extend; in this case, θ = ±i, so θ + θ−1 = 0, and the sole critical point of (z − vj )(z − vj+k ) is (vj + vj+k )/2 = g. In Cases 1 and 2, it should be noted that the Steiner inellipse is a circle iff the Steiner inellipse of G itself is a circle – i.e., G is similar to G(ζ). It should also be noted that the vertex polynomials of the holomorphs of G are equal to fG itself; hence they have the same critical points. Suppose that G is not similar to G(ζ). If n is odd, G has (n − 1)/2 holomorphs, each with a noncircular Steiner inellipse and hence two distinct Steiner foci; these account for the n − 1 critical points of fG . If n is even, G has (n − 2)/2 holomorphs in Cases 1 and 2, each with two distinct Steiner foci, and in addition the Case 3 holomorph, providing one more Steiner focus; again, these account for n − 1 critical points of fG . On the other hand, if G is similar to G(ζ), then fG = (z − g)n − r n for some real r; the Steiner foci of the holomorphs of G collapse together, and fG has an (n − 1)-fold critical point at g. We have proven the following. Theorem 7. If G is a Steiner n-gon, the critical points of fG are the foci of the Steiner inellipses of the holomorphs of G, counted with multiplicities if G is regular. They are collinear, lying at the points g + (2 cos kπ/n)xy, as k ranges from 0 to n − 1. (For the last statement, note that cos(n − k)π/n = − cos kπ/n.) Reference [1] Q. I. Rahman and G. Schmeisser, Analytic Theory of Polynomials, Clarendon Press, Oxford, 2002. James L. Parish:Department of Mathematics and Statistics, Southern Illinois University, Edwardsville, Edwardsville, IL USA 62026 E-mail address: [email protected]

On the Derivative of a Vertex Polynomial

Nov 13, 2006 - James L. Parish. Abstract. A geometric characterization of the critical points of a complex poly- ... (This is a gen- eralization of the case n = 3; ...

53KB Sizes 4 Downloads 380 Views

Recommend Documents

On the Vertex Separation of Cactus Graphs
Oct 3, 2007 - Abstract. This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a “main theorem for cacti”, a necessary and sufficient condition for

ON THE VERTEX SEPARATION OF CACTUS GRAPHS ...
Vertex Separation is an NP-complete problem on undirected graphs with numerous practical applications in diverse areas such as natural language processing, VLSI design, network reliability, computational biology and others. It is equivalent to other,

On the twisted Alexander polynomial and the A ...
On the twisted Alexander polynomial and the A-polynomial of 2-bridge knots. Vu Q. Huynh and Thang T. Q. Le. Abstract. We show that the A-polynomial A(L, M) of a 2-bridge knot b(p, q) is irreducible if p is prime, and if (p−1)/2 is also prime and q

On the Vertex Separation of Cactus Graphs
Jan 10, 2007 - the running time has a high degree, e.g. the algorithm of Bodlaender and. Kloks on graphs of .... p uk” is an abbreviation for “there is a path p with endpoints u1 and ...... Master's thesis, University of Victoria, December. 2004.

ON THE VERTEX SEPARATION OF MAXIMAL ...
sense, binary 2-trees (we explain later precisely what we mean). A fast and ... cycle. The length of a path p is the number of vertices in it and is denoted by. |p|.

On the Vertex Separation of Maximal Outerplanar Graphs
Nov 20, 2008 - adj(u), under L. The vertex right(u) is defined as follows: if u is left of .... x is in the middle interval then its separation is ≤ k − 1 before L2 is ...

1 On the Complexity of Non Universal Polynomial ... - Semantic Scholar
The space CM is called the target space, a point y ∈ Im ε ⊆ CM is called a target point (also a semantical object), and the dimension M of the target space is called the target dimension. In the previous notation, for every α ∈ W, ε(α) is t

1 On the Complexity of Non Universal Polynomial ...
data (polynomial equations and inequalities) to answer questions involving quanti- fiers. .... These studies have generated a large number of semantic invariants that must be ...... In a broad sense, this scheme is close to an “oracle machine”.

1 On the Complexity of Non Universal Polynomial Equation Solving ...
computing and numerical analysis developed their own techniques for solving .... f1,...,fs ∈ C[X1,...,Xn] of degree at most d, the complex algebraic variety they ..... The mapping Φ associates to every parameter α ∈ W a system of ...... G.W. St

1 On the Complexity of Non Universal Polynomial Equation Solving ...
of solving them in any real or future computer. The reason is that this ... on the number of variables and the maximum of the degrees, such that the following equivalence ... not seem to be the best methods of dealing with HN. A third syntactical ...

How Derivative Effect the Shape of a Graph.pdf
How Derivative Effect the Shape of a Graph.pdf. Open. Extract. Open with. Sign In. Details. Comments. General Info. Type. Dimensions. Size. Duration. Location.

project on derivative market pdf
Page 1 of 1. File: Project on derivative market pdf. Download now. Click here if your download doesn't start automatically. Page 1 of 1. project on derivative market pdf. project on derivative market pdf. Open. Extract. Open with. Sign In. Main menu.

Crystal modification of a N-phenyl-2-pyrimidineamine derivative ...
Sep 21, 2011 - Receptor, and Src Family Tyrosine Kinases,” Pharmacol. Ther., vol. 76, Nos. 1-3, pp. 55-71 (1997). ... inhibition of the platelet-derived growth facgtor signal transduction pathway by a protein-tyrosine ...... Wistar rats (purchased

Is warrant really a derivative? Evidence from the ...
May 22, 2012 - value of warrants (for puts), and the market risk (for calls). The split share ... Since the listing of Baosteel warrant (580000), the first of its kind, on ...

The physical origin of the electron-phonon vertex ...
... the vertex corrections [6,7]. Given this situation, one main question concerns the ...... cloud around the potential well and an added electron will experience an ...

Adaptive minimax estimation of a fractional derivative - Semantic Scholar
We observe noisy data. Xk ј yk ю exk; k ј 1; 2; ... ,. (1) where xk are i.i.d. Nр0; 1Ю, and the parameter e>0 is assumed to be known. Our goal is to recover a vector.

The physical origin of the electron-phonon vertex ...
tope dependence of the effective charge carrier mass [14]. The latter finding actually provides a possible interpre- tation of the experimental results given in reference [15]. Other interesting effects are given by the behavior of the pressure coeff

Synthesis of Zincic Phthalocyanine Derivative ...
photodynamic cancer therapy [4], solar energy conversion. [5], gas sensors [6] etc. Many compounds have been produced where identical substituents have ...

On derivative criteria for metric regularity
1 Introduction. In this paper we prove two theorems. ..... and Partial Differential Equations, IOS Press, 336–345 (2000). 5. Dontchev, A. L., Quincampoix, M., ...

A CONTINUATION METHOD TO SOLVE POLYNOMIAL SYSTEMS ...
the path of pairs (/t,7t), where /t,t ∈ [0,T] is a polynomial system and /t(7t) = 0. He proved ... namely H(d) is the vector space of systems of n homogeneous polyno-.

Derivative and Integral of the Heaviside Step Function - Eli Lansey
http://behindtheguesses.blogspot.com/2009/06/derivative-and-integral-of-heaviside.html. Eli Lansey — [email protected]. June 30, 2009. The Setup. 4. 2. 2. 4.

Estimation of the phase derivative using an adaptive window ...
rivative contains the information regarding the measur- and. During recent years, there has been an increased in- terest in developing methods that can directly estimate the phase derivative from a fringe pattern because the phase derivative conveys

A polyhedral study of binary polynomial programs
Oct 19, 2016 - E-mail: [email protected]. † ... E-mail: [email protected]. 1 ... and Lasserre [24] provide automated mechanisms for the generation of sharp ...

A polyhedral study of binary polynomial programs - Semantic Scholar
Oct 19, 2016 - Next, we proceed to the inductive step. Namely ...... programming approach of Balas [2] who gives an extended formulation for the convex hull.