Brute Force Algorithms for the Union-Closed Sets Conjecture

Student: Malygin Dmitriy

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Final Grade: 8

Year of Graduation: 2020

In this paper Frankl 's conjecture is studied , including detailed review of brute force algorithms used to verify the specific cases of the conjecture as well as formulation and proof of new statement for the case with the 13-element universe.

Full text (added May 19, 2020)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses