Related papers: Logic Blog 2016
The Goldman-Parker Conjecture classifies the complex hyperbolic C-reflection ideal triangle groups up to discreteness. We proved the Goldman-Parker Conjecture in [Ann. of Math. 153 (2001) 533--598] using a rigorous computer-assisted proof.…
The multiplicative fragment of Linear Logic is the formal system in this family with the best understood proof theory, and the categorical models which best capture this theory are the fully complete ones. We demonstrate how the Hyland-Tan…
In this manuscript a recent topology on the positive integers generated by the collection of $\{\sigma_n:n\in\mathbb{N}\}$ where $\sigma_n:=\{m: \gcd(n,m)=1\}$ is generalized over integral domains. Some of its topological properties are…
This paper is an informal survey of some of the deep connections between logic and optimization. It covers George Boole's probability logic, decision diagrams, logic and cutting planes, first order predicate logic, default and nonmonotonic…
This is an expanded lecture note for "Masterclass on sofic groups and applications to operator algebras" (University of Copenhagen, 5-9 November 2012). It is about algebraic aspects of the Connes Embedding Conjecture. It contains new proofs…
Online learning to rank is a core problem in machine learning. In Lattimore et al. (2018), a novel online learning algorithm was proposed based on topological sorting. In the paper they provided a set of self-normalized inequalities (a) in…
We prove that for every $\epsilon > 0$ there exists a $\delta > 0$ so that every group of order $n \geq 3$ has at least $\delta \log_{2} n/{(\log_{2} \log_{2} n)}^{3+\epsilon}$ conjugacy classes. This sharpens earlier results of Pyber and…
We prove that there exists a positive constant \epsilon such that if \log n / n \le p \le n^{-1+\epsilon}, then asymptotically almost surely the random graph G ~ G(n,p) contains a collection of \lfloor \delta(G)/2 \rfloor edge-disjoint…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…
In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…
A milestone in Probability Theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables $\{t_i\}_{i=1}^{\infty}$ with mean $0$ and variance…
We prove Gamma conjecture I for all flag varieties by following a strategy proposed by Galkin and Iritani. The main new ingredient is showing that the totally positive part of the Rietsch mirror is mirror to the $\widehat{\Gamma}$-class and…
Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove that for any given system of equations \Sigma, all the solutions of \Sigma over a random group of density d<\frac{1}{2} are…
We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We…
Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,...) are derived, which prove the truth of Bondy's (1980) famous conjecture for some…
In 1946, Magnus presented an addition theorem for the confluent hypergeometric function of the second kind $U$ with argument $x+y$ expressed as an integral of a product of two $U$'s, one with argument $x$ and another with argument $y$. We…
The emphasis is made on the juxtaposition of (quantum~theorem) proving versus quantum (theorem~proving). The logical contents of verification of the statements concerning quantum systems is outlined. The Zittereingang (trembling input)…
A new bound for the rank of the intersection of finitely generated subgroups of a free group is given, formulated in topological terms, and very much in the spirit of Stallings. The bound is a contribution to (although unfortunately not a…