Related papers: A new algorithm for 3-sphere recognition

In this paper we answer the question posed by M.~Atiyah and give an explicit formula for Floer homology of Brieskorn homology spheres in terms of their branching sets over the 3--sphere. We further show how Floer homology is related to…

In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…

We prove that the quantum SO(3)-invariant of an arbitrary 3-manifold $M$ is always an algebraic integer, if the order of the quantum parameter is co-prime with the order of the torsion part of $H_1(M,\BZ)$. An even stronger integrality,…

By results of Morita, Pitsch and, more recently, Faes, it is known that any integral homology 3-sphere can be constructed as a Heegaard splitting with a gluing map an element of the fourth Johnson subgroup. In this work we prove that the…

In this paper, we compute the entire cyclic cohomology of noncommutative 3-spheres. First of all, we verify the Mayer-Vietoris exact sequence of entire cyclic cohomology in the framework of Fr\'echet $^*$-algebras. Applying it to their…

Given a knot K and an irreducible metabelian SL(n,C) representation we establish an equality for the dimension of the first twisted cohomology. In the case of equality, we prove that the representation must have finite image and that it is…

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…

We derive atomic decompositions and frames for weighted Bergman spaces of several complex variables on the unit ball in the spirit of Coifman, Rochberg, and Luecking. In contrast to our predecessors, we use group theoretic methods, in…

A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…

We prove that there are homology three-spheres that bound definite four-manifolds, but any such bounding four-manifold must be built out of many handles. The argument uses the homology cobordism invariant $\Gamma$ from instanton Floer…

We provide two new proofs of a theorem of Cooper, Long and Reid which asserts that, apart from an explicit finite list of exceptional manifolds, any compact orientable irreducible 3-manifold with non-empty boundary has large fundamental…

We give a complete classification of the spherical 3-manifolds that bound smooth rational homology 4-balls. Furthermore, we determine the order of spherical 3-manifolds in the rational homology cobordism group of rational homology…

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

We prove universality theorems ("Murphy's Laws") for representation schemes of fundamental groups of closed 3-dimensional manifolds. We show that germs of SL(2,C)-representation schemes of such groups are essentially the same as germs of…

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

This paper is the first part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…