Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes

We present polynomial families complete for the well-studied algebraic complexity classes VF, VBP, VP, and VNP. The polynomial families are based on the homomorphism polynomials studied in the recent works of Durand et al. (2014) and Mahajan et al. (2018). We consider three different variants of graph homomorphisms, namely injective homomorphisms , directed homomorphisms , and injective directed homomorphisms , and obtain polynomial families complete for VF, VBP, VP, and VNP under each one of these. The polynomial families have the following properties: • The polynomial families complete for VF, VBP, and VP are model independent, i.e., they do not use a particular instance of a formula, algebraic branching programs, or circuit for characterising VF, VBP, or VP, respectively. • All the polynomial families are hard under p -projections.

Parameterized Counting of Partially Injective Homomorphisms

We study the parameterized complexity of the problem of counting graph homomorphisms with given partial injectivity constraints, i.e., inequalities between pairs of vertices, which subsumes counting of graph homomorphisms, subgraph counting and, more generally, counting of answers to equi-join queries with inequalities. Our main result presents an exhaustive complexity classification for the problem in fixed-parameter tractable and $$\#\mathsf {W[1]}$$ # W [ 1 ] -complete cases. The proof relies on the framework of linear combinations of homomorphisms as independently discovered by Chen and Mengel (PODS 16) and by Curticapean, Dell and Marx in the recent breakthrough result regarding the exact complexity of the subgraph counting problem (STOC 17). Moreover, we invoke Rota’s NBC-Theorem to obtain an explicit criterion for fixed-parameter tractability based on treewidth. The abstract classification theorem is then applied to the problem of counting locally injective graph homomorphisms from small pattern graphs to large target graphs. As a consequence, we are able to fully classify its parameterized complexity depending on the class of allowed pattern graphs.

Groupoid Fell bundles for product systems over quasi-lattice ordered groups

Consider a product system over the positive cone of a quasi-lattice ordered group. We construct a Fell bundle over an associated groupoid so that the cross-sectional algebra of the bundle is isomorphic to the Nica–Toeplitz algebra of the product system. Under the additional hypothesis that the left actions in the product system are implemented by injective homomorphisms, we show that the cross-sectional algebra of the restriction of the bundle to a natural boundary subgroupoid coincides with the Cuntz–Nica–Pimsner algebra of the product system. We apply these results to improve on existing sufficient conditions for nuclearity of the Nica–Toeplitz algebra and the Cuntz–Nica–Pimsner algebra, and for the Cuntz–Nica–Pimsner algebra to coincide with its co-universal quotient.

Bi-invariant metrics and quasi-morphisms on groups of Hamiltonian diffeomorphisms of surfaces

Let Σg be a closed orientable surface of genus g and let Diff 0(Σg, area ) be the identity component of the group of area-preserving diffeomorphisms of Σg. In this paper, we present the extension of Gambaudo–Ghys construction to the case of a closed hyperbolic surface Σg, i.e. we show that every nontrivial homogeneous quasi-morphism on the braid group on n strings of Σg defines a nontrivial homogeneous quasi-morphism on the group Diff 0(Σg, area ). As a consequence we give another proof of the fact that the space of homogeneous quasi-morphisms on Diff 0(Σg, area ) is infinite-dimensional. Let Ham (Σg) be the group of Hamiltonian diffeomorphisms of Σg. As an application of the above construction we construct two injective homomorphisms Zm → Ham (Σg), which are bi-Lipschitz with respect to the word metric on Zm and the autonomous and fragmentation metrics on Ham (Σg). In addition, we construct a new infinite family of Calabi quasi-morphisms on Ham (Σg).