Related papers: Finding the Fermat point via analysis
The values of the determinant of Vandermonde matrices with real elements are analyzed both visually and analytically over the unit sphere in various dimensions. For three dimensions some generalized Vandermonde matrices are analyzed…
We prove a lower bound that agrees with Manin's prediction for the number of rational points of bounded height on the Fermat cubic surface. As an application we provide a simple counterexample to Manin's conjecture over the rationals.
Ptolemy's inequality is a classic relationship between the distances among four points in Euclidean space. Another relationship between six distances is the 4-point condition, an inequality satisfied by the lengths of the six paths that…
The purpose of this work is to collect in one place available information on line arrangements known in the literature as braid, monomial, Ceva or Fermat arrangement. They have been studied for a long time and appeared recently in…
We quantify the set of known exponent pairs $(k, \ell)$ and develop a framework to compute the optimal exponent pair for an arbitrary objective function. Applying this methodology, we make progress on several open problems, including bounds…
We provide the general solution of problems concerning AC star circuits by turning them into geometric problems. We show that one problem is strongly related to the Fermat-point of a triangle. We present a solution that is well adapted to…
In recent years, important progress has been made in applying methods and techniques of convex optimization to many fields of applications such as location science, engineering, computational statistics, and computer science. In this paper,…
We verify functional a posteriori error estimate proposed by S. Repin for a class of obstacle problems. The obstacle problem is formulated as a quadratic minimization problem with constrains equivalently formulated as a variational…
Using modularity, level lowering, and explicit computations with Hilbert modular forms, Galois representations and ray class groups, we show that for $3 \le d \le 23$ squarefree, $d \ne 5$, $17$, the Fermat equation $x^n+y^n=z^n$ has no…
The Lambert problem is to determine the gravitational orbit between two points that has a specified time of flight, allowing the second point to be a moving target such as a satellite. After a review of gravitational orbits, a solution of…
This paper provides the solution of the Riemann-Papperitz equation with singular points at z=-i,i.This solution is obtained by mapping the singular points into points 0,infinity. The solution is then obtained in terms of the Gauss…
A two-point ray-tracing technique for 3D smoothly heterogeneous, weakly transversely-isotropic media is based on Fermat's principle and takes advantage of global Chebyshev approximation of both the model and curved rays. This approximation…
Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is to find a point in the intersection of the fixed point sets of these operators. Instances of the problem have numerous…
In a recent paper, the first author provided some lower bounds to solutions of the equations of Fermat and Catalan, based on local power series developments at the ramified prime of a prime cyclotomic extension. Although both equations have…
We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…
Fermat's principle and variational analysis is used to analyze the trajectories of light propagating in a radially inhomogeneous medium with a singularity in the center. It is found that the light trajectories are similar to those around a…
In nearest-neighbor classification problems, a set of $d$-dimensional training points are given, each with a known classification, and are used to infer unknown classifications of other points by using the same classification as the nearest…
The purpose of [1] was as follows. ?We consider special sets of continuants which occur in applications. For these sets we solve the problem of finding maximal and minimal continuants. There are several methods for finding extremum such as…
We consider various problems related to finding points in $\Q^{2}$ and in $\Q^{3}$ which lie at rational distance from the vertices of some specified geometric object, for example, a square or rectangle in $\Q^{2}$, and a cube or…
Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…