English
Related papers

Related papers: Generalized pentagonal geometries

200 papers

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Computational Geometry · Computer Science 2020-10-09 Stanislaw Ambroszkiewicz

Due to the multi-linearity of tensors, most algorithms for tensor optimization problems are designed based on the block coordinate descent method. Such algorithms are widely employed by practitioners for their implementability and…

Optimization and Control · Mathematics 2022-01-14 Ke Ye , Shenglong Hu

We establish that, over certain ground fields, the set of osculating tangents of Cayley's ruled cubic surface gives rise to a (maximal partial) spread which is also a dual (maximal partial) spread. It is precisely the Betten-Walker spreads…

Algebraic Geometry · Mathematics 2013-04-02 Hans Havlicek , Rolf Riesinger

DeTurck and Yang have shown that in the neighbourhood of every point of a $3$-dimensional Riemannian manifold, there exists a system of orthogonal coordinates (that is, whith respect to which the metric has diagonal form). We show that this…

Differential Geometry · Mathematics 2021-06-15 Paul Gauduchon , Andrei Moroianu

In the frame of the Kerr-Schild approach, we consider the complex structure of Kerr geometry which is determined by a complex world line of a complex source. The real Kerr geometry is represented as a real slice of this complex structure.…

General Relativity and Quantum Cosmology · Physics 2009-11-07 Alexander Burinskii

The Euclidean Steiner problem is the problem of finding a set $St$, with the shortest length, such that $St \cup A$ is connected, where $A$ is a given set in a Euclidean space. The solutions $St$ to the Steiner problem will be called…

Metric Geometry · Mathematics 2025-02-20 Danila Cherkashin , Emanuele Paolini , Yana Teplitskaya

A convex geometry is a closure space satisfying the anti-exchange axiom. For several types of algebraic convex geometries we describe when the collection of closed sets is order scattered, in terms of obstructions to the semilattice of…

Combinatorics · Mathematics 2015-05-13 Kira Adaricheva , Maurice Pouzet

In this paper, we present a generalization of the Askey-Wilson relations that involves a projective geometry. A projective geometry is defined as follows. Let $h>k\geq 1$ denote integers. Let $\mathbb{F}_{q}$ denote a finite field with $q$…

Combinatorics · Mathematics 2024-11-13 Ian Seong

A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…

General Mathematics · Mathematics 2024-10-14 Alexandros Haridis

Given a bichromatic point set $P=\textbf{R} \cup \textbf{B}$ of red and blue points, a separator is an object of a certain type that separates $\textbf{R}$ and $\textbf{B}$. We study the geometric separability problem when the separator is…

Computational Geometry · Computer Science 2022-01-31 Abidha V P , Pradeesha Ashok

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…

Metric Geometry · Mathematics 2007-05-23 Frank Sottile , Thorsten Theobald

In this paper, we introduce the notion of $\mathcal{M}$-convergence and $\mathcal{MN}$-convergence structures in posets, which, in some sense, generalise the well-known Scott-convergence and order-convergence structures. As results, we give…

General Topology · Mathematics 2018-03-20 Hadrian Andradi , Weng Kin Ho

Following the spirit of a recent work of one of the authors (J. Phys. A: Math. Theor. 44 (2011) 045301), the essential structure of the generalized Pauli group of a qubit-qu$d$it, where $d = 2^{k}$ and an integer $k \geq 2$, is recast in…

Quantum Physics · Physics 2011-05-05 Metod Saniga , Michel Planat

Space-Time in general relativity is a dynamical entity because it is subject to the Einstein field equations. The space-time metric provides different geometrical structures: conformal, volume, projective and linear connection. A deep…

General Relativity and Quantum Cosmology · Physics 2008-11-26 Ignacio Sanchez-Rodriguez

A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most $k$ in a geometric graph $G$ is self-intersecting we call $G$ $k$-locally plane. The main result of this paper is a construction…

Combinatorics · Mathematics 2011-11-01 Gábor Tardos

In this document, we study the interaction between different geometric structures that can be defined as morphisms of sections of the generalized tangent bundle $\mathbb TM:= TM\oplus T^*M\to M$. In particular, we show the behaviour of…

Differential Geometry · Mathematics 2025-07-22 Fernando Etayo , Pablo Gómez-Nicolás , Rafael Santamaría

Sets of three types of convex pentagons that are aperiodic with no matching conditions on the edges are created from a chiral aperiodic monotile Tile(1, 1). This method divides the interior of Tile(1,1) into five convex polygons with five…

Metric Geometry · Mathematics 2025-01-16 Teruhisa Sugimoto

A geometric $t$-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most $t$ times the Euclidean distance between the points. Informally, a spanner is $\mathcal{O}(k)$-robust if…

Computational Geometry · Computer Science 2018-03-26 Kevin Buchin , Tim Hulshof , Dániel Oláh