166 research outputs found
The Andrews-Curtis Conjecture, Term Rewriting and First-Order Proofs
The Andrews-Curtis conjecture (ACC) remains one of the outstanding open problems in combinatorial group theory. In short, it states that every balanced presentation of the trivial group can be transformed into a trivial presentation by a sequence of simple transformations. It is generally believed that the conjecture may be false and there are several series of potential counterexamples for which required simplifications are not known. Finding simplifications poses a challenge for any computational approach - the search space is unbounded and the lower bound on the length of simplification sequences is known to be at least superexponential. Various specialised search algorithms have been used to eliminate some of the potential counterexamples. In this paper we present an alternative approach based on automated reasoning. We formulate a term rewriting system ACT for AC-transformations, and its translation(s) into the first-order logic. The problem of finding AC-simplifications is reduced to the problem of proving first-order formulae, which is then tackled by the available automated theorem provers. We report on the experiments demonstrating the efficiency of the proposed method by finding required simplifications for several new open cases
Computational Group Theory
This was the seventh workshop on Computational Group Theory. It showed that Computational Group Theory has significantly expanded its range of activities. For example, symbolic computations with groups and their representations and computations with infinite groups play a major role nowadays. The talks also presented connections and applications to cryptography, number theory and the algorithmic theory of algebras
Finite covers of random 3-manifolds
A 3-manifold is Haken if it contains a topologically essential surface. The
Virtual Haken Conjecture posits that every irreducible 3-manifold with infinite
fundamental group has a finite cover which is Haken. In this paper, we study
random 3-manifolds and their finite covers in an attempt to shed light on this
difficult question. In particular, we consider random Heegaard splittings by
gluing two handlebodies by the result of a random walk in the mapping class
group of a surface. For this model of random 3-manifold, we are able to compute
the probabilities that the resulting manifolds have finite covers of particular
kinds. Our results contrast with the analogous probabilities for groups coming
from random balanced presentations, giving quantitative theorems to the effect
that 3-manifold groups have many more finite quotients than random groups. The
next natural question is whether these covers have positive betti number. For
abelian covers of a fixed type over 3-manifolds of Heegaard genus 2, we show
that the probability of positive betti number is 0.
In fact, many of these questions boil down to questions about the mapping
class group. We are lead to consider the action of mapping class group of a
surface S on the set of quotients pi_1(S) -> Q. If Q is a simple group, we show
that if the genus of S is large, then this action is very mixing. In
particular, the action factors through the alternating group of each orbit.
This is analogous to Goldman's theorem that the action of the mapping class
group on the SU(2) character variety is ergodic.Comment: 60 pages; v2: minor changes. v3: minor changes; final versio
This Week's Finds in Mathematical Physics (1-50)
These are the first 50 issues of This Week's Finds of Mathematical Physics,
from January 19, 1993 to March 12, 1995. These issues focus on quantum gravity,
topological quantum field theory, knot theory, and applications of
-categories to these subjects. However, there are also digressions into Lie
algebras, elliptic curves, linear logic and other subjects. They were typeset
in 2020 by Tim Hosgood. If you see typos or other problems please report them.
(I already know the cover page looks weird).Comment: 242 page
Computer Aided Verification
The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency
Computer Aided Verification
The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency
- …