<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN" "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="application/xhtml+xml; charset=utf-8"/>
    <title>Project-Team:REALOPT</title>
    <link rel="stylesheet" href="../static/css/raweb.css" type="text/css"/>
    <meta name="description" content="New Results - On Sets Avoiding Distance 1"/>
    <meta name="dc.title" content="New Results - On Sets Avoiding Distance 1"/>
    <meta name="dc.subject" content=""/>
    <meta name="dc.publisher" content="INRIA"/>
    <meta name="dc.date" content="(SCHEME=ISO8601) 2016-01"/>
    <meta name="dc.type" content="Report"/>
    <meta name="dc.language" content="(SCHEME=ISO639-1) en"/>
    <meta name="projet" content="REALOPT"/>
    <script type="text/javascript" src="https://raweb.inria.fr/rapportsactivite/RA2016/static/MathJax/MathJax.js?config=TeX-MML-AM_CHTML">
      <!--MathJax-->
    </script>
  </head>
  <body>
    <div class="tdmdiv">
      <div class="logo">
        <a href="http://www.inria.fr">
          <img style="align:bottom; border:none" src="../static/img/icons/logo_INRIA-coul.jpg" alt="Inria"/>
        </a>
      </div>
      <div class="TdmEntry">
        <div class="tdmentete">
          <a href="uid0.html">Project-Team Realopt</a>
        </div>
        <span>
          <a href="uid1.html">Members</a>
        </span>
      </div>
      <div class="TdmEntry">
        <a href="./uid3.html">Overall Objectives</a>
      </div>
      <div class="TdmEntry">Research Program<ul><li><a href="uid8.html&#10;&#9;&#9;  ">Introduction</a></li><li><a href="uid9.html&#10;&#9;&#9;  ">Polyhedral
approaches for MIP</a></li><li><a href="uid10.html&#10;&#9;&#9;  ">Decomposition
and reformulation approaches</a></li><li><a href="uid11.html&#10;&#9;&#9;  ">Integration of Artificial Intelligence
Techniques in Integer Programming</a></li><li><a href="uid12.html&#10;&#9;&#9;  ">Robust Optimization</a></li><li><a href="uid13.html&#10;&#9;&#9;  ">Polyhedral Combinatorics and Graph
Theory</a></li></ul></div>
      <div class="TdmEntry">Application Domains<ul><li><a href="uid15.html&#10;&#9;&#9;  ">Introduction</a></li><li><a href="uid16.html&#10;&#9;&#9;  ">Network Design and Routing Problems</a></li><li><a href="uid18.html&#10;&#9;&#9;  ">Packing and Covering Problems</a></li><li><a href="uid19.html&#10;&#9;&#9;  ">Planning, Scheduling, and
