Discrete Mathematics Mar 2025

<!DOCTYPE html> <html lang="en"> <head> <title>Discrete Mathematics Mar 2025</title> <meta name="viewport" content="width=device-width, initial-scale=1"> <link rel="apple-touch-icon" sizes="180x180" href="/static/browse/0.3.4/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="/static/browse/0.3.4/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="/static/browse/0.3.4/images/icons/favicon-16x16.png"> <link rel="manifest" href="/static/browse/0.3.4/images/icons/site.webmanifest"> <link rel="mask-icon" href="/static/browse/0.3.4/images/icons/safari-pinned-tab.svg" color="#5bbad5"> <meta name="msapplication-TileColor" content="#da532c"> <meta name="theme-color" content="#ffffff"> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/arXiv.css?v=20241206" /> <link rel="stylesheet" type="text/css" media="print" href="/static/browse/0.3.4/css/arXiv-print.css?v=20200611" /> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/browse_search.css" /> <script language="javascript" src="/static/browse/0.3.4/js/accordion.js" /></script> <script src="/static/browse/0.3.4/js/mathjaxToggle.min.js" type="text/javascript"></script> <script type="text/javascript" language="javascript">mathjaxToggle();</script> </head> <body class="with-cu-identity"> <div class="flex-wrap-footer"> <header> <a href="#content" class="is-sr-only">Skip to main content</a>  <div class="columns is-vcentered is-hidden-mobile" id="cu-identity"> <div class="column" id="cu-logo"> <a href="https://www.cornell.edu/"><img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University" /></a> </div><div class="column" id="support-ack"> <span id="support-ack-url">We gratefully acknowledge support from the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors.</span> <a href="https://info.arxiv.org/about/donate.html" class="btn-header-donate">Donate</a> </div> </div> <div id="header" class="is-hidden-mobile"> <a aria-hidden="true" tabindex="-1" href="/IgnoreMe"></a> <div class="header-breadcrumbs"> <a href="/"><img src="/static/browse/0.3.4/images/arxiv-logo-one-color-white.svg" alt="arxiv logo" style="height:40px;"/></a> <span>></span> <a href="/list/cs.DM/recent">cs.DM</a> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div> <div class="mobile-header"> <div class="columns is-mobile"> <div class="column logo-arxiv"><a href="https://arxiv.org/"><img src="/static/browse/0.3.4/images/arxiv-logomark-small-white.svg" alt="arXiv logo" style="height:60px;" /></a></div> <div class="column logo-cornell"><a href="https://www.cornell.edu/"> <picture> <source media="(min-width: 501px)" srcset="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg 400w" sizes="400w" /> <source srcset="/static/browse/0.3.4/images/icons/cu/cornell_seal_simple_black.svg 2x" /> <img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University Logo" /> </picture> </a></div> <div class="column nav" id="toggle-container" role="menubar"> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-white"><title>open search</title><path d="M505 442.7L405.3 343c-4.5-4.5-10.6-7-17-7H372c27.6-35.3 44-79.7 44-128C416 93.1 322.9 0 208 0S0 93.1 0 208s93.1 208 208 208c48.3 0 92.7-16.4 128-44v16.3c0 6.4 2.5 12.5 7 17l99.7 99.7c9.4 9.4 24.6 9.4 33.9 0l28.3-28.3c9.4-9.4 9.4-24.6.1-34zM208 336c-70.7 0-128-57.2-128-128 0-70.7 57.2-128 128-128 70.7 0 128 57.2 128 128 0 70.7-57.2 128-128 128z"/></svg></button> <div class="mobile-toggle-block toggle-target"> <form class="mobile-search-form" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <input class="input" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <input type="hidden" name="source" value="header"> <input type="hidden" name="searchtype" value="all"> <button class="button">GO</button> </div> </form> </div> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-white" role="menu"><title>open navigation menu</title><path d="M16 132h416c8.837 0 16-7.163 16-16V76c0-8.837-7.163-16-16-16H16C7.163 60 0 67.163 0 76v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16z"/ ></svg></button> <div class="mobile-toggle-block toggle-target"> <nav class="mobile-menu" aria-labelledby="mobilemenulabel"> <h2 id="mobilemenulabel">quick links</h2> <ul> <li><a href="https://arxiv.org/login">Login</a></li> <li><a href="https://info.arxiv.org/help">Help Pages</a></li> <li><a href="https://info.arxiv.org/about">About</a></li> </ul> </nav> </div> </div> </div> </div> </header> <main> <div id="content"> <div id='content-inner'> <div id='dlpage'> <h1>Discrete Mathematics</h1> <h2>Authors and titles for March 2025 </h2> <div class='paging'>Total of 61 entries : <span>1-50</span> <a href=/list/cs.DM/current?skip=50&show=50>51-61</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs.DM/current?skip=0&show=25 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <a href=/list/cs.DM/current?skip=0&show=2000 rel="nofollow"> all</a> </div> <dl id='articles'> <dt> <a name='item1'>[1]</a> <a href ="/abs/2503.00672" title="Abstract" id="2503.00672"> arXiv:2503.00672 </a> [<a href="/pdf/2503.00672" title="Download PDF" id="pdf-2503.00672" aria-labelledby="pdf-2503.00672">pdf</a>, <a href="https://arxiv.org/html/2503.00672v1" title="View HTML" id="html-2503.00672" aria-labelledby="html-2503.00672" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.00672" title="Other formats" id="oth-2503.00672" aria-labelledby="oth-2503.00672">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Interval H-graphs : Recognition and forbidden obstructions </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=M%C3%BCller,+H">Haiko M眉ller</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Rafiey,+A">Arash Rafiey</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span>; Data Structures and Algorithms (cs.DS); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item2'>[2]</a> <a href ="/abs/2503.02566" title="Abstract" id="2503.02566"> arXiv:2503.02566 </a> [<a href="/pdf/2503.02566" title="Download PDF" id="pdf-2503.02566" aria-labelledby="pdf-2503.02566">pdf</a>, <a href="https://arxiv.org/html/2503.02566v1" title="View HTML" id="html-2503.02566" aria-labelledby="html-2503.02566" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.02566" title="Other formats" id="oth-2503.02566" aria-labelledby="oth-2503.02566">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Hierarchy of Hub Covering Problems </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Jost,+N">Niklas Jost</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span> </div> </div> </dd> <dt> <a name='item3'>[3]</a> <a href ="/abs/2503.03553" title="Abstract" id="2503.03553"> arXiv:2503.03553 </a> [<a href="/pdf/2503.03553" title="Download PDF" id="pdf-2503.03553" aria-labelledby="pdf-2503.03553">pdf</a>, <a href="https://arxiv.org/html/2503.03553v1" title="View HTML" id="html-2503.03553" aria-labelledby="html-2503.03553" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.03553" title="Other formats" id="oth-2503.03553" aria-labelledby="oth-2503.03553">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Graph Width Perspective on Partially Ordered Hamiltonian Paths </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Beisegel,+J">Jesse Beisegel</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Klost,+K">Katharina Klost</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Knorr,+K">Kristin Knorr</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ratajczak,+F">Fabienne Ratajczak</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Scheffler,+R">Robert Scheffler</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span>; Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item4'>[4]</a> <a href ="/abs/2503.04591" title="Abstract" id="2503.04591"> arXiv:2503.04591 </a> [<a href="/pdf/2503.04591" title="Download PDF" id="pdf-2503.04591" aria-labelledby="pdf-2503.04591">pdf</a>, <a href="https://arxiv.org/html/2503.04591v2" title="View HTML" id="html-2503.04591" aria-labelledby="html-2503.04591" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.04591" title="Other formats" id="oth-2503.04591" aria-labelledby="oth-2503.04591">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Foundations of block-parallel automata networks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Perrot,+K">K茅vin Perrot</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sen%C3%A9,+S">Sylvain Sen茅</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tapin,+L">L茅ah Tapin</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> arXiv admin note: substantial text overlap with <a href="https://arxiv.org/abs/2402.06294" data-arxiv-id="2402.06294" class="link-https">arXiv:2402.06294</a>, <a href="https://arxiv.org/abs/2304.09664" data-arxiv-id="2304.09664" class="link-https">arXiv:2304.09664</a> </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span> </div> </div> </dd> <dt> <a name='item5'>[5]</a> <a href ="/abs/2503.07208" title="Abstract" id="2503.07208"> arXiv:2503.07208 </a> [<a href="/pdf/2503.07208" title="Download PDF" id="pdf-2503.07208" aria-labelledby="pdf-2503.07208">pdf</a>, <a href="https://arxiv.org/html/2503.07208v1" title="View HTML" id="html-2503.07208" aria-labelledby="html-2503.07208" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.07208" title="Other formats" id="oth-2503.07208" aria-labelledby="oth-2503.07208">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Jana,+S">Satyabrata Jana</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kanesh,+L">Lawqueen Kanesh</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kundu,+M">Madhumita Kundu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lokshtanov,+D">Daniel Lokshtanov</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Saurabh,+S">Saket Saurabh</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 31 pages, 10 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span>; Data Structures and Algorithms (cs.DS); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item6'>[6]</a> <a href ="/abs/2503.08128" title="Abstract" id="2503.08128"> arXiv:2503.08128 </a> [<a href="/pdf/2503.08128" title="Download PDF" id="pdf-2503.08128" aria-labelledby="pdf-2503.08128">pdf</a>, <a href="https://arxiv.org/html/2503.08128v2" title="View HTML" id="html-2503.08128" aria-labelledby="html-2503.08128" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.08128" title="Other formats" id="oth-2503.08128" aria-labelledby="oth-2503.08128">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Permanent of bipartite graphs in terms of determinants </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chakrabartty,+S">Surabhi Chakrabartty</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Singh,+R">Ranveer Singh</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 12 pages, 1 figure </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span> </div> </div> </dd> <dt> <a name='item7'>[7]</a> <a href ="/abs/2503.08285" title="Abstract" id="2503.08285"> arXiv:2503.08285 </a> [<a href="/pdf/2503.08285" title="Download PDF" id="pdf-2503.08285" aria-labelledby="pdf-2503.08285">pdf</a>, <a href="https://arxiv.org/html/2503.08285v1" title="View HTML" id="html-2503.08285" aria-labelledby="html-2503.08285" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.08285" title="Other formats" id="oth-2503.08285" aria-labelledby="oth-2503.08285">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Sorting permutations using a pop stack with a bypass </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Cioni,+L">Lapo Cioni</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ferrari,+L">Luca Ferrari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Smith,+R">Rebecca Smith</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 29 pages, 6 figures; this is the full version of the conference paper "Pop Stacks with a Bypass", in the Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings (GASCom 2024), Bordeaux, France, 24-28th June 2024, Electronic Proceedings in Theoretical Computer Science 403, pp. 73-78, <a href="https://arxiv.org/abs/2406.16399v1" data-arxiv-id="2406.16399v1" class="link-https">arXiv:2406.16399v1</a> </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span>; Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item8'>[8]</a> <a href ="/abs/2503.10240" title="Abstract" id="2503.10240"> arXiv:2503.10240 </a> [<a href="/pdf/2503.10240" title="Download PDF" id="pdf-2503.10240" aria-labelledby="pdf-2503.10240">pdf</a>, <a href="https://arxiv.org/html/2503.10240v1" title="View HTML" id="html-2503.10240" aria-labelledby="html-2503.10240" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.10240" title="Other formats" id="oth-2503.10240" aria-labelledby="oth-2503.10240">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Spherical dimension </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chornomaz,+B">Bogdan Chornomaz</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Moran,+S">Shay Moran</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Waknine,+T">Tom Waknine</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span>; Machine Learning (cs.LG) </div> </div> </dd> <dt> <a name='item9'>[9]</a> <a href ="/abs/2503.10541" title="Abstract" id="2503.10541"> arXiv:2503.10541 </a> [<a href="/pdf/2503.10541" title="Download PDF" id="pdf-2503.10541" aria-labelledby="pdf-2503.10541">pdf</a>, <a href="https://arxiv.org/html/2503.10541v1" title="View HTML" id="html-2503.10541" aria-labelledby="html-2503.10541" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.10541" title="Other formats" id="oth-2503.10541" aria-labelledby="oth-2503.10541">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Towards Transitive-free Digraphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Abhinav,+A">Ankit Abhinav</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Jana,+S">Satyabrata Jana</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sahu,+A">Abhishek Sahu</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span>; Data Structures and Algorithms (cs.DS); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item10'>[10]</a> <a href ="/abs/2503.11908" title="Abstract" id="2503.11908"> arXiv:2503.11908 </a> [<a href="/pdf/2503.11908" title="Download PDF" id="pdf-2503.11908" aria-labelledby="pdf-2503.11908">pdf</a>, <a href="https://arxiv.org/html/2503.11908v1" title="View HTML" id="html-2503.11908" aria-labelledby="html-2503.11908" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.11908" title="Other formats" id="oth-2503.11908" aria-labelledby="oth-2503.11908">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Revisiting FastMap: New Applications </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Li,+A">Ang Li</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> PhD dissertation </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span>; Artificial Intelligence (cs.AI) </div> </div> </dd> <dt> <a name='item11'>[11]</a> <a href ="/abs/2503.13357" title="Abstract" id="2503.13357"> arXiv:2503.13357 </a> [<a href="/pdf/2503.13357" title="Download PDF" id="pdf-2503.13357" aria-labelledby="pdf-2503.13357">pdf</a>, <a href="https://arxiv.org/html/2503.13357v1" title="View HTML" id="html-2503.13357" aria-labelledby="html-2503.13357" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.13357" title="Other formats" id="oth-2503.13357" aria-labelledby="oth-2503.13357">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The Power of Amortization on Scheduling with Explorable Uncertainty </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Liu,+A+H">Alison Hsiang-Hsuan Liu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Liu,+F">Fu-Hong Liu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wong,+P+W">Prudence W.H. Wong</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhang,+X">Xiao-Ou Zhang</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Discrete Mathematics (cs.DM)</span> </div> </div> </dd> <dt> <a name='item12'>[12]</a> <a href ="/abs/2503.00263" title="Abstract" id="2503.00263"> arXiv:2503.00263 </a> (cross-list from cs.DS) [<a href="/pdf/2503.00263" title="Download PDF" id="pdf-2503.00263" aria-labelledby="pdf-2503.00263">pdf</a>, <a href="https://arxiv.org/html/2503.00263v1" title="View HTML" id="html-2503.00263" aria-labelledby="html-2503.00263" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.00263" title="Other formats" id="oth-2503.00263" aria-labelledby="oth-2503.00263">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ghanbari,+B">Babak Ghanbari</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=%C5%A0%C3%A1mal,+R">Robert 艩谩mal</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item13'>[13]</a> <a href ="/abs/2503.00579" title="Abstract" id="2503.00579"> arXiv:2503.00579 </a> (cross-list from math.CA) [<a href="/pdf/2503.00579" title="Download PDF" id="pdf-2503.00579" aria-labelledby="pdf-2503.00579">pdf</a>, <a href="https://arxiv.org/html/2503.00579v3" title="View HTML" id="html-2503.00579" aria-labelledby="html-2503.00579" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.00579" title="Other formats" id="oth-2503.00579" aria-labelledby="oth-2503.00579">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Abel's Functional Equation and Interrelations </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Finch,+S">Steven Finch</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 15 pages; 4 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Classical Analysis and ODEs (math.CA)</span>; Discrete Mathematics (cs.DM); Combinatorics (math.CO); Number Theory (math.NT) </div> </div> </dd> <dt> <a name='item14'>[14]</a> <a href ="/abs/2503.00798" title="Abstract" id="2503.00798"> arXiv:2503.00798 </a> (cross-list from math.CO) [<a href="/pdf/2503.00798" title="Download PDF" id="pdf-2503.00798" aria-labelledby="pdf-2503.00798">pdf</a>, <a href="https://arxiv.org/html/2503.00798v1" title="View HTML" id="html-2503.00798" aria-labelledby="html-2503.00798" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.00798" title="Other formats" id="oth-2503.00798" aria-labelledby="oth-2503.00798">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> $K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Chakraborty,+D">Dibyayan Chakraborty</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item15'>[15]</a> <a href ="/abs/2503.00909" title="Abstract" id="2503.00909"> arXiv:2503.00909 </a> (cross-list from math.CO) [<a href="/pdf/2503.00909" title="Download PDF" id="pdf-2503.00909" aria-labelledby="pdf-2503.00909">pdf</a>, <a href="https://arxiv.org/html/2503.00909v1" title="View HTML" id="html-2503.00909" aria-labelledby="html-2503.00909" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.00909" title="Other formats" id="oth-2503.00909" aria-labelledby="oth-2503.00909">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Soft Barycentric Refinement </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Knill,+O">Oliver Knill</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 13 pages, 8 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item16'>[16]</a> <a href ="/abs/2503.01026" title="Abstract" id="2503.01026"> arXiv:2503.01026 </a> (cross-list from math.CO) [<a href="/pdf/2503.01026" title="Download PDF" id="pdf-2503.01026" aria-labelledby="pdf-2503.01026">pdf</a>, <a href="https://arxiv.org/html/2503.01026v3" title="View HTML" id="html-2503.01026" aria-labelledby="html-2503.01026" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.01026" title="Other formats" id="oth-2503.01026" aria-labelledby="oth-2503.01026">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The Narayana Morphism and Related Words </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Shallit,+J">Jeffrey Shallit</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM); Formal Languages and Automata Theory (cs.FL); Number Theory (math.NT) </div> </div> </dd> <dt> <a name='item17'>[17]</a> <a href ="/abs/2503.01121" title="Abstract" id="2503.01121"> arXiv:2503.01121 </a> (cross-list from cs.AI) [<a href="/pdf/2503.01121" title="Download PDF" id="pdf-2503.01121" aria-labelledby="pdf-2503.01121">pdf</a>, <a href="/format/2503.01121" title="Other formats" id="oth-2503.01121" aria-labelledby="oth-2503.01121">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Hybrid Metaheuristic Vehicle Routing Problem for Security Dispatch Operations </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Vu,+N+G+H">Nguyen Gia Hien Vu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tang,+Y">Yifan Tang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Lim,+R">Rey Lim</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wang,+G+G">G. Gary Wang</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Artificial Intelligence (cs.AI)</span>; Discrete Mathematics (cs.DM); Optimization and Control (math.OC) </div> </div> </dd> <dt> <a name='item18'>[18]</a> <a href ="/abs/2503.01664" title="Abstract" id="2503.01664"> arXiv:2503.01664 </a> (cross-list from cs.LG) [<a href="/pdf/2503.01664" title="Download PDF" id="pdf-2503.01664" aria-labelledby="pdf-2503.01664">pdf</a>, <a href="https://arxiv.org/html/2503.01664v1" title="View HTML" id="html-2503.01664" aria-labelledby="html-2503.01664" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.01664" title="Other formats" id="oth-2503.01664" aria-labelledby="oth-2503.01664">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Merging Hazy Sets with m-Schemes: A Geometric Approach to Data Visualization </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Barth,+L+S">Lukas Silvester Barth</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Fahimi,+H">Hannaneh Fahimi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Joharinad,+P">Parvaneh Joharinad</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Jost,+J">J眉rgen Jost</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Keck,+J">Janis Keck</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Machine Learning (cs.LG)</span>; Discrete Mathematics (cs.DM); Metric Geometry (math.MG) </div> </div> </dd> <dt> <a name='item19'>[19]</a> <a href ="/abs/2503.02160" title="Abstract" id="2503.02160"> arXiv:2503.02160 </a> (cross-list from math.CO) [<a href="/pdf/2503.02160" title="Download PDF" id="pdf-2503.02160" aria-labelledby="pdf-2503.02160">pdf</a>, <a href="https://arxiv.org/html/2503.02160v1" title="View HTML" id="html-2503.02160" aria-labelledby="html-2503.02160" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.02160" title="Other formats" id="oth-2503.02160" aria-labelledby="oth-2503.02160">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On graphs coverable by chubby shortest paths </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Hatzel,+M">Meike Hatzel</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Pilipczuk,+M">Micha艂 Pilipczuk</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item20'>[20]</a> <a href ="/abs/2503.02319" title="Abstract" id="2503.02319"> arXiv:2503.02319 </a> (cross-list from cs.DS) [<a href="/pdf/2503.02319" title="Download PDF" id="pdf-2503.02319" aria-labelledby="pdf-2503.02319">pdf</a>, <a href="https://arxiv.org/html/2503.02319v1" title="View HTML" id="html-2503.02319" aria-labelledby="html-2503.02319" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.02319" title="Other formats" id="oth-2503.02319" aria-labelledby="oth-2503.02319">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Yang,+P">Puhan Yang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Li,+G">Guchan Li</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 9 pages, 7 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Computational Geometry (cs.CG); Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item21'>[21]</a> <a href ="/abs/2503.02426" title="Abstract" id="2503.02426"> arXiv:2503.02426 </a> (cross-list from cs.DC) [<a href="/pdf/2503.02426" title="Download PDF" id="pdf-2503.02426" aria-labelledby="pdf-2503.02426">pdf</a>, <a href="https://arxiv.org/html/2503.02426v1" title="View HTML" id="html-2503.02426" aria-labelledby="html-2503.02426" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.02426" title="Other formats" id="oth-2503.02426" aria-labelledby="oth-2503.02426">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> 3-Majority and 2-Choices with Many Opinions </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Shimizu,+N">Nobutaka Shimizu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Shiraga,+T">Takeharu Shiraga</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Distributed, Parallel, and Cluster Computing (cs.DC)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item22'>[22]</a> <a href ="/abs/2503.02842" title="Abstract" id="2503.02842"> arXiv:2503.02842 </a> (cross-list from cs.CG) [<a href="/pdf/2503.02842" title="Download PDF" id="pdf-2503.02842" aria-labelledby="pdf-2503.02842">pdf</a>, <a href="https://arxiv.org/html/2503.02842v1" title="View HTML" id="html-2503.02842" aria-labelledby="html-2503.02842" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.02842" title="Other formats" id="oth-2503.02842" aria-labelledby="oth-2503.02842">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Flipping Matchings is Hard </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Binucci,+C">Carla Binucci</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Montecchiani,+F">Fabrizio Montecchiani</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Perz,+D">Daniel Perz</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Tappini,+A">Alessandra Tappini</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Extended Abstract at EuroCG 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Geometry (cs.CG)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item23'>[23]</a> <a href ="/abs/2503.02901" title="Abstract" id="2503.02901"> arXiv:2503.02901 </a> (cross-list from cs.SI) [<a href="/pdf/2503.02901" title="Download PDF" id="pdf-2503.02901" aria-labelledby="pdf-2503.02901">pdf</a>, <a href="https://arxiv.org/html/2503.02901v1" title="View HTML" id="html-2503.02901" aria-labelledby="html-2503.02901" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.02901" title="Other formats" id="oth-2503.02901" aria-labelledby="oth-2503.02901">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Metric-Based Granular Computing in Networks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Arshad,+H">Hibba Arshad</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Javaid,+I">Imran Javaid</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Social and Information Networks (cs.SI)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item24'>[24]</a> <a href ="/abs/2503.04228" title="Abstract" id="2503.04228"> arXiv:2503.04228 </a> (cross-list from math.CO) [<a href="/pdf/2503.04228" title="Download PDF" id="pdf-2503.04228" aria-labelledby="pdf-2503.04228">pdf</a>, <a href="https://arxiv.org/html/2503.04228v1" title="View HTML" id="html-2503.04228" aria-labelledby="html-2503.04228" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.04228" title="Other formats" id="oth-2503.04228" aria-labelledby="oth-2503.04228">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Polynomial Bounds in the Apex Minor Theorem </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Hendrey,+K">Kevin Hendrey</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Wood,+D+R">David R. Wood</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item25'>[25]</a> <a href ="/abs/2503.04487" title="Abstract" id="2503.04487"> arXiv:2503.04487 </a> (cross-list from math.CO) [<a href="/pdf/2503.04487" title="Download PDF" id="pdf-2503.04487" aria-labelledby="pdf-2503.04487">pdf</a>, <a href="https://arxiv.org/html/2503.04487v3" title="View HTML" id="html-2503.04487" aria-labelledby="html-2503.04487" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.04487" title="Other formats" id="oth-2503.04487" aria-labelledby="oth-2503.04487">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Positionality of Dumont--Thomas numeration systems for integers </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Kreczman,+S">Savinien Kreczman</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Labb%C3%A9,+S">S茅bastien Labb茅</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Stipulanti,+M">Manon Stipulanti</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 25 pages, 7 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM); Formal Languages and Automata Theory (cs.FL) </div> </div> </dd> <dt> <a name='item26'>[26]</a> <a href ="/abs/2503.04511" title="Abstract" id="2503.04511"> arXiv:2503.04511 </a> (cross-list from cs.DS) [<a href="/pdf/2503.04511" title="Download PDF" id="pdf-2503.04511" aria-labelledby="pdf-2503.04511">pdf</a>, <a href="https://arxiv.org/html/2503.04511v1" title="View HTML" id="html-2503.04511" aria-labelledby="html-2503.04511" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.04511" title="Other formats" id="oth-2503.04511" aria-labelledby="oth-2503.04511">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Source-Oblivious Broadcast </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Fraigniaud,+P">Pierre Fraigniaud</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Harutyunyan,+H+A">Hovhannes A. Harutyunyan</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Data Structures and Algorithms (cs.DS)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item27'>[27]</a> <a href ="/abs/2503.05136" title="Abstract" id="2503.05136"> arXiv:2503.05136 </a> (cross-list from cs.CR) [<a href="/pdf/2503.05136" title="Download PDF" id="pdf-2503.05136" aria-labelledby="pdf-2503.05136">pdf</a>, <a href="/format/2503.05136" title="Other formats" id="oth-2503.05136" aria-labelledby="oth-2503.05136">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The Beginner's Textbook for Fully Homomorphic Encryption </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ko,+R">Ronny Ko</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Cryptography and Security (cs.CR)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item28'>[28]</a> <a href ="/abs/2503.05562" title="Abstract" id="2503.05562"> arXiv:2503.05562 </a> (cross-list from math.CO) [<a href="/pdf/2503.05562" title="Download PDF" id="pdf-2503.05562" aria-labelledby="pdf-2503.05562">pdf</a>, <a href="https://arxiv.org/html/2503.05562v1" title="View HTML" id="html-2503.05562" aria-labelledby="html-2503.05562" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05562" title="Other formats" id="oth-2503.05562" aria-labelledby="oth-2503.05562">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On graph classes with constant domination-packing ratio </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Bonamy,+M">Marthe Bonamy</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Csik%C3%B3s,+M">M贸nika Csik贸s</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Gujgiczer,+A">Anna Gujgiczer</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Yuditsky,+Y">Yelena Yuditsky</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item29'>[29]</a> <a href ="/abs/2503.05661" title="Abstract" id="2503.05661"> arXiv:2503.05661 </a> (cross-list from math.CO) [<a href="/pdf/2503.05661" title="Download PDF" id="pdf-2503.05661" aria-labelledby="pdf-2503.05661">pdf</a>, <a href="https://arxiv.org/html/2503.05661v1" title="View HTML" id="html-2503.05661" aria-labelledby="html-2503.05661" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05661" title="Other formats" id="oth-2503.05661" aria-labelledby="oth-2503.05661">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Graph parameters that are coarsely equivalent to path-length </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Dragan,+F+F">Feodor F. Dragan</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=K%C3%B6hler,+E">Ekkehard K枚hler</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 20 pages. arXiv admin note: text overlap with <a href="https://arxiv.org/abs/2502.00951" data-arxiv-id="2502.00951" class="link-https">arXiv:2502.00951</a> </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item30'>[30]</a> <a href ="/abs/2503.05695" title="Abstract" id="2503.05695"> arXiv:2503.05695 </a> (cross-list from cs.GT) [<a href="/pdf/2503.05695" title="Download PDF" id="pdf-2503.05695" aria-labelledby="pdf-2503.05695">pdf</a>, <a href="/format/2503.05695" title="Other formats" id="oth-2503.05695" aria-labelledby="oth-2503.05695">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On Almost Fair and Equitable Allocations of Indivisible Items for Non-monotone Valuations </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Bil%C3%B2,+V">Vittorio Bil貌</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Loebl,+M">Martin Loebl</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vinci,+C">Cosimo Vinci</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computer Science and Game Theory (cs.GT)</span>; Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item31'>[31]</a> <a href ="/abs/2503.05898" title="Abstract" id="2503.05898"> arXiv:2503.05898 </a> (cross-list from cs.SI) [<a href="/pdf/2503.05898" title="Download PDF" id="pdf-2503.05898" aria-labelledby="pdf-2503.05898">pdf</a>, <a href="https://arxiv.org/html/2503.05898v1" title="View HTML" id="html-2503.05898" aria-labelledby="html-2503.05898" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.05898" title="Other formats" id="oth-2503.05898" aria-labelledby="oth-2503.05898">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Forming Coordinated Teams that Balance Task Coverage and Expert Workload </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Vombatkere,+K">Karan Vombatkere</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Terzi,+E">Evimaria Terzi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gionis,+A">Aristides Gionis</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Data Mining and Knowledge Discovery (2025) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Social and Information Networks (cs.SI)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item32'>[32]</a> <a href ="/abs/2503.06086" title="Abstract" id="2503.06086"> arXiv:2503.06086 </a> (cross-list from math.CO) [<a href="/pdf/2503.06086" title="Download PDF" id="pdf-2503.06086" aria-labelledby="pdf-2503.06086">pdf</a>, <a href="https://arxiv.org/html/2503.06086v1" title="View HTML" id="html-2503.06086" aria-labelledby="html-2503.06086" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.06086" title="Other formats" id="oth-2503.06086" aria-labelledby="oth-2503.06086">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Characterizing optimal monitoring edge-geodetic sets for some structured graph classes </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Foucaud,+F">Florent Foucaud</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Pandey,+A">Arti Pandey</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Paul,+K">Kaustav Paul</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item33'>[33]</a> <a href ="/abs/2503.06466" title="Abstract" id="2503.06466"> arXiv:2503.06466 </a> (cross-list from math.CO) [<a href="/pdf/2503.06466" title="Download PDF" id="pdf-2503.06466" aria-labelledby="pdf-2503.06466">pdf</a>, <a href="https://arxiv.org/html/2503.06466v1" title="View HTML" id="html-2503.06466" aria-labelledby="html-2503.06466" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.06466" title="Other formats" id="oth-2503.06466" aria-labelledby="oth-2503.06466">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Eze,+L+C">L. C. Eze</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Jajcay,+R">R. Jajcay</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Jajcayov%C3%A1,+T">T. Jajcayov谩</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Z%C3%A1vack%C3%A1,+D">D. Z谩vack谩</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item34'>[34]</a> <a href ="/abs/2503.07166" title="Abstract" id="2503.07166"> arXiv:2503.07166 </a> (cross-list from math.CO) [<a href="/pdf/2503.07166" title="Download PDF" id="pdf-2503.07166" aria-labelledby="pdf-2503.07166">pdf</a>, <a href="https://arxiv.org/html/2503.07166v1" title="View HTML" id="html-2503.07166" aria-labelledby="html-2503.07166" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.07166" title="Other formats" id="oth-2503.07166" aria-labelledby="oth-2503.07166">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Near Triple Arrays </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Gordeev,+A">Alexey Gordeev</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Markstr%C3%B6m,+K">Klas Markstr枚m</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=%C3%96hman,+L">Lars-Daniel 脰hman</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item35'>[35]</a> <a href ="/abs/2503.07335" title="Abstract" id="2503.07335"> arXiv:2503.07335 </a> (cross-list from math.CO) [<a href="/pdf/2503.07335" title="Download PDF" id="pdf-2503.07335" aria-labelledby="pdf-2503.07335">pdf</a>, <a href="https://arxiv.org/html/2503.07335v1" title="View HTML" id="html-2503.07335" aria-labelledby="html-2503.07335" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.07335" title="Other formats" id="oth-2503.07335" aria-labelledby="oth-2503.07335">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Playing Sudoku on random 3-regular graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Dippel,+J">Jack Dippel</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Eide,+A">Austin Eide</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Pralat,+P">Pawel Pralat</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Willhalm,+D">Daniel Willhalm</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item36'>[36]</a> <a href ="/abs/2503.07361" title="Abstract" id="2503.07361"> arXiv:2503.07361 </a> (cross-list from cs.CG) [<a href="/pdf/2503.07361" title="Download PDF" id="pdf-2503.07361" aria-labelledby="pdf-2503.07361">pdf</a>, <a href="https://arxiv.org/html/2503.07361v1" title="View HTML" id="html-2503.07361" aria-labelledby="html-2503.07361" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.07361" title="Other formats" id="oth-2503.07361" aria-labelledby="oth-2503.07361">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Geometric realizations of dichotomous ordinal graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Angelini,+P">Patrizio Angelini</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Cornelsen,+S">Sabine Cornelsen</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Haase,+C">Carolina Haase</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Hoffmann,+M">Michael Hoffmann</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Katsanou,+E">Eleni Katsanou</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Montecchiani,+F">Fabrizio Montecchiani</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Steiner,+R">Raphael Steiner</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Symvonis,+A">Antonios Symvonis</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 20 pages, 9 figures, accepted to Symposium of Computational Geometry 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Geometry (cs.CG)</span>; Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item37'>[37]</a> <a href ="/abs/2503.07409" title="Abstract" id="2503.07409"> arXiv:2503.07409 </a> (cross-list from math.CO) [<a href="/pdf/2503.07409" title="Download PDF" id="pdf-2503.07409" aria-labelledby="pdf-2503.07409">pdf</a>, <a href="/format/2503.07409" title="Other formats" id="oth-2503.07409" aria-labelledby="oth-2503.07409">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the expressive power of $2$-edge-colourings of graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Bok,+J">Jan Bok</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Guzm%C3%A1n-Pro,+S">Santiago Guzm谩n-Pro</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Jedli%C4%8Dkov%C3%A1,+N">Nikola Jedli膷kov谩</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Hern%C3%A1ndez-Cruz,+C">C茅sar Hern谩ndez-Cruz</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item38'>[38]</a> <a href ="/abs/2503.07447" title="Abstract" id="2503.07447"> arXiv:2503.07447 </a> (cross-list from math.CO) [<a href="/pdf/2503.07447" title="Download PDF" id="pdf-2503.07447" aria-labelledby="pdf-2503.07447">pdf</a>, <a href="https://arxiv.org/html/2503.07447v1" title="View HTML" id="html-2503.07447" aria-labelledby="html-2503.07447" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.07447" title="Other formats" id="oth-2503.07447" aria-labelledby="oth-2503.07447">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A new density limit for unanimity in majority dynamics on random graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Kim,+J+H">Jeong Han Kim</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Tran,+B">BaoLinh Tran</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 22 pages, 0 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM); Mathematical Physics (math-ph) </div> </div> </dd> <dt> <a name='item39'>[39]</a> <a href ="/abs/2503.07571" title="Abstract" id="2503.07571"> arXiv:2503.07571 </a> (cross-list from math.PR) [<a href="/pdf/2503.07571" title="Download PDF" id="pdf-2503.07571" aria-labelledby="pdf-2503.07571">pdf</a>, <a href="https://arxiv.org/html/2503.07571v1" title="View HTML" id="html-2503.07571" aria-labelledby="html-2503.07571" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.07571" title="Other formats" id="oth-2503.07571" aria-labelledby="oth-2503.07571">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Concentration via Metastable Mixing, with Applications to the Supercritical Exponential Random Graph Model </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Winstein,+V">Vilas Winstein</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 46 pages, 11 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Probability (math.PR)</span>; Statistical Mechanics (cond-mat.stat-mech); Discrete Mathematics (cs.DM); Mathematical Physics (math-ph); Statistics Theory (math.ST) </div> </div> </dd> <dt> <a name='item40'>[40]</a> <a href ="/abs/2503.07665" title="Abstract" id="2503.07665"> arXiv:2503.07665 </a> (cross-list from cs.CC) [<a href="/pdf/2503.07665" title="Download PDF" id="pdf-2503.07665" aria-labelledby="pdf-2503.07665">pdf</a>, <a href="https://arxiv.org/html/2503.07665v1" title="View HTML" id="html-2503.07665" aria-labelledby="html-2503.07665" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.07665" title="Other formats" id="oth-2503.07665" aria-labelledby="oth-2503.07665">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The Computational Complexity of Positive Non-Clashing Teaching in Graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ganian,+R">Robert Ganian</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Khazaliya,+L">Liana Khazaliya</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Inerney,+F+M">Fionn Mc Inerney</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Rocton,+M">Mathis Rocton</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> The short version of this paper will appear in the proceedings of ICLR 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Complexity (cs.CC)</span>; Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG); Machine Learning (stat.ML) </div> </div> </dd> <dt> <a name='item41'>[41]</a> <a href ="/abs/2503.08088" title="Abstract" id="2503.08088"> arXiv:2503.08088 </a> (cross-list from math.CO) [<a href="/pdf/2503.08088" title="Download PDF" id="pdf-2503.08088" aria-labelledby="pdf-2503.08088">pdf</a>, <a href="https://arxiv.org/html/2503.08088v1" title="View HTML" id="html-2503.08088" aria-labelledby="html-2503.08088" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.08088" title="Other formats" id="oth-2503.08088" aria-labelledby="oth-2503.08088">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Secure domination in $P_5$-free graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Maniya,+P+V">Paras Vinubhai Maniya</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Gupta,+U+K">Uttam K. Gupta</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Henning,+M+A">Michael A. Henning</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Pradhan,+D">Dinabandhu Pradhan</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item42'>[42]</a> <a href ="/abs/2503.09115" title="Abstract" id="2503.09115"> arXiv:2503.09115 </a> (cross-list from cs.CG) [<a href="/pdf/2503.09115" title="Download PDF" id="pdf-2503.09115" aria-labelledby="pdf-2503.09115">pdf</a>, <a href="https://arxiv.org/html/2503.09115v1" title="View HTML" id="html-2503.09115" aria-labelledby="html-2503.09115" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09115" title="Other formats" id="oth-2503.09115" aria-labelledby="oth-2503.09115">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The Zarankiewicz Problem for Polygon Visibility Graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ackerman,+E">Eyal Ackerman</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Keszegh,+B">Bal谩zs Keszegh</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 17 pages, 11 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Computational Geometry (cs.CG)</span>; Discrete Mathematics (cs.DM); Combinatorics (math.CO) </div> </div> </dd> <dt> <a name='item43'>[43]</a> <a href ="/abs/2503.09230" title="Abstract" id="2503.09230"> arXiv:2503.09230 </a> (cross-list from math.CO) [<a href="/pdf/2503.09230" title="Download PDF" id="pdf-2503.09230" aria-labelledby="pdf-2503.09230">pdf</a>, <a href="https://arxiv.org/html/2503.09230v1" title="View HTML" id="html-2503.09230" aria-labelledby="html-2503.09230" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09230" title="Other formats" id="oth-2503.09230" aria-labelledby="oth-2503.09230">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Face covers and rooted minors in bounded genus graphs </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Fiorini,+S">Samuel Fiorini</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Kober,+S">Stefan Kober</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Seweryn,+M+T">Micha艂 T. Seweryn</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Shantanam,+A">Abhinav Shantanam</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Yuditsky,+Y">Yelena Yuditsky</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item44'>[44]</a> <a href ="/abs/2503.09357" title="Abstract" id="2503.09357"> arXiv:2503.09357 </a> (cross-list from cs.LG) [<a href="/pdf/2503.09357" title="Download PDF" id="pdf-2503.09357" aria-labelledby="pdf-2503.09357">pdf</a>, <a href="https://arxiv.org/html/2503.09357v1" title="View HTML" id="html-2503.09357" aria-labelledby="html-2503.09357" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09357" title="Other formats" id="oth-2503.09357" aria-labelledby="oth-2503.09357">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Automatic Operator-level Parallelism Planning for Distributed Deep Learning -- A Mixed-Integer Programming Approach </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=She,+R">Ruifeng She</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Pang,+B">Bowen Pang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Li,+K">Kai Li</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Liu,+Z">Zehua Liu</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zhong,+T">Tao Zhong</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Machine Learning (cs.LG)</span>; Artificial Intelligence (cs.AI); Distributed, Parallel, and Cluster Computing (cs.DC); Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item45'>[45]</a> <a href ="/abs/2503.09525" title="Abstract" id="2503.09525"> arXiv:2503.09525 </a> (cross-list from math.CO) [<a href="/pdf/2503.09525" title="Download PDF" id="pdf-2503.09525" aria-labelledby="pdf-2503.09525">pdf</a>, <a href="https://arxiv.org/html/2503.09525v2" title="View HTML" id="html-2503.09525" aria-labelledby="html-2503.09525" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.09525" title="Other formats" id="oth-2503.09525" aria-labelledby="oth-2503.09525">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Bounds on the Number of Pieces in Continuous Piecewise Affine Functions </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Zanotti,+L">Leo Zanotti</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Computational Geometry (cs.CG); Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item46'>[46]</a> <a href ="/abs/2503.09904" title="Abstract" id="2503.09904"> arXiv:2503.09904 </a> (cross-list from eess.SY) [<a href="/pdf/2503.09904" title="Download PDF" id="pdf-2503.09904" aria-labelledby="pdf-2503.09904">pdf</a>, <a href="/format/2503.09904" title="Other formats" id="oth-2503.09904" aria-labelledby="oth-2503.09904">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Analysis and Mitigation of Cascading Failures Using a Stochastic Interaction Graph with Eigen-analysis </div> <div class='list-authors'><a href="https://arxiv.org/search/eess?searchtype=author&query=Guo,+Z">Zhenping Guo</a>, <a href="https://arxiv.org/search/eess?searchtype=author&query=Su,+X">Xiaowen Su</a>, <a href="https://arxiv.org/search/eess?searchtype=author&query=Sun,+K">Kai Sun</a>, <a href="https://arxiv.org/search/eess?searchtype=author&query=Park,+B">Byungkwon Park</a>, <a href="https://arxiv.org/search/eess?searchtype=author&query=Simunovic,+S">Srdjan Simunovic</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEEE Transactions on Power Systems, vol. 40, No. 2, March 2025 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Systems and Control (eess.SY)</span>; Discrete Mathematics (cs.DM); Dynamical Systems (math.DS); Probability (math.PR); Spectral Theory (math.SP) </div> </div> </dd> <dt> <a name='item47'>[47]</a> <a href ="/abs/2503.10002" title="Abstract" id="2503.10002"> arXiv:2503.10002 </a> (cross-list from math.CO) [<a href="/pdf/2503.10002" title="Download PDF" id="pdf-2503.10002" aria-labelledby="pdf-2503.10002">pdf</a>, <a href="/format/2503.10002" title="Other formats" id="oth-2503.10002" aria-labelledby="oth-2503.10002">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Triangle-free graphs with the fewest independent sets </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Buys,+P">Pjotr Buys</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=van+den+Heuvel,+J">Jan van den Heuvel</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Kang,+R+J">Ross J. Kang</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 12 pages, 1 figure </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM); Probability (math.PR) </div> </div> </dd> <dt> <a name='item48'>[48]</a> <a href ="/abs/2503.10158" title="Abstract" id="2503.10158"> arXiv:2503.10158 </a> (cross-list from math.NT) [<a href="/pdf/2503.10158" title="Download PDF" id="pdf-2503.10158" aria-labelledby="pdf-2503.10158">pdf</a>, <a href="https://arxiv.org/html/2503.10158v1" title="View HTML" id="html-2503.10158" aria-labelledby="html-2503.10158" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.10158" title="Other formats" id="oth-2503.10158" aria-labelledby="oth-2503.10158">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Solving Modular Linear Systems with a Constraint by parallel decomposition of the Smith form and extended Euclidean division modulo powers of primes divisors </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Sule,+V">Virendra Sule</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 15 pages </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Number Theory (math.NT)</span>; Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS) </div> </div> </dd> <dt> <a name='item49'>[49]</a> <a href ="/abs/2503.10320" title="Abstract" id="2503.10320"> arXiv:2503.10320 </a> (cross-list from math.CO) [<a href="/pdf/2503.10320" title="Download PDF" id="pdf-2503.10320" aria-labelledby="pdf-2503.10320">pdf</a>, <a href="https://arxiv.org/html/2503.10320v1" title="View HTML" id="html-2503.10320" aria-labelledby="html-2503.10320" rel="noopener noreferrer" target="_blank">html</a>, <a href="/format/2503.10320" title="Other formats" id="oth-2503.10320" aria-labelledby="oth-2503.10320">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Combinatorial Designs and Cellular Automata: A Survey </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Manzoni,+L">Luca Manzoni</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Mariot,+L">Luca Mariot</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Menara,+G">Giuliamaria Menara</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 35 pages, 8 figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Cryptography and Security (cs.CR); Discrete Mathematics (cs.DM); History and Overview (math.HO) </div> </div> </dd> <dt> <a name='item50'>[50]</a> <a href ="/abs/2503.10504" title="Abstract" id="2503.10504"> arXiv:2503.10504 </a> (cross-list from math.CO) [<a href="/pdf/2503.10504" title="Download PDF" id="pdf-2503.10504" aria-labelledby="pdf-2503.10504">pdf</a>, <a href="/format/2503.10504" title="Other formats" id="oth-2503.10504" aria-labelledby="oth-2503.10504">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation </div> <div class='list-authors'><a href="https://arxiv.org/search/math?searchtype=author&query=Bright,+C">Curtis Bright</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Keita,+A">Amadou Keita</a>, <a href="https://arxiv.org/search/math?searchtype=author&query=Stevens,+B">Brett Stevens</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Combinatorics (math.CO)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> </dl> <div class='paging'>Total of 61 entries : <span>1-50</span> <a href=/list/cs.DM/current?skip=50&show=50>51-61</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs.DM/current?skip=0&show=25 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <a href=/list/cs.DM/current?skip=0&show=2000 rel="nofollow"> all</a> </div> </div> </div> </div> </main> <footer style="clear: both;"> <div class="columns is-desktop" role="navigation" aria-label="Secondary" style="margin: -0.75em -0.75em 0.75em -0.75em">  <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>   </div> </footer> </div> <script src="/static/base/1.0.1/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Discrete Mathematics Mar 2025