Related papers: An Etude on One Sharygin's Problem
Choosing the appropriate geometry in which to express the equations of fundamental physics can have a determinant effect on the simplicity of those equations and on the way they are perceived. The point of departure in this paper is the…
Survey talk on certain aspects of the subject, stressing the neighbor relation as a basic notion in differential geometry.
By a simple method we prove the following conjecture on Sharygin triangles: there is only one Sharygin triangle (up to an isometry) whose vertices are chosen from the set of vertices of a regular polygon inscribed in a circle of radius 1.
A synaptic algebra is a generalization of the Jordan algebra of selfadjoint elements of a von Neumann algebra. We study symmetries in synaptic algebras, i.e., elements whose square is the unit element, and we investigate the equivalence…
Constructive-deductive method for plane Euclidean geometry is proposed and formalized within Coq Proof Assistant. This method includes both postulates that describe elementary constructions by idealized geometric tools (pencil, straightedge…
We study geometric structures arising from Hermitian forms on linear spaces over real algebras beyond the division ones. Our focus is on the dual numbers, the split-complex numbers, and the split-quaternions. The corresponding geometric…
We introduce an original approach to geometric calculus in which we define derivatives and integrals on functions which depend on extended bodies in space--that is, paths, surfaces, and volumes etc. Though this theory remains to be fully…
Conjecturing and theorem proving are activities at the center of mathematical practice and are difficult to separate. In this paper, we propose a framework for completing incomplete conjectures and incomplete proofs. The framework can turn…
Derived geometry provides powerful tools to handle non-transverse intersections and singular moduli problems arising in geometry and theoretical physics. While derived algebraic geometry has been extensively developed, classical field…
In this paper we construct several arrangements of lines and/or conics that are derived from the geometry of the Klein arrangement of $21$ lines in the complex projective plane.
Geometry is essentially a global language, which is fully understood in different times, countries and cultures. The proof of a geometric theorem (e.g. the Pythagorean Theorem) or a geometric construction (e.g. the construction of an…
Certain many-particle Hardy inequalities are derived in a simple and systematic way using the so-called ground state representation for the Laplacian on a subdomain of $\mathbb{R}^n$. This includes geometric extensions of the standard Hardy…
The method of application of areas as presented in Euclid's Elements, is employed to generate the three conics as the loci of points with Cartesian coordinates satisfying quadratic equations with coefficients defined by the initial settings…
The polygon retrieval problem on points is the problem of preprocessing a set of $n$ points on the plane, so that given a polygon query, the subset of points lying inside it can be reported efficiently. It is of great interest in areas such…
We try to convince the reader that the categorical version of differential geometry, called Synthetic Differential Geometry (SDG), offers valuable tools which can be applied to work with some unsolved problems of general relativity. We do…
Projective geometry provides the preferred framework for most implementations of Euclidean space in graphics applications. Translations and rotations are both linear transformations in projective geometry, which helps when it comes to…
This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…
We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…
Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…
The main results of A. Zorich and I. Dynnikov about plane sections of periodic surfaces are extended to the PL case. As an application, the Stereographic Map of a truncated octahedron, extended to the whole $\Rt$ by periodicity, is analyzed…