In homotopy type theory, we construct the propositional truncation as a colimit, using only non-recursive higher inductive types (HITs). This is a first step towards reducing rec...
In Separation Logic, representation predicates are used to describe mutable data structures, by establishing a relationship between the entry point of the structure, the piece of ...
We present an upgraded version (denoted as version 2.0) of the program HELAC-Onia for the automated computation of heavy-quarkonium helicity amplitudes within non-relativistic QCD...
We study the expected value of the length Ln of the minimum spanning tree of the complete graph Kn when each edge e is given an independent uniform [0, 1] edge weight. We sharpen ...
Colin Cooper, Alan M. Frieze, Nate Ince, Svante Ja...
This paper addresses the following question for a given graph H: what is the minimum number f(H) such that every graph with average degree at least f(H) contains H as a minor? Due...
We consider “unconstrained” random k-XORSAT, which is a uniformly random system of m linear non-homogeneous equations in F2 over n variables, each equation containing k ≥ 3 v...
Let k be a positive integer and let X be a k-fold packing of infinitely many simply connected compact sets in the plane, that is, assume that every point belongs to at most k sets...
Given a property of Boolean functions, what is the minimum number of queries required to determine with high probability if an input function satisfies this property? This is a f...