Related papers: On sharp local turns of planar polynomials
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Generalizing Milnor's result that an FTC (finite total curvature) knot has an isotopic inscribed polygon, we show that any two nearby knotted FTC graphs are isotopic by a small isotopy. We also show how to obtain sharper constants when the…
We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…
Macdonald studied a discrete volume measure for a rational polytope $P$, called solid angle sum, that gives a natural discrete volume for $P$. We give a local formula for the codimension two quasi-coefficient of the solid angle sum of $P$.…
Nebe, Rains and Sloane studied the polynomial invariants for real and complex Clifford groups and they relate the invariants to the space of complete weight enumerators of certain self-dual codes. The purpose of this paper is to show that…
In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…
We discuss a form of a well-known problem of Kakeya for complex polynomials. Let p(z) be a complex polynomial. This problem requires to find disc that contains n zeros of some derivative of p(z), provided that location of several zeros of…
It is proved that any smooth open Whitney umbrella in $\mathbb C^2$ is locally polynomially convex near the singular point.
We solve some problems about relative lengths of Maltsev conditions, in particular, we give an affirmative answer to a classical problem raised by A. Day more than fifty years ago. In detail, both congruence distributive and congruence…
In the first part of this paper, we prove that, under some natural non-degeneracy assumptions, the Greedy Parabolic Target-Following Method, based on {\em universal tangent direction} has a favorable local behavior. In view of its global…
We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…
We investigate necessary and sufficient conditions for an arbitrary polynomial of degree $n$ to be trivial, i.e. to have the form $a(z-b)^n$. These results are related to an open problem, conjectured in 2001 by E. Casas- Alvero. It says,…
Consider a Shimura curve $X^D_0(N)$ over the rational numbers. We determine criteria for the twist by an Atkin-Lehner involution to have points over a local field. As a corollary we give a new proof of the theorem of Jordan-Livn\'e on…
We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…
Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…
In a Riemannian manifold, it is well known that the scalar curvature at a point can be recovered from the volumes (areas) of small geodesic balls (spheres). We show the scalar curvature is likewise determined by the relative capacities of…
A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…
The present paper is a continuation of the author's previous works, in which necessary and sufficient local extrema at a stationary point of a polynomial or a power series (and thus of an analytic function) are given. It is known that for…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…