中文
相关论文

相关论文: Viviani Polytopes and Fermat Points

200 篇论文

Let P be a d-dimensional n-point set. A Tverberg-partition of P is a partition of P into r sets P_1, ..., P_r such that the convex hulls conv(P_1), ..., conv(P_r) have non-empty intersection. A point in the intersection of the conv(P_i)'s…

计算几何 · 计算机科学 2020-07-02 Wolfgang Mulzer , Daniel Werner

A smooth curve in the real projective plane is hyperbolic if its ovals are maximally nested. By the Helton-Vinnikov Theorem, any such curve admits a definite symmetric determinantal representation. We use polynomial homotopy continuation to…

代数几何 · 数学 2016-07-05 Anton Leykin , Daniel Plaumann

In this paper, we generalized the classical Fermat point, proved the sufficient and necessary condition for uniqueness and existence for the generalized Fermat point(GFP) theorem, and discuss some interesting geometric property of the…

度量几何 · 数学 2013-06-07 Yao Xiao , Zhang Zhao , Zhang Han , Zeng Yong

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

组合数学 · 数学 2019-09-16 Toshinori Sakai , Jorge Urrutia

Pick's theorem is used to prove that if $P$ is a lattice polygon (that is, the convex hull of a finite set of lattice points in the plane), then every lattice point in the $h$-fold sumset $hP$ is the sum of $h$ lattice points in $P$.

数论 · 数学 2020-04-17 Karl Levy , Melvyn B. Nathanson

Let $K\subset \mathbb{R}^n$ be a convex body and let $p$ in the interior of $ K$, $n \geq 3$. The point $p$ is said to be a \textit{Larman point} of $K$ if, for every hyperplane $\Pi$ passing through $p$, the section $\Pi\cap K$ has a…

度量几何 · 数学 2025-09-23 Efrén Morales-Amaya

We present a study on strong t-continuity and measure of discontinuity on PN spaces. As an application, we prove a fixed point theorem for a self mapping on PN spaces by means of measure of discontinuity.

泛函分析 · 数学 2007-06-12 Mohd Rafi

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…

计算几何 · 计算机科学 2007-05-23 Rolf Klein , Martin Kutz

Let $C$ be a smooth plane curve. A point $P$ in the projective plane is said to be Galois with respect to $C$ if the function field extension induced from the point projection from $P$ is Galois. We denote by $\delta(C)$ (resp.…

代数几何 · 数学 2013-08-08 Satoru Fukasawa

We introduce a family of mathematical objects called $\mathcal{P}$-schemes, where $\mathcal{P}$ is a poset of subgroups of a finite group $G$. A $\mathcal{P}$-scheme is a collection of partitions of the right coset spaces $H\backslash G$,…

计算复杂性 · 计算机科学 2017-09-26 Zeyu Guo

Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…

组合数学 · 数学 2013-06-11 Richard P. Stanley

A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two points x, y, are contained in the strip boundaries, and are…

计算几何 · 计算机科学 2011-08-11 Boris Aronov , Muriel Dulieu

Let $G$ be a cyclic $p$-group or generalized quaternion group, $X\in \pi_0 S_G$ be a virtual $G$-set, and $V$ be a fixed point free complex $G$-representation. Under conditions depending on the sizes of $G$, $X$, and $V$, we construct a…

代数拓扑 · 数学 2025-03-21 William Balderrama , Yueshi Hou , Shangjie Zhang

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

复变函数 · 数学 2019-09-11 Sushil Gorai

For a given $\pi=(\pi_0, \pi_1,..., \pi_k) \in \{0, 1, *\}^{k+1}$, we want to determine whether an input $k$-uniform hypergraph $G=(V, E)$ has a partition $(V_1, V_2)$ of the vertex set so that for all $X \subseteq V$ of size $k$, $X \in E$…

计算复杂性 · 计算机科学 2018-12-27 Seonghyuk Im

In this paper we present proofs of basic results, including those developed so far by H. Bell, for the plane fixed point problem. Some of these results had been announced much earlier by Bell but without accessible proofs. We define the…

一般拓扑 · 数学 2008-10-20 Robbert J. Fokkink , John C. Mayer , Lex G. Oversteegen , E. D. Tymchatyn

We present a numerical method for computing the \textit{Fermi} and \textit{observational coordinates} of a distant test particle with respect to an observer. We apply this method for computing some previously introduced concepts of relative…

广义相对论与量子宇宙学 · 物理学 2015-02-18 Vicente J. Bolós

In this paper we consider the curves $H_{k,t}^{(p)} : y^{p^k}+y=x^{p^{kt}+1}$ over $\mathbb F_p$ and and find an exact formula for the number of $\mathbb F_{p^n}$-rational points on $H_{k,t}^{(p)}$ for all integers $n\ge 1$. We also give…

代数几何 · 数学 2018-07-16 Emrah Sercan Yılmaz

For two non-congruent regular polygons of the same type, the method of finding the points in the plane at the equal distances to the vertices, is established. The existence of two points with this property is proved for two polygons with a…

综合数学 · 数学 2022-06-22 Mamuka Meskhishvili

Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…