English
Related papers

Related papers: Computational Complexity of Enumerative 3-Manifold…

200 papers

We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…

Computational Complexity · Computer Science 2011-06-17 Peter Buergisser , Felipe Cucker

Motivated by physical constructions of homological knot invariants, we study their analogs for closed 3-manifolds. We show that fivebrane compactifications provide a universal description of various old and new homological invariants of…

High Energy Physics - Theory · Physics 2017-08-02 Sergei Gukov , Pavel Putrov , Cumrun Vafa

We consider groups G which have a cocompact, 3-manifold model for the classifying space \underline{E}G. We provide an algorithm for computing the rationalized equivariant K-homology of \underline{E}G. Under the additional hypothesis that…

K-Theory and Homology · Mathematics 2013-04-30 Jean-François Lafont , Ivonne J. Ortiz , Rubén J. Sánchez-García

Given a connected 2-complex X with fundamental group G, we show how pi_3(X) may be computed as a module over Z[G]. Further we show that if X is a finite connected 2-complex with G (the fundamental group) finite of odd order, then the stable…

Algebraic Topology · Mathematics 2023-08-25 Wajid Mannan

A graph $G$ contains a graph $H$ as a pivot-minor if $H$ can be obtained from $G$ by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. Pivot-minors have mainly been…

We present a method for computing the number of epimorphisms from a finitely-presented group G to a finite solvable group \Gamma, which generalizes a formula of G\"aschutz. Key to this approach are the degree 1 and 2 cohomology groups of G,…

Group Theory · Mathematics 2007-05-23 Daniel Matei , Alexander I. Suciu

We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…

Discrete Mathematics · Computer Science 2025-10-09 Jan Bok , Jiří Fiala , Petr Hliněný , Nikola Jedličková , Jan Kratochvíl

There is a strong analogy between compact, torsion-free $G_2$-manifolds $(X,\varphi,*\varphi)$ and Calabi-Yau 3-folds $(Y,J,g,\omega)$. We can also generalize $(X,\varphi,*\varphi)$ to 'tamed almost $G_2$-manifolds' $(X,\varphi,\psi)$,…

Differential Geometry · Mathematics 2018-07-26 Dominic Joyce

We present the notion of hom-complexity, $\text{C}(G;H)$, for two graphs $G$ and $H$, along with basic results for this numerical invariant. This invariant $\text{C}(G;H)$ is a number that measures the \aspas{complexity} of the question:…

In the paper we introduce the construction of invariants for 3-manifolds, based on the same key concepts as the classical Dijkgraaf-Witten invariant. We introduce the notion of a special $G$-system and describe how each system induces the…

Geometric Topology · Mathematics 2023-10-03 Philipp Korablev

Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…

Computational Complexity · Computer Science 2026-04-28 Manuel Bodirsky

In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…

Algebraic Topology · Mathematics 2013-03-06 Ana Romero , Julio Rubio

For every finitely generated abelian group G, we construct an irreducible open 3-manifold $M_{G}$ whose end set is homeomorphic to a Cantor set and with end homogeneity group of $M_{G}$ isomorphic to G. The end homogeneity group is the…

Geometric Topology · Mathematics 2014-11-14 Dennis J. Garity , Dušan Repovš

Under some suitable assumptions Riemannian manifolds $(M, g, H)$ that admit a connection $\hat\nabla$ with torsion a 3-form $H$, which is both closed $d H=0$ and $\hat\nabla$-covariantly constant, are locally isometric to a product $N\times…

Differential Geometry · Mathematics 2026-05-18 Georgios Papadopoulos

Let $X$ be an algebraic scheme over an algebraically closed field and $\ell$ a prime number invertible on $X$. According to classical results (due essentially to A. Grothendieck, M. Artin and P. Deligne), the \'etale cohomology groups…

Algebraic Geometry · Mathematics 2016-01-20 David A. Madore , Fabrice Orgogozo

Let $(M,\mathcal{N})$ be a marked 3-manifold. We use $S_n(M,\mathcal{N},v)$ to denote the stated $SL_n$-skein module of $(M,\mathcal{N})$ where $v$ is a nonzero complex number. We establish a surjective algebra homomorphism from…

Geometric Topology · Mathematics 2024-01-29 Zhihao Wang

In this paper we will show the following result: Let $\mathcal{N} $ be a complete (noncompact) connected orientable Riemannian three-manifold with nonnegative scalar curvature $S \geq 0$ and bounded sectional curvature $ K_{s} \leq K $.…

Differential Geometry · Mathematics 2017-03-28 Jose M. Espinar

This paper concerns rigidity of the mapping class groups. We show that any homomorphism $\phi:{\rm Mod}_g\to {\rm Mod}_h$ between mapping class groups of closed orientable surfaces with distinct genera $g>h$ is trivial if $g\geq 3$ and has…

Geometric Topology · Mathematics 2007-05-23 William Harvey , Mustafa Korkmaz

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

Representation Theory · Mathematics 2024-11-20 Rebecca Bourn , William Q. Erickson , Jeb F. Willenbring

Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…

Computational Complexity · Computer Science 2013-09-17 John Faben , Mark Jerrum
‹ Prev 1 3 4 5 6 7 10 Next ›