Related papers: Symplectifying Biarcs
This paper, motivated by problems in Diophantine analysis which can be formulated as problems of finding rational points on the intersection of two quadrics, presents an explicit construction of a rationally defined isomorphism (biregular…
We study the relation between the type of a double point of a plane curve and the curvilinear 0-dimensional subschemes of the curve at the point. An Algorithm related to a classical procedure for the study of double points via osculating…
The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…
We study analytic surfaces in 3-dimensional Euclidean space containing two circular arcs through each point. The problem of finding such surfaces traces back to the works of Darboux from XIXth century. We reduce finding all such surfaces to…
We introduce cosymplectic circles and cosymplectic spheres, which are the analogues in the cosymplectic setting of contact circles and contact spheres. We provide a complete classification of compact 3-manifolds that admit a cosymplectic…
A circle pattern is a configuration of circles in the plane whose combinatorics is given by a planar graph G such that to each vertex of G corresponds a circle. If two vertices are connected by an edge in G, the corresponding circles…
We prove a general counting result for arcs of the same type in compact surfaces. Wealso count infinite arcs in cusped surfaces and arcs in orbifolds. These theorems are derived from aresult that guarantees the convergence of certain…
Contact Geometry is an odd dimensional analogue of Symplectic Geometry. This vague idea can actually be formalized in a rather precise way by means of a Symplectic-to-Contact Dictionary. The aim of this review paper is discussing the basic…
In this note, we completely describe the shape of the bisector of two given points in a two-dimensional normed vector space. More precisely, we show that, depending on the position of two given points with respect to the shape of the unit…
This paper is a survey on arc spaces, a recent topic in algebraic geometry and singularity theory. The geometry of the arc space of an algebraic variety yields several new geometric invariants and brings new light to some classical…
We describe convex hulls of the simplest compact space curves, reducible quartics consisting of two circles. When the circles do not meet in complex projective space, their algebraic boundary contains an irrational ruled surface of degree…
A simplex is said to be orthocentric if its altitudes intersect in a common point, called its orthocenter. In this paper it is proved that if any two of the traditional centers of an orthocentric simplex (in any dimension) coincide, then…
A basic problem in linear particle optics is to find a symplectic transformation that brings the (symmetric) beam matrix to a special diagonal form, called normal form. The conventional way to do this involves an eigenvalue-decomposition of…
We consider the Keplerian arcs around a fixed Newtonian center joining two prescribed distinct positions in a prescribed flight time. We prove that, putting aside the "opposition case" where infinitely many planes of motion are possible,…
Symplectic maps can provide a straightforward and accurate way to visualize and quantify the dynamics of conservative systems with two degrees of freedom. These maps can be easily iterated from the simplest computers to obtain trajectories…
We apply the circle method to obtain an asymptotic formula for the number of integral points on a certain sliced cubic hypersurface related to the Segre cubic. Unusually, the major and minor arc integrals in this application are both…
An algorithm to generate the locus of a circle using the intersection points of straight lines is proposed. The pixels on the circle are plotted independent of one another and the operations involved in finding the locus of the circle from…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
A procedure for interpolating between specified points of a curve or surface is described. The method guarantees slope continuity at all junctions. A surface panel divided into p x q contiguous patches is completely specified by the…
In a companion paper, we introduced a notion of multi-Dirac structures, a graded version of Dirac structures, and we discussed their relevance for classical field theories. In the current paper we focus on the geometry of multi-Dirac…