Related papers: An introduction to univalent foundations for mathe…
We construct the infinite sequence of invariants for curves in surfaces by using word theory that V. Turaev introduced. For plane closed curves, we add some extra terms, e.g. the rotation number. From these modified invariants, we get the…
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…
We develop bicategory theory in univalent foundations. Guided by the notion of univalence for (1-)categories studied by Ahrens, Kapulkin, and Shulman, we define and study univalent bicategories. To construct examples of univalent…
We introduce and study matrix transfers to achieve elementary models for bivariant $K$-theory. They share lots of common properties with Voevodsky's framed correspondences and lead to symmetric matrix motives of algebraic varieties…
Logical frameworks can be used to translate proofs from a proof system to another one. For this purpose, we should be able to encode the theory of the proof system in the logical framework. The Lambda Pi calculus modulo theory is one of…
Martin-L\"of's identity types provide a generic (albeit opaque) notion of identification or "equality" between any two elements of the same type, embodied in a canonical reflexive graph structure $(=_A, \mathbf{refl})$ on any type $A$. The…
Invariant integration of vectors and tensors over manifolds was introduced around fifty years ago by V.N. Folomeshkin, though the concept has not attracted much attention among researchers. Although it is a sophisticated concept, the…
Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…
In a recent paper I defined a new basis for the Grothendieck group of unipotent representations of an almost simple Chevalley group over a finite field. The definition for classical types was different from that for exceptional types. In…
We provide a formal introduction into the classic theorems of general topology and its axiomatic foundations in set theory. In this second part we introduce the fundamental concepts of topological spaces, convergence, and continuity, as…
(Talk presented at the XVth Workshop on Geometric Methods in Physics, Quantizations, Deformations and Coherent States, in Bialowieza, Poland, July 1-7, 1996.) The aim of this article is to introduce some basic notions of Topological Quantum…
Axiomatic set theory is almost universally accepted as the basic theory which provides the foundations of mathematics, and in which the whole of present day mathematics can be developed. As such, it is the most natural framework for…
Homotopy Type Theory with a univalent universe $\,\mathcal{U}_0$ is interpreted at the strength of finite order arithmetic. We eliminate Grothendieck universes, avoid the axiom of replacement, and bound all uses of separation.
Vladimir Turaev discovered in the early years of quantum topology that the notion of modular category was an appropriate structure for building 3-dimensional Topological Quantum Field Theories (TQFTs for short) containing invariants of…
In this note we try to bring out the ideas of Hamming's classic paper on coding theory in a form understandable by undergraduate students of mathematics.
This paper aims to provide a careful and self-contained introduction to the theory of topological degree in Euclidean spaces. It is intended for people mostly interested in analysis and, in general, a heavy background in algebraic or…
Kolmogorov introduced an informal calculus of problems in an attempt to provide a classical semantics for intuitionistic logic. This was later formalised by Medvedev and Muchnik as what has come to be called the Medvedev and Muchnik…
In their usual form, representation independence metatheorems provide an external guarantee that two implementations of an abstract interface are interchangeable when they are related by an operation-preserving correspondence. If our…
We extend the configurations discussed in Burghelea's book and Burghelea-Haller's paper on topology of angle-valued maps, equivalently the closed, open and closed-open bar codes from real- or angle-valued maps, to topological closed one…
Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…