Related papers: A simple proof of the representation theorem for b…

In this short note, it is shown that there is a gap in the proof of Theorem 11 in the paper of Meyer and Neutsch (J. of Algebra, 1993). We prove, nevertheless, that the statement of the theorem is true and fix the proof by using a certain…

In this paper we give a proof of an index theorem by Bismut. As a consequence we obtain another proof of the Grothendieck-Riemann-Roch theorem in differential cohomology.

We represent a general bilinear Calder\'on-Zygmund operator as a sum of simple dyadic operators. The appearing dyadic operators also admit a simple proof of a sparse bound. In particular, the representation implies a so called sparse T1…

In this paper, we give a detailed account of Goldfeld's proof of Siegel's theorem. Particularly, we present complete proofs of the nontrivial assumptions made in his paper.

Ideas from Hodge theory have found important applications in representation theory. We give a survey of joint work with Ben Elias which uncovers Hodge theoretic structure in the Hecke category ("Soergel bimodules"). We also outline…

This paper offers a proof of the Coase theorem by formalizing the notion of ideal exchanges.

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…

We extend de Finetti's (1937) notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than (linear) previsions. We prove…

In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article we did not give proofs, and instead asserted that we have…

This paper is addressed to the well-posedness of some linear and semilinear backward stochastic differential equations with general filtration, without using the Martingale Representation Theorem. The point of our approach is to introduce a…

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of…

A recently proposed integral representation for permanents is rederived using only elementary combinatorics. For this proof the assumption that the matrix, for which the permanent is calculated, has an inverse is not necessary.

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

This paper is a continuation of our first paper [10] in which we showed how deformation theory of representation varieties can be used to study finite simple quotients of triangle groups. While in Part I, we mainly used deformations of the…

In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…

In its simplest form the Decomposition Theorem asserts that the rational intersection cohomology of a complex projective variety occurs as a summand of the cohomology of any resolution. This deep theorem has found important applications in…

We provide a simple proof for the necessity of conditions for discriminating with minimum error between a known set of quantum states.

A new proof of the decomposition theorem is established using a relation with a version of the local purity theorem of Deligne and Gabber adapted to complex algebraic varieties.

In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.

The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…