Related papers: Coend calculus
We describe an explicit open book decomposition adapted to the canonical contact structure on the unit cotangent bundle of a compact surface.
Since the first end-to-end neural coreference resolution model was introduced, many extensions to the model have been proposed, ranging from using higher-order inference to directly optimizing evaluation metrics using reinforcement…
This is a reference volume on polyfold and Fredholm theory.
We show that every countable cograph has either one or infinitely many siblings. This answers, very partially, a conjecture of Thomass\'e. The main tools are the notion of well quasi ordering and the correspondence between cographs and some…
This is a revised version of Sh:430, section 6.
We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
Calcium is a C library for real and complex numbers in a form suitable for exact algebraic and symbolic computation. Numbers are represented as elements of fields $\mathbb{Q}(a_1,\ldots,a_n)$ where the extensions numbers $a_k$ may be…
Coreference resolution has been mostly investigated within a single document scope, showing impressive progress in recent years based on end-to-end models. However, the more challenging task of cross-document (CD) coreference resolution…
We construct arithmetic terms representing the partial sums of binomial coefficients, and we extend these results to obtain arithmetic terms representing the multisections of binomial coefficient sums. We also introduce an arithmetic term…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
This paper extends the dual calculus with inductive types and coinductive types. The paper first introduces a non-deterministic dual calculus with inductive and coinductive types. Besides the same duality of the original dual calculus, it…
This paper was presented at the Colloque de Saint-Denis de la Reunion, November 3-7, 1997, and published in the book L'Oc\'ean Indien au carrefour des math\'ematiques arabes, chinoises, europ\'eennes et indiennes (pp. 211-223), Tourn\`es,…
This is an essay that considering the knowledge structure and language of a different nature, attempts to build on an explanation of the object of study and characteristics of the mathematical science. We end up with a learning cycle of…
The paper is an introduction to intuitionistic mathematics.
We describe the basic notions of co-induction as they are available in the coq system. As an application, we describe arithmetic properties for simple representations of real numbers.
This is the first chapter of an introductory text under construction; further chapters are available via the authors' web pages. Our aim is to provide an elementary access to Cox rings and their applications in algebraic and arithmetic…
For the first time we represent every finite group in the form of a graph in this book. The authors choose to call these graphs as identity graph, since the main role in obtaining the graph is played by the identity element of the group.…
The aim of the paper is to provide solid foundations for a programming paradigm natively supporting the creation and manipulation of cyclic data structures. To this end, we describe coFJ, a Java-like calculus where objects can be infinite…
The paper gives a unified and simple proof of both theorems and Cousin's theorem.