Related papers: Parametrized Complexity of Expansion Height

Much of the homotopical and homological structure of the categories of chain complexes and topological spaces can be deduced from the existence and properties of the 'simple' functors Tot : {double chain complexes} -> {chain complexes} and…

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable if the model-complete core of the template…

The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…

Many of the properties of sectional category, topological complexity and homotopic distance are in fact derived from a small number of basic properties, which, once established, lead to all the others without further recourse to topology.…

We study surface representatives of homology classes of finite complexes which minimize certain complexity measures, including its genus and Euler characteristic. Our main result is that up to surgery at nullhomotopic curves minimizers are…

For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

In this paper we introduce the notion of a $d$-dimensional cycle which is a homological generalization of the idea of a graph cycle to higher dimensions. We examine both the combinatorial and homological properties of this structure and use…

We show that in every dimension greater than or equal to 4, there exist compact Kaehler manifolds which do not have the homotopy type of projective complex manifolds. Thus they a fortiori are not deformation equivalent to a projective…

Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…

It is well known that the exceptional set in a resolution of a rational surface singularity is a tree of rational curves. We generalize the combinatoric part of this statement to higher dimensions and show that the highest cohomologies of…

In this work, we show that, for any simply-connected elliptic space $S$ admitting a pure minimal Sullivan model with a differential of constant length, we have ${\rm TC}_0(S)\leq 2{\rm cat}_0(S)+\chi_{\pi}(S)$ where $\chi_{\pi}(S)$ is the…

This paper combines two classical theories, namely metric projective differential geometry and superintegrability. We study superintegrable systems on 2-dimensional geometries that share the same geodesics, viewed as unparametrized curves.…

We introduce the concept of homotopy equivalence for Hopf Galois extensions and make a systematic study of it. As an application we determine all H-Galois extensions up to homotopy equivalence in the case when H is a Drinfeld-Jimbo quantum…

We introduce the notion of \emph{topo-symmetric extensions} of topological groups, a new generalization of classical group extensions that incorporates both topological and symmetry constraints. We define morphisms between such extensions,…

Fix a finite set of points in Euclidean $n$-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an…

Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit…

It was shown in Alur et al. [1] that the problem of verifying finite concurrent systems through Linearizability is in EXPSPACE. However, there was still a complexity gap between the easy to obtain PSPACE lower bound and the EXPSPACE upper…

We construct a simplicial complex, the rectangle complex of a relation R, and show that it is homotopy equivalent to the Dowker complex of R. This results in a short and conceptual proof of functorial versions of Dowker's Theorem used in…

In this paper, we introduce the notion of augmentation for polytopes and use it to show the error in two presumptions that have been key in arriving at over-reaching/over-scoped claims of "impossibility" in recent extended formulations (EF)…