Related papers: Finding an Ellipse Tangent to finitely many given …
This is a letter to the editor concerning Semjon Adlaj's article "An eloquent formula for the perimeter of an ellipse", AMS Notices 59, 8 (2012), 1094-1099.
See http://www.math.msu.edu/~abbas or Wiley preprint server.
This is an informal paper presenting historical results around the recent paper of the author about Lang's Conjecture and torsion of elliptic curves. This paper also discusses a few aspects of the proof.
We close a gap appearing at the same time in the author's thesis "Iterated rings of bounded elements and generalizations of Schm\"udgen's theorem" [1] and in the author's article "Iterated rings of bounded elements and generalizations of…
We prove the existence of infinitely many solutions to an elliptic problem by borrowing the techniques from algebraic topology. The solution(s) thus obtained will also be proved to be bounded.
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…
We compute the limit of tangents of an arbitrary surface. We obtain as a byproduct an embedded version of Jung's desingularization theorem for surface singularities with finite limits of tangents.
We provide some examples which give evidence to the conjectures contained in my paper "Finiteness of $p$-Divisible Sets of Multiple Harmonic Sums" (math.NT/0303043). All the main theoretical results can be found in that paper.
We propose a pattern recognition method that identifies the common tangent lines of a set of ellipses. The detection of the tangent lines is attained by applying the Legendre transform on a given set of ellipses. As context, we consider a…
In this paper we present some interesting results involving summation of series in particular trigonometric ones. We failed to locate these results in existing literature or in the web like MathWorld (http://mathworld.wolfram.com/) nor…
We describe a method by which the number of intersections one ellipse makes inside the plane of another can be determined. The method is based on applying a transformation that reverts one ellipse to the unit circle, and examining the…
This paper generalizes the result of Elmachtoub et al to any weighted barycenter, where a transformation is considered which takes an arbitrary point of division $\xi \in (0,1)$ of the segments of a polygon with $n$ vertices. We then…
A hybrid methodology for the resolution of text-level ellipsis is presented in this paper. It incorporates conceptual proximity criteria applied to ontologically well-engineered domain knowledge bases and an approach to centering based on…
We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…
In this article, we are interested in finding rational points on certain superelliptic curves.
We propose a simple derivation of an upper bound for the perimeter of an ellipse. The procedure, which relies on the use of elliptic integrals, consists in introducing, via inequalities and convexity properties, specific integrals which can…
In this paper I survey some recent results on finite determination, convergence, and approximation of formal mappings between real submanifolds in complex spaces. A number of conjectures are also given.
For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…
We give the distribution of points on smooth superelliptic curves over a fixed finite field, as their degree goes to infinity. We also give the distribution of points on smooth m-fold cyclic covers of the line, for any m, as the degree of…
The paper concerns singular solutions of nonlinear elliptic equations.