1 citations · 1 across the 3 of their papers we have counts for
7 papers
Exact Completeness of LP Hierarchies for Linear Codes
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
Determining the maximum size of a binary code of blocklength and distance remains an elusive open question even when restricted to the important class of linear…
Biregularity in Sidorenko's Conjecture
Leonardo N. Coregliano, Alexander A. Razborov
Sidorenko's Conjecture says that the minimum density of a bigraph in a bigraphon of a given edge density is attained when is a constant function. A consequence of a res…
Natural quasirandomness properties
Leonardo N. Coregliano, Alexander A. Razborov
The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permuta…
On the abstract chromatic number and its computability for finitely axiomatizable theories
Leonardo N. Coregliano
The celebrated Erdős--Stone--Simonovits theorem characterizes the asymptotic maximum edge density in -free graphs as , where $χ(\mathc…
Tighter Bounds on the Independence Number of the Birkhoff Graph
Leonardo Nagami Coregliano, Fernando Granha Jeronimo
The Birkhoff graph is the Cayley graph of the symmetric group , where two permutations are adjacent if they differ by a single cycle. Our main result is a tigh…
Semantic Limits of Dense Combinatorial Objects
Leonardo N. Coregliano, Alexander A. Razborov
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag alg…