<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>

<channel>
	<title>The Infinite Seminar</title>
	<atom:link href="http://infinity.blogseminar.net/feed/" rel="self" type="application/rss+xml" />
	<link>http://infinity.blogseminar.net</link>
	<description>Blogging ... up to homotopy.</description>
	<pubDate>Fri, 25 Jul 2008 17:16:46 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5</generator>
	<language>en</language>
			<item>
		<title>Blackbox computation on the arXiv</title>
		<link>http://infinity.blogseminar.net/2008/07/25/blackbox-computation-on-the-arxiv/</link>
		<comments>http://infinity.blogseminar.net/2008/07/25/blackbox-computation-on-the-arxiv/#comments</comments>
		<pubDate>Fri, 25 Jul 2008 17:16:46 +0000</pubDate>
		<dc:creator>Mikael Vejdemo Johansson</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/?p=17</guid>
		<description><![CDATA[My paper on blackbox computation of A-infinity algebra structures, submitted to the Kadeishvili Festschrift issue of the Georgian Mathematics Journal, is now on the arXiv.
]]></description>
			<content:encoded><![CDATA[<p>My paper on blackbox computation of A-infinity algebra structures, submitted to the Kadeishvili Festschrift issue of the Georgian Mathematics Journal, is now on the <a title="Blackbox computation of A-infinity algebras" href="http://arxiv.org/abs/0807.3869">arXiv</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2008/07/25/blackbox-computation-on-the-arxiv/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Computation of A-infinity algebra structures in group cohomology</title>
		<link>http://infinity.blogseminar.net/2008/07/17/computation-of-a-infinity-algebra-structures-in-group-cohomology/</link>
		<comments>http://infinity.blogseminar.net/2008/07/17/computation-of-a-infinity-algebra-structures-in-group-cohomology/#comments</comments>
		<pubDate>Thu, 17 Jul 2008 13:47:05 +0000</pubDate>
		<dc:creator>Mikael Vejdemo Johansson</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/?p=16</guid>
		<description><![CDATA[Since the thesis is now defended, and the degree provisionally granted, I present to you my doctoral thesis.
]]></description>
			<content:encoded><![CDATA[<p>Since the thesis is now defended, and the degree provisionally granted, I present to you my <a title="Computation of A-infinity algebra structures in group cohomology - Mikael Vejdemo Johansson, doctoral dissertation" href="http://www.minet.uni-jena.de/~mik/thesis.pdf">doctoral thesis</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2008/07/17/computation-of-a-infinity-algebra-structures-in-group-cohomology/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Lyubashenko-Manzyuk on the arXiv - some additional thoughts</title>
		<link>http://infinity.blogseminar.net/2008/02/21/lyubashenko-manzyuk-on-the-arxiv-some-additional-thoughts/</link>
		<comments>http://infinity.blogseminar.net/2008/02/21/lyubashenko-manzyuk-on-the-arxiv-some-additional-thoughts/#comments</comments>
		<pubDate>Thu, 21 Feb 2008 11:51:57 +0000</pubDate>
		<dc:creator>Mikael Vejdemo Johansson</dc:creator>
		
		<category><![CDATA[A-infinity]]></category>

		<category><![CDATA[Mathematics]]></category>

		<category><![CDATA[Preprints]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/2008/02/21/lyubashenko-manzyuk-on-the-arxiv-some-additional-thoughts/</guid>
		<description><![CDATA[In the arXiv mailing from today, February 2nd 2008, there was a large chunk of A &#8734;-related preprints from Lyubashenko and Manzyuk. Most of these preprints are getting published in journals, or in Max-Planck-Institute report series.
For reference, the arXiv posts I&#8217;ll be talking about here are:
http://arxiv.org/abs/0802.2885
http://arxiv.org/abs/math/0211037
http://arxiv.org/abs/math/0306018
http://arxiv.org/abs/math/0312339
http://arxiv.org/abs/math/0701165
In general sweeps - acquired from scanning the abstracts - [...]]]></description>
			<content:encoded><![CDATA[<p>In the arXiv mailing from today, February 2nd 2008, there was a large chunk of <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-related preprints from Lyubashenko and Manzyuk. Most of these preprints are getting published in journals, or in Max-Planck-Institute report series.</p>
<p>For reference, the arXiv posts I&#8217;ll be talking about here are:<br />
http://arxiv.org/abs/0802.2885<br />
http://arxiv.org/abs/math/0211037<br />
http://arxiv.org/abs/math/0306018<br />
http://arxiv.org/abs/math/0312339<br />
http://arxiv.org/abs/math/0701165</p>
<p>In general sweeps - acquired from scanning the abstracts - Lyubashenko and Manzyuk are talking about <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-categories as defined by Fukaya, and doing various basic constructions with them - demonstrating that various definitions of unitality coincide, showing a relation to Serre k-linear functors, constructing quotient categories with the same kind of structure et.c.</p>
<p>Now, one question that occurs to me quickly is the following:<br />
Could an <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-algebra be considered to be a one-object <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-category? And if this is so, can the quotient constructions Lyubashenko and Manzyuk are using be extended (possibly significantly) to form a transferral of <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-(co)algebra structure across surjections in general?</p>
<p>And the way off target question: Does this somehow give us a way to transfer <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-(co)algebra structures along things like the restriction map in group (co)homology?</p>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2008/02/21/lyubashenko-manzyuk-on-the-arxiv-some-additional-thoughts/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Blackbox computation of A-infinity structures</title>
		<link>http://infinity.blogseminar.net/2008/02/06/blackbox-computation-of-a-infinity-structures/</link>
		<comments>http://infinity.blogseminar.net/2008/02/06/blackbox-computation-of-a-infinity-structures/#comments</comments>
		<pubDate>Wed, 06 Feb 2008 15:48:05 +0000</pubDate>
		<dc:creator>Mikael Vejdemo Johansson</dc:creator>
		
		<category><![CDATA[A-infinity]]></category>

		<category><![CDATA[Group cohomology]]></category>

		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/2008/02/06/blackbox-computation-of-a-infinity-structures/</guid>
		<description><![CDATA[In my doctoral thesis (soon to be released to the general public), I spend some time discussing a blackbox technique for computing A-infinity structures on Ext algebras using Kadeishvili&#8217;s proof of the minimality theorem as an inspiration for an algorithmic approach.
Basically, we build up a quasi-isomorphism from H *A to A by only ever defining [...]]]></description>
			<content:encoded><![CDATA[<p>In my doctoral thesis (soon to be released to the general public), I spend some time discussing a blackbox technique for computing A-infinity structures on Ext algebras using Kadeishvili&#8217;s proof of the minimality theorem as an inspiration for an algorithmic approach.</p>
<p>Basically, we build up a quasi-isomorphism from <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msup><mi>H</mi> <mo>*</mo></msup><mi>A</mi></math> to <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>A</mi></math> by only ever defining the bits and pieces we really need to define, and figuring out what they should be by staring at the Stasheff morphism axioms and recursing down until everything we need to know is computed.</p>
<p>During my visit to Sydney last autumn, I implemented this as a module for the computer algebra system MAGMA. Now, as a part of my last minute thesis revisions, I have tracked down and fixed (hopefully all) bugs in the computation. Hence, beginning with release 2.14-10 of MAGMA, there will be an A-infinity computation module distributed with the system which at least computes the already known A-infinity structures on <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msup><mi>H</mi> <mo>*</mo></msup><mo stretchy="false">(</mo><msub><mi>C</mi> <mrow><msup><mi>p</mi> <mi>n</mi></msup></mrow></msub><mo>,</mo><mi>Z</mi><mo stretchy="false">/</mo><mi>p</mi><mo stretchy="false">)</mo></math> correctly. It can also be used for explorations in <em>p</em>-group cohomology.</p>
<p>Some examples (the examples are run in MAGMA 2.14-9, but with a development implementation of the A-infinity module):</p>
<pre>
&gt; G := CyclicGroup(3);
&gt; Aoo := AInfinityRecord(G,10);
&gt; S&lt;x,y&gt; := Aoo`S;
&gt; HighProduct(Aoo,[ x : i in [1..10]]);
0
&gt; { #k : k in Keys(Aoo`m) | not IsZero(HighProduct(Aoo,k)) };
{ 2, 3 }
&gt; { #k : k in Keys(Aoo`m) | not IsZero(HighMap(Aoo,k)) };
{ 2 }</pre>
<p>This example shows us that the only higher products and quasi-isomorphism components that do not vanish in <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msup><mi>H</mi> <mo>*</mo></msup><mo stretchy="false">(</mo><msub><mi>C</mi> <mn>3 </mn></msub><mo>,</mo><mi>Z</mi><mo stretchy="false">/</mo><mn>3 </mn><mo stretchy="false">)</mo></math> have arity 2 and 3. With some extra verification, we can use some of the latest arguments in my thesis to convince ourselves that the entire A-infinity structure on this cohomology ring follows from this particular computation.</p>
<pre>
&gt; G := DihedralGroup(4);
&gt; Aoo := AInfinityRecord(G,10);
&gt; S&lt;x,y,z&gt; := Aoo`S;
&gt; HighProduct(Aoo,[x,y,x,y]);
z
&gt; HighProduct(Aoo,[x,y,x,y^2]);
y*z
&gt; HighProduct(Aoo,[x,y,x,y^3]);
y^2*z
&gt; HighProduct(Aoo,[x,y,x,y^4]);
y^3*z</pre>
<p>These are essentially a small, but representative subset of the computations on the cohomology of the dihedral group with 8 elements that I presented in T&#8217;bilisi in 2006.</p>
<p>So - if you have a MAGMA installation, 2.14-x, and want to play with this before 2.14-10 is released, prod me and we&#8217;ll work something out.</p>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2008/02/06/blackbox-computation-of-a-infinity-structures/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Infinity preprints on the arXiv - November 28 - December 10 2007</title>
		<link>http://infinity.blogseminar.net/2007/12/10/infinity-preprints-on-the-arxiv-november-28-december-10-2007/</link>
		<comments>http://infinity.blogseminar.net/2007/12/10/infinity-preprints-on-the-arxiv-november-28-december-10-2007/#comments</comments>
		<pubDate>Mon, 10 Dec 2007 16:43:36 +0000</pubDate>
		<dc:creator>Mikael Vejdemo Johansson</dc:creator>
		
		<category><![CDATA[A-infinity]]></category>

		<category><![CDATA[Mathematics]]></category>

		<category><![CDATA[Preprints]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/2007/12/10/infinity-preprints-on-the-arxiv-november-28-december-10-2007/</guid>
		<description><![CDATA[arXiv:0711.4499
Steffen Sagave - DG-algebras and derived A-infinity algebras
In this paper, the theory of A &#8734;-algebras as  sketched in Kellers survey papers is developed to give bigraded (homological and &#8220;original&#8221;) resolutions of dg-algebras, and construct minimal models for dg-algebras using an extended notion of A &#8734;-algebras called derived A &#8734;-algebras. These take a bigraded structure [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://arxiv.org/abs/0711.4499" title="arXiv:0711.4499">arXiv:0711.4499</a><br />
Steffen Sagave - DG-algebras and derived A-infinity algebras</p>
<p>In this paper, the theory of <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-algebras as  sketched in Kellers survey papers is developed to give bigraded (homological and &#8220;original&#8221;) resolutions of dg-algebras, and construct minimal models for dg-algebras using an extended notion of <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-algebras called derived <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-algebras. These take a bigraded structure into account.</p>
<p>Sagave proves a derived analogue of the minimality theorem applicable for any dg-algebra over any commutative ring.</p>
<p><a href="http://arxiv.org/abs/0712.0996" title="arXiv:0712.0996"> arXiv:0712.0996</a></p>
<p>Valery A. Lunts: Formality of DG algebras (after Kaledin)</p>
<p>This paper, which states in the arXiv summary that it&#8217;s an early draft, and welcomes additional input, sets out to develop the background in order to prove a result stated in a paper by Dima Kaledin.  Kaledin picks out a special cohomology class in a Hochschild cohomology ring, which acts as an obstruction to formality of the algebra studied. The core results deals with how this obstruction is realized in the Kaledin class and how formality of <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-algebras gets inherited in various constructions.</p>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2007/12/10/infinity-preprints-on-the-arxiv-november-28-december-10-2007/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Associahedral diagonals</title>
		<link>http://infinity.blogseminar.net/2007/11/09/associahedral-diagonals/</link>
		<comments>http://infinity.blogseminar.net/2007/11/09/associahedral-diagonals/#comments</comments>
		<pubDate>Fri, 09 Nov 2007 13:38:59 +0000</pubDate>
		<dc:creator>Mikael Vejdemo Johansson</dc:creator>
		
		<category><![CDATA[A-infinity]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/2007/11/09/associahedral-diagonals/</guid>
		<description><![CDATA[There is a paper by Loday on the arXiv since about a month ago, entitled The diagonal of the Stasheff polytope. The basic idea of the paper is to introduce a new operad AA &#8734;, built on the simplicial chains of Lodays triangulation of the associahedron, and using the relative simplicity of forming diagonals on [...]]]></description>
			<content:encoded><![CDATA[<p>There is a <a href="http://arxiv.org/abs/0710.0572">paper by Loday</a> on the <a href="http://arxiv.org">arXiv</a> since about a month ago, entitled <i>The diagonal of the Stasheff polytope</i>. The basic idea of the paper is to introduce a new operad <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>AA</mi> <mn>&infin;</mn></msub></math>, built on the simplicial chains of Lodays triangulation of the associahedron, and using the relative simplicity of forming diagonals on simplicial complexes to generate a reasonably natural diagonal on this new operad.</p>
<p>With quasiisomorphisms from our familiar <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-operad to <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>AA</mi> <mn>&infin;</mn></msub></math> and back again, he then constructs a diagonal on <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>, formed by going to <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>AA</mi> <mn>&infin;</mn></msub></math> and computing a simplicial diagonal, which finally gets deformed into a diagonal on <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>.</p>
<p>Thus, this construction is based in a slightly different approach to diagonal computation than both the Saneblidze-Umble construction and the Markl-Schnider paper; but Loday conjectures equality between the two constructions based on a comparison of the results for the diagonal 5-ary operation.</p>
<p>If anyone out there has read more of the paper than I have (or if Loday himself is reading this sporadic blog), I would appreciate some nudges on how to internalize the deformation enough to fix it in computer code.</p>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2007/11/09/associahedral-diagonals/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Partial Report on AIM Workshop: Towards Relative Symplectic Field Theory</title>
		<link>http://infinity.blogseminar.net/2007/10/01/partial-report-on-aim-workshop-towards-relative-symplectic-field-theory/</link>
		<comments>http://infinity.blogseminar.net/2007/10/01/partial-report-on-aim-workshop-towards-relative-symplectic-field-theory/#comments</comments>
		<pubDate>Mon, 01 Oct 2007 01:35:19 +0000</pubDate>
		<dc:creator>Jim Stasheff</dc:creator>
		
		<category><![CDATA[A-infinity]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/2007/10/01/partial-report-on-aim-workshop-towards-relative-symplectic-field-theory/</guid>
		<description><![CDATA[towards-relative-symplectic-field-theory-report.pdf
]]></description>
			<content:encoded><![CDATA[<p><a href="http://infinity.blogseminar.net/wp-content/uploads/2007/10/towards-relative-symplectic-field-theory-report.pdf" title="towards-relative-symplectic-field-theory-report.pdf">towards-relative-symplectic-field-theory-report.pdf</a></p>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2007/10/01/partial-report-on-aim-workshop-towards-relative-symplectic-field-theory/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Computational projects</title>
		<link>http://infinity.blogseminar.net/2007/09/27/computational-projects/</link>
		<comments>http://infinity.blogseminar.net/2007/09/27/computational-projects/#comments</comments>
		<pubDate>Thu, 27 Sep 2007 03:09:41 +0000</pubDate>
		<dc:creator>Mikael Vejdemo Johansson</dc:creator>
		
		<category><![CDATA[A-infinity]]></category>

		<category><![CDATA[Computation]]></category>

		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/2007/09/27/computational-projects/</guid>
		<description><![CDATA[A sneak preview of my current project &#8212; which will end up as about a third of my PhD thesis:

dynkin:~/magma> magma
Magma V2.14-D250907   Wed Sep 26 2007 13:19:51 on dynkin   [Seed = 1]
Type ? for help.  Type -D to quit.

Loading startup file “/home/mik/.magmarc”

> Attach(”homotopy.m”);
> Attach(”assoc.m”);
> Aoo := ConstructAooRecord(DihedralGroup(4),10);
> S := CohomologyRingQuotient(Aoo`R);
> [...]]]></description>
			<content:encoded><![CDATA[<p>A sneak preview of my current project &#8212; which will end up as about a third of my PhD thesis:</p>
<pre>
dynkin:~/magma> magma
Magma V2.14-D250907   Wed Sep 26 2007 13:19:51 on dynkin   [Seed = 1]
Type ? for help.  Type -D to quit.

Loading startup file “/home/mik/.magmarc”

> Attach(”homotopy.m”);
> Attach(”assoc.m”);
> Aoo := ConstructAooRecord(DihedralGroup(4),10);
> S := CohomologyRingQuotient(Aoo`R);
> CalculateHighProduct(Aoo,[x,y,x,y]);
z
> exit;
Total time: 203.039 seconds, Total memory usage: 146.18MB
</pre>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2007/09/27/computational-projects/feed/</wfw:commentRss>
		</item>
		<item>
		<title>A infinity at the Secret Blogging Seminar</title>
		<link>http://infinity.blogseminar.net/2007/09/21/a-infinity-at-the-secret-blogging-seminar/</link>
		<comments>http://infinity.blogseminar.net/2007/09/21/a-infinity-at-the-secret-blogging-seminar/#comments</comments>
		<pubDate>Fri, 21 Sep 2007 00:32:19 +0000</pubDate>
		<dc:creator>Mikael Vejdemo Johansson</dc:creator>
		
		<category><![CDATA[A-infinity]]></category>

		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/2007/09/21/a-infinity-at-the-secret-blogging-seminar/</guid>
		<description><![CDATA[AJ Tolland links to some seminar notes he took from a seminar by Kevin Costello on A &#8734;-algebras in topological string theory.
Thanks to AJ for telling me what I got wrong in the first take.
]]></description>
			<content:encoded><![CDATA[<p><a href="http://sbseminar.wordpress.com/2007/09/20/real-curves-open-strings-and-a-infinity-algebras/">AJ Tolland links</a> to some seminar notes he took from a seminar by Kevin Costello on <a href="http://math.berkeley.edu/~ajt/costello1.pdf"><math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-algebras in topological string theory.</a></p>
<p><em>Thanks to AJ for telling me what I got wrong in the first take.</em></p>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2007/09/21/a-infinity-at-the-secret-blogging-seminar/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Overview of the computation of A-infinity structures</title>
		<link>http://infinity.blogseminar.net/2007/08/29/overview-of-the-computation-of-a-infinity-structures/</link>
		<comments>http://infinity.blogseminar.net/2007/08/29/overview-of-the-computation-of-a-infinity-structures/#comments</comments>
		<pubDate>Wed, 29 Aug 2007 09:20:05 +0000</pubDate>
		<dc:creator>Mikael Vejdemo Johansson</dc:creator>
		
		<category><![CDATA[A-infinity]]></category>

		<category><![CDATA[Mathematics]]></category>

		<guid isPermaLink="false">http://infinity.blogseminar.net/2007/08/29/overview-of-the-computation-of-a-infinity-structures/</guid>
		<description><![CDATA[Ben Webster asked, in a comment to the post Question for the audience for pointers to literature on the computation of A &#8734;-structures. Since I&#8217;m still out traveling, and far from a university, I won&#8217;t give any real pointers, but rather stick to namedropping. It&#8217;s not very difficult, using the names, to dig out the [...]]]></description>
			<content:encoded><![CDATA[<p>Ben Webster asked, in a comment to the post <a href="http://infinity.blogseminar.net/2007/08/23/question-for-the-audience/">Question for the audience</a> for pointers to literature on the computation of <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-structures. Since I&#8217;m still out traveling, and far from a university, I won&#8217;t give any real pointers, but rather stick to namedropping. It&#8217;s not very difficult, using the names, to dig out the relevant article references from MathSciNet.</p>
<p>I also suffer from being slightly new to the field. There are people out there with a much better overview of what has been done, and what does apply. (Jim Stasheff, I&#8217;m looking at you! :))</p>
<p>At the core of <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-structures on Ext algebras lies the so called <i>minimality theorem</i>, proven by A Whole Range Of People. It states, roughly, that if <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>A</mi></math> is a dg-algebra, then the <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-structure on <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>A</mi></math> given by <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>m</mi> <mn>1 </mn></msub><mo>=</mo><mi>d</mi></math> and <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>m</mi> <mn>2 </mn></msub><mo>=</mo><mo>&sdot;</mo></math> induces an <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-structure on <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msup><mi>H</mi> <mo>*</mo></msup><mi>A</mi></math>, together with a quasiisomorphism <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msup><mi>H</mi> <mo>*</mo></msup><mi>A</mi><mi>&rarr;</mi><mi>A</mi></math> in such a way that any two such induced structures are quasiisomorphic to each other.</p>
<p>And with <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>A</mi></math> taken as, for instance, <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>End</mi> <mi>A</mi></msub><mo stretchy="false">(</mo><mi>pS</mi><mo stretchy="false">)</mo></math>, for <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>pS</mi></math> suitable resolution (i.e. dg-module quasiisomorphic to the <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>A</mi></math>-module <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>S</mi></math>), we can view <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>Ext</mi> <mi>A</mi></msub><mo stretchy="false">(</mo><mi>S</mi><mo>,</mo><mi>S</mi><mo stretchy="false">)</mo><mo>=</mo><msup><mi>H</mi> <mo>*</mo></msup><mo stretchy="false">(</mo><msub><mi>End</mi> <mi>A</mi></msub><mo stretchy="false">(</mo><mi>pS</mi><mo stretchy="false">)</mo><mo stretchy="false">)</mo></math>, and thus find an <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-structure on Ext induced by the obvious structure on the endomorphism dg-algebra of a chain complex.</p>
<p>Now, the trick is how to get such a structure. One of the earliest mentions I know of is the paper by <b>Kadeishvili</b>, where a purely algorithmic approach is taken. He gives a recursion, using the Stasheff axioms, where, in order to calculate a certain higher product for a certain input, you calculate a sum of products and compositions of lower products, ending up with something that is, inductively, known. This way, you end up with calculation of specific products reducing to a matter of taking preimages under certain differentials and a lot of bookkeeping.</p>
<p>This method is the one I&#8217;m basically talking about in my previous post.</p>
<p>Another method floating around uses Homotopy Perturbation Theory (or was it Homology Perturbation Theory - I keep forgetting). Some of the relevant names here are <b>Huebschmann</b>, <b>Stasheff</b>, <b>Gugenheim</b>, <b>Johansson</b> (Lennart, not Mikael!!!) and <b>Lambe</b>. The idea here is to find a strong deformation retract <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>A</mi><mi>&rarr;</mi><msup><mi>H</mi> <mo>*</mo></msup><mi>A</mi></math>, and work with the portions of that to find everything you need.</p>
<p>This kind of approach I have seen used by Berciano in her work with the KENZO module ARAIA-CRAIC for calculation of <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-coalgebra structures in topological contexts, and is also being used by Berciano-Umble in at least one recent preprint.</p>
<p>Finally, <b>Merkulov</b> has taken the basic idea of HPT and refined it for cases where a lot is already known. He requires a vector space splitting of the dg-algebra <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>A</mi><mo>=</mo><mi>H</mi><mo>&oplus;</mo><mi>B</mi><mo>&oplus;</mo><mi>N</mi></math>, where <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>H</mi><mo>=</mo><msup><mi>H</mi> <mo>*</mo></msup><mi>A</mi></math>, <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>H</mi><mo>&oplus;</mo><mi>B</mi><mo>=</mo><mi>ker</mi><mi>d</mi></math> and <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>N</mi></math> is the complement of <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>H</mi><mo>&oplus;</mo><mi>B</mi></math>. Using this, and a few functions - a projection <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>&pi;</mi></math> down on <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>H</mi></math> and a homotopy <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>&pi;</mi><mo>&sim;</mo><mi>Id</mi></math>, he gets enough data to be able to write down the <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><msub><mi>A</mi> <mn>&infin;</mn></msub></math>-structure on <math xmlns='http://www.w3.org/1998/Math/MathML' display='inline'><mi>H</mi></math> with each function and each component of the quasiisomorphism being given by sums of planar evaluation trees, with each internal edge being an application of the homotopy, and each vertex being a normal multiplication in the dg-algebra.</p>
<p>It has the good property of being generic and at the same time very explicit. However, unless this splitting is given, and the homotopy found, you can&#8217;t do very much with it.</p>
<p>I hope I haven&#8217;t now missed anyone important in the overview. Please correct me if I have.</p>
]]></content:encoded>
			<wfw:commentRss>http://infinity.blogseminar.net/2007/08/29/overview-of-the-computation-of-a-infinity-structures/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
