Related papers: Sequential parametrized topological complexity of …

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

We classify subalgebras of a ring of differential operators which are big in the sense that the extension of associated graded rings is finite. We show that these subalgebras correspond, up to automorphisms, to uniformly ramified finite…

Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…

Query evaluation over probabilistic databases is notoriously intractable -- not only in combined complexity, but often in data complexity as well. This motivates the study of approximation algorithms, and particularly of combined FPRASes,…

We establish upper bounds for the complexity of Seifert fibered manifolds with nonempty boundary. In particular, we obtain potentially sharp bounds on the complexity of torus knot complements.

We consider epimorphisms and several variant notions -- split, effective, regular, strong, and extremal -- and determine which of these coincide in the metric coarse and coarsely Lipschitz categories. In particular, we characterise extremal…

We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…

We generalise a theorem of Gersten on surjectivity of the restriction map in $\ell^{\infty}$-cohomology of groups. This leads to applications on subgroups of hyperbolic groups, quasi-isometric distinction of finitely generated groups and…

Pursuing a generalization of group symmetries of modular categories to category symmetries in topological phases of matter, we study linear Hopf monads. The main goal is a generalization of extension and gauging group symmetries to category…

We construct a new large family of finitely generated groups with continuum many values of the following monotone parameters: spectral radius, critical percolation, and asymptotic entropy. We also present several open problems on other…

We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bounded treewidth. Our randomized low depth algorithm has a…

We consider 2-dimensional random simplicial complexes $Y$ in the multi-parameter model. We establish the multi-parameter threshold for the property that every 2-dimensional simplicial complex $S$ admits a topological embedding into $Y$…

We establish a stable homotopy-theoretic version of a recent result of Farber and Weinberger on the fibrewise topological complexity of sphere bundles and prove, by closely parallel methods, a similar result for real, complex and…

We study the problem $\#\mathrm{EdgeSub}(\Phi)$ of counting $k$-edge subgraphs satisfying a given graph property $\Phi$ in a large host graph $G$. Building upon the breakthrough result of Curticapean, Dell and Marx (STOC 17), we express the…

For any abstract subfactor planar algebra $P$, there exists a finite index extremal subfactor $M_0 \subset M_1$ with $P$ as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and…

We consider elliptic partial differential equations with diffusion coefficients that depend affinely on countably many parameters. We study the summability properties of polynomial expansions of the function mapping parameter values to…

In this note we give explicit isomorphisms of 2-categories between various versions of the categorified quantum group associated to a simply-laced Kac-Moody algebra. These isomorphisms are convenient when working with the categorified…

We prove that finding a $k$-edge induced subgraph is fixed-parameter tractable, thereby answering an open problem of Leizhen Cai. Our algorithm is based on several combinatorial observations, Gauss' famous \emph{Eureka} theorem [Andrews,…

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…