中文
相关论文

相关论文: The twist angle of weighted Steiner minimal trees …

200 篇论文

We study the trigonometry of non-Euclidean tetrahedra using tools from algebraic geometry. We establish a bijection between non-Euclidean tetrahedra and certain rational elliptic surfaces. We interpret the edge lengths and the dihedral…

代数几何 · 数学 2021-06-08 Daniil Rudenko

The purpose of this paper is to expose and investigate natural phase-space formulations of two longstanding problems in the restriction theory of the Fourier transform. These problems, often referred to as the Stein and Mizohata--Takeuchi…

经典分析与常微分方程 · 数学 2025-10-07 Jonathan Bennett , Susana Gutierrez , Shohei Nakamura , Itamar Oliveira

In this paper, we study the necessary conditions and sufficient conditions for the twisted angles of the central configurations formed by two twisted regular polygons, specially, we prove that for the 2N-body problems, the twisted angles…

经典分析与常微分方程 · 数学 2011-10-18 Yu Xiang , Zhang Shiqing

A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…

组合数学 · 数学 2013-03-25 Boris Bukh , Jiří Matoušek , Gabriel Nivasch

The twisted index of 3d $\mathcal{N}=2$ gauge theories on $S^1 \times \Sigma$ has an algebro-geometric interpretation as the Witten index of an effective supersymmetric quantum mechanics. In this paper, we consider the contributions to the…

高能物理 - 理论 · 物理学 2023-06-23 Mathew Bullimore , Andrea E. V. Ferrari , Heeyeon Kim , Guangyu Xu

In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more…

计算几何 · 计算机科学 2024-05-02 Sergio Cabello , Michael Hoffmann , Katharina Klost , Wolfgang Mulzer , Josef Tkadlec

Optimal transport provides a metric which quantifies the dissimilarity between probability measures. For measures supported in discrete metric spaces, finding the optimal transport distance has cubic time complexity in the size of the…

机器学习 · 计算机科学 2024-01-30 Samantha Chen , Puoya Tabaghi , Yusu Wang

Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a…

数据结构与算法 · 计算机科学 2020-06-29 Sean Cleary , Haris Nadeem

We construct knot invariants on the basis of ascribing Euclidean geometric values to a triangulation of sphere S^3 where the knot lies. The main new feature of this construction compared to the author's earlier papers on manifold invariants…

几何拓扑 · 数学 2007-05-23 I. G. Korepanov

In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals. In this paper we consider the min-power…

数据结构与算法 · 计算机科学 2012-05-17 Fabrizio Grandoni

The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or…

计算几何 · 计算机科学 2008-09-05 Sandor P. Fekete , Marco Luebbecke , Henk Meijer

The geometric bottleneck Steiner network problem on a set of vertices $X$ embedded in a normed plane requires one to construct a graph $G$ spanning $X$ and a variable set of $k\geq 0$ additional points, such that the length of the longest…

组合数学 · 数学 2013-01-22 M. Brazil , C. J. Ras , D. A. Thomas

We introduce a new structure for a set of points in the plane and an angle $\alpha$, which is similar in flavor to a bounded-degree MST. We name this structure $\alpha$-MST. Let $P$ be a set of points in the plane and let $0 < \alpha \le…

计算几何 · 计算机科学 2014-02-26 Rom Aschner , Matthew J. Katz

We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size $n$ distributed among the leaves of a balanced hierarchically separated tree. We consider {\it monochromatic} and…

离散数学 · 计算机科学 2013-07-29 Béla Csaba , Thomas A. Plick , Ali Shokoufandeh

We study search trees with 2-way comparisons (2WCST's), which involve separate less-than and equal-to tests in their nodes, each test having two possible outcomes, yes and no. These trees have a much subtler structure than standard search…

数据结构与算法 · 计算机科学 2023-12-08 Sunny Atalig , Marek Chrobak

We consider the $k$-prize-collecting Steiner tree problem. An instance is composed of an integer $k$ and a graph $G$ with costs on edges and penalties on vertices. The objective is to find a tree spanning at least $k$ vertices which…

计算复杂性 · 计算机科学 2019-11-22 Lehilton Lelis Chaves Pedrosa , Hugo Kooki Kasuya Rosado

We present an invariant of a three-dimensional manifold with a framed knot in it based on the Reidemeister torsion of an acyclic complex of Euclidean geometric origin. To show its nontriviality, we calculate the invariant for some framed…

几何拓扑 · 数学 2014-11-12 Jérôme Dubois , Igor G. Korepanov , Evgeniy V. Martyushev

Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by…

几何拓扑 · 数学 2007-06-06 Daryl Cooper , Stephan Tillmann

The Ernst equation is formulated on an arbitrary Riemann surface. Analytically, the problem reduces to finding solutions of the ordinary Ernst equation which are periodic along the symmetry axis. The family of (punctured) Riemann surfaces…

广义相对论与量子宇宙学 · 物理学 2009-10-22 D. Korotkin , H. Nicolai

We prove that the twisted Reidemeister torsion of a 3-manifold corresponding to a fibered class is monic and we show that it gives lower bounds on the Thurston norm. The former fixes a flawed proof in [FV10], the latter gives a quick…

几何拓扑 · 数学 2013-01-30 Stefan Friedl