Skip to content

Source code for my combinatorics research: Non Trivial Squares and Sidorenko's Conjecture

Notifications You must be signed in to change notification settings

pranavgarg-00/Non-Trivial-Squares-and-Sidorenkos-Conjecture

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

Non-Trivial Squares and Sidorenko's Conjecture

We categorize the bipartite graphs H on at most 7 edges for which t(H; G) ≥ t(K2; G)^|E(H)| has a sum of squares certificate.

For a longer introduction to the core concepts, formalisms, proofs, overview of the algorithms and some results, please see Non-Trivial Squares and Sidorenko's Conjecture.

Running the Code

Sums of Squares Commented.ipynb is a SageMath notebook detailing all the graph-based computation. Requires SageMath, which is a free open-source mathematics software system.

Gurobi Sos.ipynb is a Python notebook using the Gurobi library for linear programming. Running Gurobi might require a license. Check documentation.

About

Source code for my combinatorics research: Non Trivial Squares and Sidorenko's Conjecture

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published