中文
相关论文

相关论文: A short proof for tc(K) = 4

200 篇论文

We present some results supporting the Iwase-Sakai conjecture about coincidence of the topological complexity $TC(X)$ and monoidal topological complexity $TC^M(X)$. Using these results we provide lower and upper bounds for the topological…

几何拓扑 · 数学 2012-08-14 Alexander Dranishnikov

Let $X^4$ and $Y^4$ be smooth manifolds and $f: X\to Y$ a branched cover with branching set $B$. Classically, if $B$ is smoothly embedded in $Y$, the signature $\sigma(X)$ can be computed from data about $Y$, $B$ and the local degrees of…

几何拓扑 · 数学 2020-09-01 Christian Geske , Alexandra Kjuchukova , Julius L. Shaneson

It is well-known (cf. K.-Pudl\'ak 1989) that a polynomial time algorithm finding tautologies hard for a propositional proof system $P$ exists iff $P$ is not optimal. Such an algorithm takes $1^{(k)}$ and outputs a tautology $\tau_k$ of size…

逻辑 · 数学 2016-04-26 Jan Krajicek

We present a complex frame of eleven vectors in 4-space and prove that it defines injective measurements. That is, any rank-one $4\times 4$ Hermitian matrix is uniquely determined by its values as a Hermitian form on this collection of…

泛函分析 · 数学 2015-02-17 Cynthia Vinzant

Cook's theorem is commonly expressed such as any polynomial time-verifiable problem can be reduced to the SAT problem. The proof of Cook's theorem consists in constructing a propositional formula A(w) to simulate a computation of TM, and…

计算复杂性 · 计算机科学 2019-05-01 Yu Li

Circular and non-wellfounded proofs have become an increasingly popular tool for metalogical treatments of systems with forms of induction and/or recursion. In this work we investigate the expressivity of a variant CT of G\"odel's system T…

计算机科学中的逻辑 · 计算机科学 2021-01-19 Anupam Das

In this article we study the higher topological complexity ${\sf TC}_r(X)$ in the case when $X$ is an aspherical space, $X=K(\pi, 1)$ and $r\ge 2$. We give a characterisation of ${\sf TC}_r(K(\pi, 1))$ in terms of classifying spaces for…

代数拓扑 · 数学 2019-03-01 Michael Farber , John Oprea

We note that, for any natural $k$ and every natural $l$ between $k$ and $2k$, there exists a group $\pi$ with $\cat K(\pi,1)=k$ and $\TC(K(\pi,1))=l$. Because of this, we can set up a problem of searching of purely group-theoretical…

代数拓扑 · 数学 2014-08-05 Yuli Rudyak

We study quaternionic Bott-Chern cohomology on compact hypercomplex manifolds and adapt some results from complex geometry to the quaternionic setting. For instance, we prove a criterion for the existence of HKT metrics on compact…

微分几何 · 数学 2016-12-14 Mehdi Lejmi , Patrick Weber

We investigate the $\mathcal F$-Borel complexity of topological spaces in their different compactifcations. We provide a simple proof of the fact that a space can have arbitrarily many different complexities in different compactifications.…

一般拓扑 · 数学 2018-04-24 Vojtěch Kovařík

A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.

符号计算 · 计算机科学 2018-11-08 Dima Grigoriev

The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…

代数拓扑 · 数学 2007-07-07 Michael Farber , Mark Grant

In the lattice CP(N) models we studied the problems related to the measure of the topological susceptibility and the string tension . We perfomed numerical simulations at N=4 and N=10. In order to test the universality, we adopted two…

高能物理 - 格点 · 物理学 2016-08-31 M. Campostrini , P. Rossi , E. Vicari

Suppose that there's no transitive model of ZFC + there's a strong cardinal, and let K denote the core model. It is shown that if \delta has the tree property then \delta^{+K} = \delta^+ and \delta is weakly compact in K.

逻辑 · 数学 2016-09-07 Ralf Schindler

We use the famous knot-theoretic consequence of Freedman's disc theorem---knots with trivial Alexander polynomial bound a locally-flat disc in the 4-ball---to prove the following generalization. The degree of the Alexander polynomial of a…

几何拓扑 · 数学 2017-10-13 Peter Feller

Given a strictly unbounded toric symplectic 4-manifold, we explicitly construct complete toric scalar-flat K\"ahler metrics on the complement of a toric divisor. These symplectic 4-manifolds correspond to a specific class of non-compact…

微分几何 · 数学 2024-11-05 Yueqing Feng

We prove an upper bound of higher topological complexity $TC_n(X)$ using higher $\mathcal{D}$-topological complexity $TC_n^{\mathcal{D}}(X)$ of a space $X$. An intermediate invariant $\widetilde{TC}_n(X)$ is used in the proof. We interpret…

代数拓扑 · 数学 2019-12-13 Amit Kumar Paul , Debasis Sen

We study smooth projective varieties with small dual variety using methods from symplectic topology. We prove the affine parts of such varieties are subcritical, and that the hyperplane class is invertible in their quantum cohomology. We…

代数几何 · 数学 2012-06-29 Paul Biran , Yochay Jerby

The lattice definition of a two-dimensional topological field theory (TFT) is given generically, and the exact solution is obtained explicitly. In particular, the set of all lattice topological field theories is shown to be in one-to-one…

高能物理 - 理论 · 物理学 2009-10-22 M. Fukuma , S. Hosono , H. Kawai

In this paper, we introduce the n-th discrete topological complexity and study its properties such as its relation with simplicial Lusternik-Schnirelmann category and how the higher dimensions of discrete topological complexity relate with…

代数拓扑 · 数学 2024-04-17 Hilal Alabay , Ayse Borat , Esra Cihangirli , Esma Dirican Erdal