中文
相关论文

相关论文: The Topological Tverberg Problem and winding numbe…

200 篇论文

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…

组合数学 · 数学 2013-02-19 Michał Lasoń

The classical Sturm-Hurwitz-Kellogg theorem asserts that a function, orthogonal to an n-dimensional Chebyshev system on a circle, has at least n+1 sign changes. We prove the converse: given an n-dimensional Chebyshev system on a circle and…

微分几何 · 数学 2007-11-01 S. Tabachnikov

A multiobjective optimization problem is $C^r$ simplicial if the Pareto set and the Pareto front are $C^r$ diffeomorphic to a simplex and, under the $C^r$ diffeomorphisms, each face of the simplex corresponds to the Pareto set and the…

最优化与控制 · 数学 2020-04-17 Naoki Hamada , Shunsuke Ichiki

In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…

微分几何 · 数学 2023-11-21 Minghao Li , Ling Yang , Taiyang Zhu

For integers \(r\ge 2\), \(t\ge 1\) and a real number \(a\in(3/2,2]\), we study the typical structure of oriented graphs and digraphs that do not contain a blow-up \(T_{r+1}^t\) of a transitive tournament. We prove that almost every…

组合数学 · 数学 2026-05-26 Meili Liang , Yue Guan , Ruiling Zheng , Jianxi Liu

The van Kampen-Flores theorem states that the $d$-skeleton of a $(2d+2)$-simplex does not embed into $\mathbb{R}^{2d}$. We prove the van Kampen-Flores theorem for triangulations of manifolds satisfying a certain condition on their…

代数拓扑 · 数学 2023-08-29 Daisuke Kishimoto , Takahiro Matsushita

Let $K$ be the graph on vertices $\{1, 2, 3, 4, 5\}$, and having all edges except $(4, 5)$. A continuous map $f:K\to \R^2$ is called an \emph{almost embedding} if $f$-images of non-adjacent edges are disjoint. Take the winding numbers of…

组合数学 · 数学 2025-06-03 T. R. Garaev

We prove a special case of a dynamical analogue of the classical Mordell-Lang conjecture. In particular, let $\phi$ be a rational function with no superattracting periodic points other than exceptional points. If the coefficients of $\phi$…

The classical 1966 theorem of Tverberg with its numerous variations was and still is a motivating force behind many important developments in convex and computational geometry as well as the testing ground for methods from equivariant…

度量几何 · 数学 2019-07-16 Pavle V. M. Blagojevic , Günter M. Ziegler

In this paper we prove two results. The first shows that the Dirichlet-Neumann map of the operator $\Delta_g+q$ on a Riemannian surface can determine its topological, differential, and metric structure. Earlier work of this type assumes a…

偏微分方程分析 · 数学 2024-06-26 Cătălin I. Cârstea , Tony Liimatainen , Leo Tzou

As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least $2k+1$ admits a homomorphism to $PC_{2k}=(\mathbb{Z}_2^{2k}, \{e_1, e_2, ...,e_{2k}, J\})$ where $e_i$'s are standard basis and $J$ is…

组合数学 · 数学 2015-01-22 Reza Naserasr , Sagnik Sen , Qiang Sun

We present projective versions of the center point theorem and Tverberg's theorem, interpolating between the original and the so-called "dual" center point and Tverberg theorems. Furthermore we give a common generalization of these and many…

代数拓扑 · 数学 2014-09-23 Roman Karasev , Benjamin Matschke

We prove a criterion for continuity of bilinear maps on countable direct sums of topological vector spaces. As a first application, we get a new proof for the fact (due to Hirai et al. 2001) that the map taking a pair of test functions on…

泛函分析 · 数学 2011-12-22 Helge Glockner

We prove that every 4-polytope is determined by its edge-polygon incidences, solving an open problem of Gr\"unbaum. For each $d \geq 3$, we show that not every $d$-polytope is determined by its $(d-3)$-skeleton and dual $(d-3)$-skeleton…

组合数学 · 数学 2025-05-21 Joshua Hinman

Suppose $d+1$ absolutely continuous probability measures $m_0, \ldots, m_d$ on $\mathbb{R}^d$ are given. In this paper, we prove that there exists a point of $\mathbb{R}^d$ that belongs to the convex hull of $d+1$ points $v_0, \ldots, v_d$…

组合数学 · 数学 2020-06-03 Zilin Jiang

A multiobjective optimization problem is simplicial if the Pareto set and front are homeomorphic to a simplex and, under the homeomorphisms, each face of the simplex corresponds to the Pareto set and front of a subproblem. In this paper, we…

最优化与控制 · 数学 2019-06-28 Naoki Hamada , Kenta Hayano , Shunsuke Ichiki , Yutaro Kabata , Hiroshi Teramoto

Ryser's conjecture says that for every $r$-partite hypergraph $H$ with matching number $\nu(H)$, the vertex cover number is at most $(r-1)\nu(H)$. This far reaching generalization of K\"onig's theorem is only known to be true for $r\leq 3$,…

组合数学 · 数学 2021-11-05 Louis DeBiasio , Yigal Kamel , Grace McCourt , Hannah Sheats

Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…

广义相对论与量子宇宙学 · 物理学 2007-05-23 James R. van Meter

We prove a transversality "lifting property" for compactified configuration spaces as an application of the multijet transversality theorem: the submanifold of configurations of points on an arbitrary submanifold of Euclidean space may be…

几何拓扑 · 数学 2021-04-01 Jason Cantarella , Elizabeth Denne , John McCleary

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…

量子代数 · 数学 2014-10-01 Adam S. Sikora , Bruce W. Westbury