Related papers: A Construction to find any Circle through a Given …
In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.
In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…
This paper provides a new simple proof of Hesse's theorem in projective geometry for any dimension.
The aim of this paper is to generalize Apollonius' problem. The problem is to construct a circle that is tangent to three given circles in a plane. We find the maximum possible number of solution circles in the case of more than the three…
Several authors have remarked the convenience of understanding the different notions of center appearing in Geometry (centroid of a set of points, incenter of a triangle, center of a conic and many others) as functions. The most general way…
A set of rational points on a curve is said to be in geometric progression if either the abscissae or the ordinates of the points are in geometric progression. Examples of three points in geometric progression on a circle are already known.…
The Hodge Conjecture is equivalent to a statement about conditions under which a complex vector bundle on a smooth complex projective variety admits a holomorphic structure. I advertise a class of abelian four-folds due to Mumford where…
We present a method for constructing all bounded rational motions that frame a space curve $\mathbf{r}(t)$. This means that the motion guides an orthogonal frame along the curve such that one frame axis is in direction of the curve tangent.…
There are known constructions for some regular polygons, usually inscribed in a circle, but not for all polygons - the Gauss-Wantzel Theorem states precisely which ones can be constructed. The constructions differ greatly from one polygon…
We prove that a surface in real 3-space containing a line and a circle through each point is a quadric. We also give some particular results on the classification of surfaces containing several circles through each point.
A half-geodesic is a closed geodesic realizing the distance between any pair of its points. All geodesics in a round sphere are half-geodesics. Conversely, this note establishes that Riemannian spheres with all geodesics closed and…
We calculate a Griffiths-type ring for smooth complete intersection in Grassmannians. This is the analogue of the classical Jacobian ring for complete intersections in projective space, and allows us to explicitly compute their Hodge…
Among other things, it is shown that for every pair of positive integers $r$, $d$, satisfying $1<r<d\leq 2r$, and every finite simple graph $H,$ there is a connected graph $G$ with diameter $d$, radius $r$, and center $H.$
In this follow-up article to Symplectification of Circular Arcs and Arc Splines, biarc geometry is examined from a purely geometric point of view. Two given points together with their associated tangent vectors in the plane are sufficient…
We present a concise self-contained inversive geometry solution of the three-circle problem of Steiner of constructing a circle that intersects each of the three given circles at one of the three given angles.
We consider a problem in computational origami. Given a piece of paper as a convex polygon $P$ and a point $f$ located within, fold every point on a boundary of $P$ to $f$ and compute a region that is safe from folding, i.e., the region…
We show that there is an almost complex structure on a differential calculus on finite points coming from a bidirected finite graph without multiple edges or loops. We concentrate on a polygon as a concrete case. In particular, a…
We establish a parametric extension $h$-principle for overtwisted contact structures on manifolds of all dimensions, which is the direct generalization of the $3$-dimensional result from \cite{Eli89}. It implies, in particular, that any…
For some geometries including symplectic and contact structures on an n-dimensional manifold, we introduce a two-step approach to Gromov's h-principle. From formal geometric data, the first step builds a transversely geometric Haefliger…
A constructive method is given for obtaining cospectral vertices in undirected graphs, along with an operation that preserves this construction. We prove that the construction yields cospectral vertices, as well as strongly cospectral…