English
Related papers

Related papers: Extendability of continuous maps is undecidable

200 papers

The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least…

Combinatorics · Mathematics 2016-01-26 Petr A. Golovach , Marcin Kamiński , Spyridon Maniatis , Dimitrios M. Thilikos

The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…

Operator Algebras · Mathematics 2016-02-22 Martín Argerami , Samuel Coskey , Mehrdad Kalantar , Matthew Kennedy , Martino Lupini , Marcin Sabok

We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…

Logic in Computer Science · Computer Science 2009-08-04 Olivier Finkel

Extended formulations are an important tool to obtain small (even compact) formulations of polytopes by representing them as projections of higher dimensional ones. It is an important question whether a polytope admits a small extended…

Computational Complexity · Computer Science 2012-06-28 Gábor Braun , Sebastian Pokutta

We consider a bi-criteria generalization of the pathwidth problem, where, for given integers $k,l$ and a graph $G$, we ask whether there exists a path decomposition $\cP$ of $G$ such that the width of $\cP$ is at most $k$ and the number of…

Data Structures and Algorithms · Computer Science 2021-03-05 Dariusz Dereniowski , Wieslaw Kubiak , Yori Zwols

In this paper we study the problems of the following kind: For a pair of topological spaces $X$ and $Y$ find sufficient conditions that under every continuous map $f : X\to Y$ a pair of sufficiently distant points is mapped to a single…

Metric Geometry · Mathematics 2025-01-22 Arseniy Akopyan , Roman Karasev , Alexey Volovikov

For a compact space X we consider extending endomorphisms of the algebra C(X) to be endomorphisms of Arens-Hoffman and Cole extensions of C(X). Given a non-linear, monic polynomial p in C(X)[t], with C(X)[t]/pC(X)[t] semi-simple, we show…

Functional Analysis · Mathematics 2007-05-23 J. F. Feinstein , T. J. Oliver

We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…

Artificial Intelligence · Computer Science 2015-03-19 Wolfgang Dvořák

Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…

Functional Analysis · Mathematics 2015-05-14 Sylvain Golenia

It is a long-standing problem in Hodge theory to generalize the Satake--Baily--Borel (SBB) compactification of a locally Hermitian symmetric space to arbitrary period maps. A proper topological SBB-type completion has been constructed, and…

Algebraic Geometry · Mathematics 2026-04-24 Colleen Robles

The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…

Combinatorics · Mathematics 2021-10-18 Tristram Bogart , João Gouveia , Juan Camilo Torres

In this paper, we study pointed rank one Hopf algebras and Hopf-Ore extensions of group algebras, over an arbitrary field $k$. It is proved that the rank of a Hopf-Ore extension of a group algebra is one or two or infinite. It is also shown…

Rings and Algebras · Mathematics 2015-03-18 Zhen Wang , Lan You , Hui-Xiang Chen

A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…

Discrete Mathematics · Computer Science 2015-03-20 Martin Milanič , Romeo Rizzi , Alexandru I. Tomescu

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

Number Theory · Mathematics 2025-10-20 J. Maurice Rojas

We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…

Rings and Algebras · Mathematics 2022-10-26 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

We consider classes of fundamental groups of complements of various kinds of codimension 2 embeddings and show that, in general, the problem of deciding whether or not a group in one class belongs to a smaller class is algorithmically…

Group Theory · Mathematics 2009-08-28 F. Gonzalez-Acuna , C. McA. Gordon , J. Simon

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…

Computational Complexity · Computer Science 2015-05-19 Jin-Yi Cai , Xi Chen , Richard Lipton , Pinyan Lu

Let $X$ be a finite CW complex and let $h_1, h_2: C(X)\to A$ be two unital \hm s, where $A$ is a unital C*-algebra. We study the problem when $h_1$ and $h_2$ are approximately homotopic. We present a $K$-theoretical necessary and sufficient…

Operator Algebras · Mathematics 2008-01-28 Huaxin Lin

Consider a Hausdorff space (X,T) and a set C of converging nets in X. By virtue of the limit uniqueness, the relation Lim which assigns each member x of X to every net N lying in C that converges to x is a map. Of course, structuring C with…

General Topology · Mathematics 2007-05-23 J. E. Palomar Tarancon

An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear…

Combinatorics · Mathematics 2012-07-10 Samuel Fiorini , Volker Kaibel , Kanstantsin Pashkovich , Dirk Oliver Theis
‹ Prev 1 8 9 10 Next ›