Logistic Problems</a></li></ul></div>
      <div class="TdmEntry">
        <a href="./uid21.html">Highlights of the Year</a>
      </div>
      <div class="TdmEntry">New Software and Platforms<ul><li><a href="uid23.html&#10;&#9;&#9;  ">BaPCod : A generic Branch-And-Price Code</a></li></ul></div>
      <div class="TdmEntry">New Results<ul><li><a href="uid29.html&#10;&#9;&#9;  ">Improving Branch-and-Price Methods</a></li><li><a href="uid30.html&#10;&#9;&#9;  ">Aggregation Techniques</a></li><li><a href="uid31.html&#10;&#9;&#9;  ">Review of Algorithmic Enhancements for Benders Decomposition</a></li><li><a href="uid32.html&#10;&#9;&#9;  ">Vehicle Routing Problems</a></li><li><a href="uid33.html&#10;&#9;&#9;  ">Production Scheduling Problems</a></li><li><a href="uid34.html&#10;&#9;&#9;  ">Scheduling and Placement for HPC</a></li><li><a href="uid35.html&#10;&#9;&#9;  ">Network Design Problems</a></li><li><a href="uid36.html&#10;&#9;&#9;  ">Strategic Planning of Phytosanitary treatments in Wineries</a></li><li><a href="uid37.html&#10;&#9;&#9;  ">Two-dimensional Guillotine-cut Bounded Knapsack Problem </a></li><li><a href="uid38.html&#10;&#9;&#9;  ">Matching-Based Allocation Strategies in Cloud Platforms</a></li><li class="tdmActPage"><a href="uid39.html&#10;&#9;&#9;  ">On Sets Avoiding Distance 1</a></li></ul></div>
      <div class="TdmEntry">Bilateral Contracts and Grants with Industry<ul><li><a href="uid41.html&#10;&#9;&#9;  ">Contract with EDF on robust maintenance planning</a></li><li><a href="uid42.html&#10;&#9;&#9;  ">Collaboration with ERTUS on phytosanitary treatment planning</a></li><li><a href="uid43.html&#10;&#9;&#9;  ">Collaboration with St-Gobain Recherche on glass cutting</a></li><li><a href="uid44.html&#10;&#9;&#9;  ">Collaboration with Greycon Ltd. on industrial cutting</a></li><li><a href="uid45.html&#10;&#9;&#9;  ">Collaboration with SNCF on timetable and rolling stock rotation planning</a></li></ul></div>
      <div class="TdmEntry">Partnerships and Cooperations<ul><li><a href="uid47.html&#10;&#9;&#9;  ">Regional Initiatives</a></li><li><a href="uid48.html&#10;&#9;&#9;  ">National Initiatives</a></li><li><a href="uid52.html&#10;&#9;&#9;  ">International Initiatives</a></li><li><a href="uid61.html&#10;&#9;&#9;  ">International Research Visitors</a></li></ul></div>
      <div class="TdmEntry">Dissemination<ul><li><a href="uid74.html&#10;&#9;&#9;  ">Promoting Scientific Activities</a></li><li><a href="uid104.html&#10;&#9;&#9;  ">Teaching - Supervision - Juries</a></li><li><a href="uid150.html&#10;&#9;&#9;  ">Popularization</a></li></ul></div>
      <div class="TdmEntry">
        <div>Bibliography</div>
      </div>
      <div class="TdmEntry">
        <ul>
          <li>
            <a id="tdmbibentmajor" href="bibliography.html">Major publications</a>
          </li>
          <li>
            <a id="tdmbibentyear" href="bibliography.html#year">Publications of the year</a>
          </li>
          <li>
            <a id="tdmbibentfoot" href="bibliography.html#References">References in notes</a>
          </li>
        </ul>
      </div>
    </div>
    <div id="main">
      <div class="mainentete">
        <div id="head_agauche">
          <small><a href="http://www.inria.fr">
	    
	    Inria
	  </a> | <a href="../index.html">
	    
	    Raweb 
	    2016</a> | <a href="http://www.inria.fr/en/teams/realopt">Presentation of the Project-Team REALOPT</a> | <a href="https://realopt.bordeaux.inria.fr">REALOPT Web Site
	  </a></small>
        </div>
        <div id="head_adroite">
          <table class="qrcode">
            <tr>
              <td>
                <a href="realopt.xml">
                  <img style="align:bottom; border:none" alt="XML" src="../static/img/icons/xml_motif.png"/>
                </a>
              </td>
              <td>
                <a href="realopt.pdf">
                  <img style="align:bottom; border:none" alt="PDF" src="IMG/qrcode-realopt-pdf.png"/>
                </a>
              </td>
              <td>
                <a href="../realopt/realopt.epub">
                  <img style="align:bottom; border:none" alt="e-pub" src="IMG/qrcode-realopt-epub.png"/>
                </a>
              </td>
            </tr>
            <tr>
              <td/>
              <td>PDF
</td>
              <td>e-Pub
</td>
            </tr>
          </table>
        </div>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid38.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid41.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
      <div id="textepage">
        <!--DEBUT2 du corps du module-->
        <h2>Section: 
      New Results</h2>
        <h3 class="titre3">On Sets Avoiding Distance 1</h3>
        <p>In a joint work with C. Bachoc, T. Bellitto and
P. Moustrou <a href="./bibliography.html#realopt-2016-bid83">[11]</a>, we consider the maximum
density of sets avoiding distance 1 in <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>ℝ</mi><mi>n</mi></msup></math></span>. Let <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow></math></span> be
a norm of <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>R</mi><mi>n</mi></msup></math></span> and <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>G</mi><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow></msub></math></span> be the so-called unit distance graph
with the points of <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>R</mi><mi>n</mi></msup></math></span> as vertex set and for edge set, the set of
pairs <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>{</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>}</mo></mrow></math></span> such that <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mo>|</mo><mo>|</mo><mi>x</mi><mo>-</mo><mi>y</mi><mo>|</mo><mo>|</mo><mo>=</mo><mn>1</mn></mrow></math></span>. An independent set of
<span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>G</mi><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow></msub></math></span> is said to avoid distance 1.</p>
        <p>Let <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow><mi>E</mi></msub></math></span> denote the Euclidean norm. For <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>n</mi><mo>=</mo><mn>2</mn></mrow></math></span>, the chromatic
