Constructions in combinatorics via neural networks

04/29/2021
by   Adam Zsolt Wagner, et al.
0

We demonstrate how by using a reinforcement learning algorithm, the deep cross-entropy method, one can find explicit constructions and counterexamples to several open conjectures in extremal combinatorics and graph theory. Amongst the conjectures we refute are a question of Brualdi and Cao about maximizing permanents of pattern avoiding matrices, and several problems related to the adjacency and distance eigenvalues of graphs.

READ FULL TEXT

page 15

page 18

research
07/01/2018

Comparing large-scale graphs based on quantum probability theory

In this paper, a new measurement to compare two large-scale graphs based...
research
03/06/2023

Frames for signal processing on Cayley graphs

The spectral decomposition of graph adjacency matrices is an essential i...
research
09/26/2014

The Advantage of Cross Entropy over Entropy in Iterative Information Gathering

Gathering the most information by picking the least amount of data is a ...
research
02/19/2020

A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet

Recently, Cohen, Haeupler and Schulman gave an explicit construction of ...
research
11/12/2020

On a question of Haemers regarding vectors in the nullspace of Seidel matrices

In 2011, Haemers asked the following question: If S is the Seidel matrix...
research
04/24/2018

On the construction of sparse matrices from expander graphs

We revisit the asymptotic analysis of probabilistic construction of adja...
research
09/20/2020

Recent Progress on Matrix Rigidity – A Survey

The concept of matrix rigidity was introduced by Valiant(independently b...

Please sign up or login with your details

Forgot password? Click here to reset