Eine aufbereitete Darstellung der Quelle

 
     
 
 
Anforderungen  |   Konzepte  |   Entwurf  |   Entwicklung  |   Qualitätssicherung  |   Lebenszyklus  |   Steuerung
 
 
 
 

Benutzer

Quelle  chap1_mj.html

  Sprache: HTML
 

 products/Sources/formale Sprachen/GAP/pkg/lpres/doc/chap1_mj.html


<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<script type="text/javascript"
  src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
<title>GAP (lpres) - Chapter 1: The lpres package</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chap1"  onload="jscontent()">


<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a>  <a href="chap1_mj.html">1</a>  <a href="chap2_mj.html">2</a>  <a href="chap3_mj.html">3</a>  <a href="chap4_mj.html">4</a>  <a href="chap5_mj.html">5</a>  <a href="chap6_mj.html">6</a>  <a href="chapBib_mj.html">Bib</a>  <a href="chapInd_mj.html">Ind</a>  </div>

<div class="java.lang.StringIndexOutOfBoundsException: Range [41, 29) out of bounds for length 263

<p id="mathjaxlink" class="pcenter"><a href="chap1.html">[MathJax off]</a></p>
<p><a id="X86B8787287B59CA4" name="X86B8787287B59CA4"></a></p>
<div class"ChapSects">< href=chap1_mj.#X86B8787287B59CA4>1 <pan class="eading">The <strongclass="pkg"<strong>package</pan</a>
<div class=ContSect">span class="ocline"><span class="nocss"> </span><a href="chap1_mj.html#X7DFB63A97E67C0A1">1.1 <span class="Heading">Introduction</span></a>
</span
</div>
</div>

<h3>1 <span class="Heading">The<cript ="manual.js" type=text/"></script>

<p>This package was </ead

< id="7DFB63A97E67C0A1" name="X7DFB63A97E67C0A1"></a></p>

<h4>1.1 <span class="Heading">java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 0

<p>In 1980, Grigorchuk <a href="chapBib_mj.html#biBGrigorchuk80">[Gri80]</a> gave an example of an infinite, finitely generated torsion group whichjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

<p>The Grigorchuk group is not finitely presentable (see <a href="chapBib_mj.html#biBGrigorchuk99">java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

<p class="center">\[\langle a,b,c,d\mid a^2,b^2,c^2,d^2,bcd,[d,d^a]^{\sigma^n},[d,d^{acaca}]^{\sigma^n}, (n\inℕp>aid"B8787287B59CA4"name="86B8787287B59CA4"></a></p>

<p>where <span class="SimpleMath">\(\sigma\)</span> is the <div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap1_mj.html#X7DFB63A97E67C0A1">1.1 <span class="Heading">Introduction</span>/span>

<p>In 2003, Bartholdi <a href="chapBib_mj.html#biBBartholdi03">[Bar03]</a> introduced the notion of an <em>L-presentation</em> for presentations of this type; that is, a group presentation of the form</p>

<p class="center">\[G=\left\langle S \left|  Q\cup \bigcup_{\varphi\in\Phi^*} R^\varphi\right.\right\rangle,\]</p>

<p>where <span class="SimpleMath">\(\Phi^*\)</span> denotes the free monoid generated by a set of free group endomorphisms

<p>The <strong class="pkg">lpres</

<p>Our nilpotent quotient algorithm generalizes Nickel's algorithm for finitely presented groups (see <a href="chapBib_mj.html#biBNickel96">[Nic96]</java.lang.StringIndexOutOfBoundsException: Range [0, 150) out of bounds for length 0

<p>Since finite L-presentations generalize finite presentations, our algorithm also

<p>A detailed description of our algorithm can be found in <a href="chapBib_mj.html#biBBEH08">[BEH08]</a> or in the diploma thesis <a href="chapBib_mj.html#biBH08java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

<p>The <strong class="pkg">lpres</strong>-package also includes the Reidemeister-Schreier algorithm from <a href="chapBib_mj.html#biBMR2876891">[Har12]</a>. L-presented groups were introduced as a tool to understand self-similar groups 

<p>Finally, we note that we use the term "algorithm" somewhat loosely: many of the algorithms in this package arejava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0


<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a>   <a href="chap0_mj.html#contents">[Contents]</a>    <a href="chap0_mj.


<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a>  <a href="chap1_mj.html">1</a>  <a href="chap2_mj.html">2</a>  <a href="chap3_mj.html">

<hr />
<p class="foot">generated by <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>

Messung V0.5 in Prozent
C=100 H=100 G=100

¤ Dauer der Verarbeitung: 0.5 Sekunden  ¤

*© Formatika GbR, Deutschland






Wurzel

Suchen

PVS Prover

Isabelle Prover

NIST Cobol Testsuite

Cephes Mathematical Library

Vienna Development Method

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.






                                                                                                                                                                                                                                                                                                                                                                                                     


Neuigkeiten

     Aktuelles
     Motto des Tages

Open Source Software

     Quellcodebibliothek
     Eigene Quellcodes
     Fremde Quellcodes
     Suchen

Jenseits des Üblichen ....

Besucherstatistik

Besucherstatistik

Statistik
#Sources=1019547
#Domains=890699