Related papers: Defining Functions on Equivalence Classes
A correspondence functor is a functor from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring. We determine exactly which simple correspondence functors are projective. Moreover,…
Quantification is the machine learning task of estimating test-data class proportions that are not necessarily similar to those in training. Apart from its intrinsic value as an aggregate statistic, quantification output can also be used to…
This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…
A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commu-tative ring. A main tool for this study is the construction of a correspondence functor associated…
We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…
Constructivists (and intuitionists in general) asked what kind of mental construction is needed to convince ourselves (and others) that some mathematical statement is true. This question has a much more practical (and even cynical)…
The sets used to construct other mathematical objects are pure sets, which means that all of their elements are sets, which are themselves pure. One set may therefore be within another, not as an element, but as an element of an element, or…
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
The purpose of this note is to work out the details of the concrete incarnation of a few categorical constructions (products, coproducts, pullbacks, pushouts, equalizers, coequalizers, and exponentials) in some useful and basic categories:…
We derive equations for the source terms appearing in structure function equations for the fourth and sixth order under the assumption of homogeneity and isotropy. The source terms can be divided into two classes, namely those stemming from…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…
We propose a type-theoretic framework for describing and proving properties of quantum computations, in particular those presented as quantum circuits. Our proposal is based on an observation that, in the polymorphic type system of Coq,…
We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
We build the $q=-1$ defomation of plane on a product of two copies of algebras of functions on the plane. This algebra constains a subalgebra of functions on the plane. We present general scheme (which could be used as well to construct…
Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…
The recent trend in mathematics is towards a framework of abstract mathematical objects, rather than the more concrete approach of explicitly defining elements which objects were thought to consist of. A natural question to raise is whether…
The aim of this article is to review different generalizations of the the notion of topological complexity to the equivariant setting. In particular, we review the relation (or non-relation) between these notions and the topological…
The space, on which quantum field operators are given, is constructed in any theory, in which the usual product between test functions is substituted by the $\star$-product (the Moyal-type product). The important example of such a theory is…
While most research in Gold-style learning focuses on learning formal languages, we consider the identification of computable structures, specifically equivalence structures. In our core model the learner gets more and more information…