中文
相关论文

相关论文: A knotted minimal tree

200 篇论文

We prove that if an $n$-vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T\subset G$ even when the minimum degree of $G$ is less than $n/2$ by a linear term. We avoid the use of the Regularity lemma,…

组合数学 · 数学 2026-05-29 Béla Csaba

We prove that the tree-width of graphs in a hereditary class defined by a finite set $F$ of forbidden induced subgraphs is bounded if and only if $F$ includes a complete graph, a complete bipartite graph, a tripod (a forest in which every…

组合数学 · 数学 2021-01-06 Vadim Lozin , Igor Razgon

We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…

动力系统 · 数学 2022-01-07 A. Baraviera , R. Leplaideur

The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T. In the case where the vertices…

计算复杂性 · 计算机科学 2016-01-13 Saber Mirzaei

This paper is the fifth and final in a series on embedded minimal surfaces. Following our earlier papers on disks, we prove here two main structure theorems for non-simply connected embedded minimal surfaces of any given fixed genus. The…

微分几何 · 数学 2012-11-21 Tobias H. Colding , William P. Minicozzi

A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…

组合数学 · 数学 2025-07-17 Christopher N. Aagaard , J. J. P. Veerman

We show that in $(S^3,\xi_{std})$ if $K$ is a non-trivial knot that realizes the three-dimensional Thurston-Bennequin bound (i.e. $K$ has a Legendrian representative $\Lambda$ with $tb(\Lambda)-rot(\Lambda)=2g(K)-1$), then $K$ has a…

几何拓扑 · 数学 2024-10-31 Zhenkun Li , Shunyu Wan

Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…

计算几何 · 计算机科学 2024-10-16 Michael N. Vrahatis

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

组合数学 · 数学 2020-02-20 José Aliste-Prieto , Anna de Mier , José Zamora

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

几何拓扑 · 数学 2007-05-23 Basudeb Datta

Let G be a graph in a 3-manifold M. We compress the pair (M,G) along admissible 2-spheres as long as possible. What we get is a root of (M,G). Our main result is that for any pair (M,G) the root exists and is unique. As a corollary we get…

几何拓扑 · 数学 2007-05-23 Sergei Matveev

We show that the Minimal Length-Bounded L-But problem can be computed in linear time with respect to L and the tree-width of the input graph as parameters. In this problem the task is to find a set of edges of a graph such that after…

数据结构与算法 · 计算机科学 2016-10-25 Dušan Knop , Pavel Dvořák

It is a classical result that an unrooted tree $T$ having positive real-valued edge lengths and no vertices of degree two can be reconstructed from the induced distance between each pair of leaves. Moreover, if each non-leaf vertex of $T$…

组合数学 · 数学 2017-07-26 Stefan Gruenewald , Katharina T. Huber , Vincent Moulton , Mike Steel

Given a digraph $D$, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in $D$ an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. We prove that MinLOB is polynomial-time…

数据结构与算法 · 计算机科学 2008-10-14 G. Gutin , I. Razgon , E. J. Kim

We give a local analytic characterization that a minimal surface in the 3-sphere $\, \ES^3 \subset \R^4$ defined by an irreducible cubic polynomial is one of the Lawson's minimal tori. This provides an alternative proof of the result by…

微分几何 · 数学 2014-07-14 Joe S. Wang

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

组合数学 · 数学 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle

A knot in $S^3$ is topologically slice if it bounds a locally flat disk in $B^4$. A knot in $S^3$ is rationally slice if it bounds a smooth disk in a rational homology ball. We prove that the smooth concordance group of topologically and…

几何拓扑 · 数学 2023-04-14 Jennifer Hom , Sungkyung Kang , JungHwan Park

In recent work with Kusner, we developed a method, based on the equivariant optimization of Laplace and Steklov eigenvalues, for producing minimal surfaces of prescribed topology in low-dimensional balls and spheres. We used the method to…

微分几何 · 数学 2025-02-17 Mikhail Karpukhin , Peter McGrath , Daniel Stern

Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…

微分几何 · 数学 2024-07-18 Gustave Bainier , Benoit Marx , Jean-Christophe Ponsart

Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…

几何拓扑 · 数学 2007-05-23 Thomas A. Gittings