相关论文: Ptolemy Constants as Described by Eccentricity

Let $G$ be a connected graph. The eccentricity of a path $P$, denoted by ecc$_G(P)$, is the maximum distance from $P$ to any vertex in $G$. In the \textsc{Central path} (CP) problem our aim is to find a path of minimum eccentricity. This…

Euler's elastica is defined by a critical point of the total squared curvature under the fixed length constraint, and its $L^p$-counterpart is called $p$-elastica. In this paper we completely classify all $p$-elasticae in the plane and…

Ptolemy-s planetary model is an ancient geocentric astronomical model, describing the observed motion of the Sun and the planets. Ptolemy accounted for the deviations of planetary orbits from perfect circles by introducing two small and…

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

We define Ptolemy coordinates for representations that are not necessarily boundary-unipotent. This gives rise to a new algorithm for computing the SL(2,C) A-polynomial, and more generally the SL(n,C) A-varieties. We also give a formula for…

Let $G$ be a graph on $n$ nodes with algebraic connectivity $\lambda_{2}$. The eccentricity of a node is defined as the length of a longest shortest path starting at that node. If $s_\ell$ denotes the number of nodes of eccentricity at most…

A singular point on a plane conic defined over $\mathbb{Q}$ is a transcendental point of the curve which admits very good rational approximations, uniformly in terms of the height. Extremal numbers and Sturmian continued fractions are…

Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb H^d$ in such a way that it admits a transitive action by isometries of $\mathbb H^d$. Let $p_0$ be the supremum of such percolation parameters that…

In this note the following is shown. Consider the quadratic form on (complex) matrices Q(A):=tr(A^2). Let A be such a matrix. Then an ellipse can be found, with the vector from center to focus determined by the value of Q at the traceless…

The eccentricity of a vertex, $ecc_T(v) = \max_{u\in T} d_T(v,u)$, was one of the first, distance-based, tree invariants studied. The total eccentricity of a tree, $Ecc(T)$, is the sum of eccentricities of its vertices. We determine…

Let $G$ be a connected graph of order $n$. The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is the mean of all eccentricities in $G$. We give upper bounds on the…

We study Ptolemy constant and uniformity constant in various plane domains including triangles, quadrilaterals and ellipses.

The eccentricity (anti-adjacency) matrix $\varepsilon(G)$ of a graph $G$ is obtained from the distance matrix by retaining the eccentricities in each row and each column. This matrix is first defined in 2018 by Wang et al. \cite{1}. In this…

The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…

Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let G(n,p) denote a random graph on n vertices with edge probability p. Bollobas, Catlin and Erdos asymptotically…

A closed convex polytope in n dimensions defined by m linear inequality constraints is considered. If L is a straight line drawn in any direction from any feasible point P, then in general, it intersects every constraint at one point,…

If $ABC$ is a given triangle in the plane, $P$ is any point not on the extended sides of $ABC$ or its anticomplementary triangle, $Q$ is the complement of the isotomic conjugate of $P$ with respect to $ABC$, $DEF$ is the cevian triangle of…

Let psi: R^n --> R^k be a map defined by k positive definite quadratic forms on R^n. We prove that the relative entropy (Kullback-Leibler) distance from the convex hull of the image of psi to the image of psi is bounded above by an absolute…

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. The orbit of a convex polygon under this map is a sequence of polygons which converges…

The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity $ecc (G)$ of a graph $G$ is the mean value of eccentricities of all vertices of $G$. The average eccentricity is deeply connected…