<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T08:51:56Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/31048" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/31048</identifier><datestamp>2026-05-14T13:50:02Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Anema, Jason</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Strichartz, Robert Stephen</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Muscalu, Florin Camil</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Saloff-Coste, Laurent Pascal</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-01-31T19:44:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-12-20T07:00:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2012-08-20</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/31048</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">7959772</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on ´ a finitely ramified fractal is given. Examples calculated include the Sierpinski ´ Gasket, a non-p.c.f. analog of the Sierpinski Gasket, the Diamond fractal, and the Hexagasket. For each example, the asymptotic complexity constant is found. Dropping the fully symmetry assumption, it is shown that the limsup and liminf of the asymptotic complexity constant exist. Calculating the number of spanning trees on the m-Tree fractal shows that the asymptotic complexity constant for this class of fractals has no upper bound.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">fractals</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">spanning trees</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">spectral decimation</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Counting Spanning Trees On Fractal Graphs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Mathematics</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor" lang="en_US">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Mathematics</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author" lang="en_US">Anema, Jason</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="507e9096-64e3-4b79-bf79-5ce641637fa0">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Counting Spanning Trees On Fractal Graphs&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2012-08-20&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Anema, Jason&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>fractals&lt;/Keyword>
    &lt;Keyword>spanning trees&lt;/Keyword>
    &lt;Keyword>spectral decimation&lt;/Keyword>
   	&lt;Abstract>Using the method of spectral decimation and a modified version of Kirchhoff&amp;apos;s Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on ´ a finitely ramified fractal is given. Examples calculated include the Sierpinski ´ Gasket, a non-p.c.f. analog of the Sierpinski Gasket, the Diamond fractal, and the Hexagasket. For each example, the asymptotic complexity constant is found. Dropping the fully symmetry assumption, it is shown that the limsup and liminf of the asymptotic complexity constant exist. Calculating the number of spanning trees on the m-Tree fractal shows that the asymptotic complexity constant for this class of fractals has no upper bound.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>