number of <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>G</mi><msub><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow><mi>E</mi></msub></msub></math></span> is still wide open: it is only known that <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mn>4</mn><mo>≤</mo><mi>χ</mi><mfenced separators="" open="(" close=")"><msub><mi>G</mi><msub><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow><mi>E</mi></msub></msub></mfenced><mo>≤</mo><mn>7</mn></mrow></math></span> (Nelson, Isbell 1950). The
<i>measurable</i> chromatic number <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>χ</mi><mi>m</mi></msub></math></span> of the graph <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>G</mi><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow></msub></math></span>
is the minimal number of <i>measurable</i> stable sets of
<span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>G</mi><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow></msub></math></span> needed to cover all its vertices. Obviously, we have
<span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>χ</mi><mfenced separators="" open="(" close=")"><msub><mi>G</mi><msub><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow><mi>E</mi></msub></msub></mfenced><mo>≤</mo><msub><mi>χ</mi><mi>m</mi></msub><mfenced separators="" open="(" close=")"><msub><mi>G</mi><msub><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow><mi>E</mi></msub></msub></mfenced></mrow></math></span>. For <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>n</mi><mo>=</mo><mn>2</mn></mrow></math></span>, <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mn>5</mn><mo>≤</mo><msub><mi>χ</mi><mi>m</mi></msub><mfenced separators="" open="(" close=")"><msub><mi>G</mi><msub><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow><mi>E</mi></msub></msub></mfenced></mrow></math></span> (Falconer 1981).</p>
        <p>Let <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><msub><mi>m</mi><mn>1</mn></msub><mfenced separators="" open="(" close=")"><msub><mi>G</mi><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow></msub></mfenced></mrow></math></span> denote the maximum density of a
measurable set avoiding distance 1. We have
<span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mfrac><mn>1</mn><mrow><msub><mi>m</mi><mn>1</mn></msub><mfenced separators="" open="(" close=")"><msub><mi>G</mi><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow></msub></mfenced></mrow></mfrac><mo>≤</mo><msub><mi>χ</mi><mi>m</mi></msub><mfenced separators="" open="(" close=")"><msub><mi>G</mi><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow></msub></mfenced></mrow></math></span>. We study the maximum density <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>m</mi><mn>1</mn></msub></math></span> for
norms defined by polytopes: if <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>P</mi></math></span> is a centrally symmetric polytope
and <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>x</mi></math></span> is a point of <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>R</mi><mi>n</mi></msup></math></span>, <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mrow><mo>|</mo><mo>|</mo><mi>x</mi><mo>|</mo><mo>|</mo></mrow><mi>P</mi></msub></math></span> is the smallest positive real
<span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>t</mi></math></span> such that <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>x</mi><mo>∈</mo><mi>t</mi><mi>P</mi></mrow></math></span>. Polytope norms include some usual norms such
as the <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>L</mi><mn>1</mn></msup></math></span> and <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>L</mi><mi>∞</mi></msup></math></span> norms.</p>
        <p>If <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mi>P</mi></math></span> tiles the space by translation, then it is easy to see that
<span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><msub><mi>m</mi><mn>1</mn></msub><mfenced separators="" open="(" close=")"><msub><mi>G</mi><msub><mrow><mo>|</mo><mo>|</mo><mo>.</mo><mo>|</mo><mo>|</mo></mrow><mi>P</mi></msub></msub></mfenced><mo>≥</mo><mfrac><mn>1</mn><msup><mn>2</mn><mi>n</mi></msup></mfrac></mrow></math></span>. C. Bachoc and
S. Robins conjectured that equality always holds. We show that this
conjecture is true for <span class="math"><math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>n</mi><mo>=</mo><mn>2</mn></mrow></math></span> and for some polytopes in higher
dimensions.</p>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid38.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid41.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
    </div>
  </body>
</html>
