<?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:31:39Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/11245" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/11245</identifier><datestamp>2026-05-14T13:51:57Z</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">Gravel, Simon</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-08-25T20:01:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-08-25T20:01:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-08-25T20:01:26Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/11245</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6563825</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This dissertation describes two projects in which the treatment of a difficult and asymmetric&#xd;
problem is simplified by using symmetries of basic building blocks of the problem.&#xd;
In the first part of this dissertation we address the problem of determining the effective&#xd;
interaction between ions in metallic systems. Our work applies more generally to&#xd;
systems where effective interactions between massive particles can be calculated to take&#xd;
into account, in an average way, the effect of lighter particles present in the system. We&#xd;
find an equality relating the (asymmetric) effective interaction of two massive particles&#xd;
and the (symmetric) effect of a single massive particle on the density of the light particles.&#xd;
We show how this relation can be used to improve upon the precision of effective&#xd;
potentials calculated by perturbative approaches for an assortment of systems including&#xd;
hydrogen in metallic environment.&#xd;
In the second part of this dissertation we discuss constraint satisfaction problems.&#xd;
We provide multiple examples of constraint satisfaction problems occurring in various&#xd;
scientific areas. In many cases the individual constraints are highly symmetric, while&#xd;
the resulting constraint satisfaction problem is not; there is no symmetry common to&#xd;
all the constraints. We describe divide and concur, a new approach to solve constraint&#xd;
problems, which is based on projections to the individual constraint sets. The definition&#xd;
of efficient projection operators are facilitated by symmetries of the constraint sets. We&#xd;
show that this method is competitive with the state-of-the-art on standard benchmark&#xd;
problems, and in the process establish a number of records in finite disk packing problems.&#xd;
Many applications of the divide and concur approach are still to be explored, and&#xd;
we provide the reader with tools to do so, including promising applications and a list of&#xd;
constraint sets together with efficient projection operators.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="sponsorship" lang="en_US">NSERC Fellowship,&#xd;
FQRNT Fellowship,&#xd;
National Science Foundation Grant DMR-0426568,&#xd;
National Science Foundation Grant DMR-0601461.</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">Constraint satisfaction problems</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">effective pair potentials</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">iterated maps</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">nonlinear perturbation theory</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Using symmmetries to solve asymmetric problems</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="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">Gravel, Simon</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="2a10e579-cb96-405e-95f7-f34f75c51198">
	&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>Using symmmetries to solve asymmetric problems&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2008-08-25T20:01:26Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Gravel, Simon&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>Constraint satisfaction problems&lt;/Keyword>
    &lt;Keyword>effective pair potentials&lt;/Keyword>
    &lt;Keyword>iterated maps&lt;/Keyword>
    &lt;Keyword>nonlinear perturbation theory&lt;/Keyword>
   	&lt;Abstract>This dissertation describes two projects in which the treatment of a difficult and asymmetric&#xd;
problem is simplified by using symmetries of basic building blocks of the problem.&#xd;
In the first part of this dissertation we address the problem of determining the effective&#xd;
interaction between ions in metallic systems. Our work applies more generally to&#xd;
systems where effective interactions between massive particles can be calculated to take&#xd;
into account, in an average way, the effect of lighter particles present in the system. We&#xd;
find an equality relating the (asymmetric) effective interaction of two massive particles&#xd;
and the (symmetric) effect of a single massive particle on the density of the light particles.&#xd;
We show how this relation can be used to improve upon the precision of effective&#xd;
potentials calculated by perturbative approaches for an assortment of systems including&#xd;
hydrogen in metallic environment.&#xd;
In the second part of this dissertation we discuss constraint satisfaction problems.&#xd;
We provide multiple examples of constraint satisfaction problems occurring in various&#xd;
scientific areas. In many cases the individual constraints are highly symmetric, while&#xd;
the resulting constraint satisfaction problem is not; there is no symmetry common to&#xd;
all the constraints. We describe divide and concur, a new approach to solve constraint&#xd;
problems, which is based on projections to the individual constraint sets. The definition&#xd;
of efficient projection operators are facilitated by symmetries of the constraint sets. We&#xd;
show that this method is competitive with the state-of-the-art on standard benchmark&#xd;
problems, and in the process establish a number of records in finite disk packing problems.&#xd;
Many applications of the divide and concur approach are still to be explored, and&#xd;
we provide the reader with tools to do so, including promising applications and a list of&#xd;
constraint sets together with efficient projection operators.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>