Euclidean geometry as algorithm for construction of generalized geometries

Yuri A. Rylov

Home/Archive/arXiv

arXiv · math/0511575

Euclidean geometry as algorithm for construction of generalized geometries

Yuri A. Rylov

View original source ↗Read source document ↗Export metadata ↓

Abstract

It is shown that the generalized geometries may be obtained as a deformation of the proper Euclidean geometry. Algorithm of construction of any proposition S of the proper Euclidean geometry E may be described in terms of the Euclidean world function sigma_E in the form S(sigma_E). Replacing the Euclidean world function sigma_E by the world function sigma of the geometry G, one obtains the corresponding proposition S(sigma) of the generalized geometry G. Such a construction of the generalized geometries (known as T-geometries) uses well known algorithms of the proper Euclidean geometry and nothing besides. This method of the geometry construction is very simple and effective. Using T-geometry as the space-time geometry, one can construct the deterministic space-time geometries with primordially stochastic motion of free particles and geometrized particle mass. Such a space-time geometry defined properly (with quantum constant as an attribute of geometry) allows one to explain quantum effects as a result of the statistical description of the stochastic particle motion (without a use of quantum principles).

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

Yuri A. Rylov. 2005-11-23. Euclidean geometry as algorithm for construction of generalized geometries. https://arxiv.org/abs/math/0511575

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