English
Related papers

Related papers: Ellipse Hyperbola and Their Conjunction

200 papers

A polyellipse is a curve in the Euclidean plane all of whose points have the same sum of distances from finitely many given points (focuses). The classical version of Erd\H{o}s-Vincze's theorem states that regular triangles can not be…

Metric Geometry · Mathematics 2018-01-09 Csaba Vincze , Zoltán Kovács , Zsófia Fruzsina Csorvássy

Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…

Metric Geometry · Mathematics 2008-02-12 Jean-Luc Marichal , Michael J. Mossinghoff

We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…

Metric Geometry · Mathematics 2016-05-05 M. Brozos-Vázquez , M. J. Pereira-Sáez , M. J. Souto-Salorio , Ana D. Tarrío-Tobar

In this paper we consider the isoptic curves on the 2-dimensional geometries of constant curvature $\bE^2,~\bH^2,~\cE^2$. The topic is widely investigated in the Euclidean plane $\bE^2$ see for example \cite{CMM91} and \cite{Wi} and the…

Geometric Topology · Mathematics 2013-01-31 Géza Csima , Jenő Szirmai

We consider the closed locus of $r$-tuples of hypersurfaces in $\mathbb{P}^r$ with positive dimensional intersection, and show in a large range of degrees that its largest component is the locus of $r$-tuples of hypersurfaces whose…

Algebraic Geometry · Mathematics 2018-06-29 Dennis Tseng

Observing a linear superposition principle, a family of new minimal hypersurfaces in Euclidean space is found, as well as that linear combinations of generalized helicoids induce new algebraic minimal cones of arbitrarily high degree.

Differential Geometry · Mathematics 2016-06-30 Jens Hoppe

Given a lattice $L$ in the plane, we define the affiliated deep hole lattice $H(L)$ to be spanned by a shortest vector of $L$ and a deep hole of $L$ contained in the triangle with sides corresponding to the shortest basis vectors. We study…

Number Theory · Mathematics 2024-02-22 Lenny Fukshansky , Pavel Guerzhoy , Tanis Nielsen

This paper first gives a brief overview over some interesting descriptions of conic sections, showing formulations in the three geometric algebras of Euclidean spaces, projective spaces, and the conformal model of Euclidean space. Second…

Rings and Algebras · Mathematics 2013-06-06 Eckhard Hitzer

We study the surface area of an ellipsoid in n-dimensional Euclidean space as the function of the lengths of their major semi-axes. We write down an explicit formula as an integral over the unit sphere, use the formula to derive convexity…

Metric Geometry · Mathematics 2007-05-23 Igor Rivin

The equidistant set of two nonempty subsets $K$ and $L$ in the Euclidean plane is a set all of whose points have the same distance from $K$ and $L$. Since the classical conics can be also given in this way, equidistant sets can be…

Metric Geometry · Mathematics 2018-02-13 Csaba Vincze

A hyperbolic polygon is defined to be cyclic, horocyclic, or equidistant if its vertices lie on a metric circle, horocycle, or a component of the equidistant locus to a hyperbolic geodesic, respectively. Convex such $n$-gons are…

Geometric Topology · Mathematics 2015-07-01 Jason DeBlois

Let C be an algebraic curve in a power of an elliptic curve, both defined over the algebraic numbers. We show that the set of algebraic points of C which satisfy certain conditions is a finite set. This result has implications with the…

Number Theory · Mathematics 2008-11-10 Viada Evelina

Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using…

Optimization and Control · Mathematics 2023-12-25 Wouter Kager

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…

cmp-lg · Computer Science 2016-08-31 Mary Dalrymple , Stuart M. Shieber , Fernando C. N. Pereira

We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.

Number Theory · Mathematics 2010-05-31 Irene Garcia-Selfa , Jose M. Tornero

We define hyperbolic Heron triangles (hyperbolic triangles with "rational" side-lengths and area) and parametrize them in two ways as rational points of certain elliptic curves. We show that there are infinitely many hyperbolic Heron…

Number Theory · Mathematics 2021-02-11 Matilde Lalín , Olivier Mila

Given a convex cone in the \emph{prescribed} warped product, we consider hypersurfaces with boundary which are star-shaped with respect to the center of the cone and which meet the cone perpendicularly. If those hypersurfaces inside the…

Differential Geometry · Mathematics 2017-06-02 Li Chen , Jing Mao , Ni Xiang , Chi Xu

We give a method to construct deep holes for elliptic curve codes. For long elliptic curve codes, we conjecture that our construction is complete in the sense that it gives all deep holes. Some evidence and heuristics on the completeness…

Information Theory · Computer Science 2022-07-27 Jun Zhang , Daqing Wan

Factorization structures occur in toric differential and discrete geometry, and can be viewed in multiple ways, e.g., as objects determining substantial classes of explicit toric Sasaki and K\"ahler geometries, as special coordinates on…

Combinatorics · Mathematics 2026-01-21 Roland Púček

Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…

Computational Geometry · Computer Science 2017-06-16 Robert Graham , Adam M. Oberman