Related papers: Improving Cauchy's Theorem in Constructive Analysi…

Two measures of how near an arbitrary function between groups is to being a homomorphism are considered. These have properties similar to conjugates and commutators. The authors show that there is a rich theory based on these structures,…

Cover's function counting theorem is a milestone in the theory of artificial neural networks. It provides an answer to the fundamental question of determining how many binary assignments (dichotomies) of $p$ points in $n$ dimensions can be…

Following "Boundary Value Problems" by Gakhov, we present basic details of the Cauchy Type Integral and its Jump Decomposition. We also contextualize its place and importance in Geometric Function Theory, and efforts to define these…

The Carath\'eodory theorem on the construction of a measure is generalized by replacing the outer measure with an approximation of it and generalizing the Carath\'eodory measurability. The new theorem is applied to obtain dynamically…

We describe an implementation of the biset category of finite groups as a tower of standard categorical constructions, all of which are implemented in the software projec t CAP for algorithmic category theory. In particular, we describe the…

This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-called context c. This leads to defining c-superstability, a…

I show that the basic structure of symplectic integrators is governed by a theorem which states {\it precisely}, how symplectic integrators with positive coefficients cannot be corrected beyond second order. All previous known results can…

The Euler characteristic transform (ECT) is an integral transform used widely in topological data analysis. Previous efforts by Curry et al. and Ghrist et al. have independently shown that the ECT is injective on all compact definable sets.…

In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…

Invertibility is an important concept in category theory. In higher category theory, it becomes less obvious what the correct notion of invertibility is, as extra coherence conditions can become necessary for invertible structures to have…

Conformal Riemann mapping of the unit disk onto a simply-connected domain $W$ is a central object of study in classical Complex Analysis. The first complete proof of the Riemann Mapping Theorem given by P. Koebe in 1912 is constructive, and…

Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…

"Church's thesis" ($\mathsf{CT}$) as an axiom in constructive logic states that every total function of type $\mathbb{N} \to \mathbb{N}$ is computable, i.e. definable in a model of computation. $\mathsf{CT}$ is inconsistent in both…

In this paper, we give a new completion for quasi-uniform spaces which generalizes the completion theories of Doitchinov [8] and Stoltenberg [20]. The presented completion theory is very well-behaved and extends the completion theory of…

This book presents our case in defense of a constructivist epistemological framework and the use of compatible statistical theory and inference tools. The basic metaphor of decision theory is the maximization of a gambler's expected…

To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…

We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Pi-1-2 and Sigma-1-2 hard, and we…

This paper provides the constructive loop vertex expansion for stable matrix models with (single trace) interactions of arbitrarily high even order in the Hermitian and real symmetric cases. It relies on a new and simpler method which can…

One of the central open questions in bounded arithmetic is whether Buss' hierarchy of theories of bounded arithmetic collapses or not. In this paper, we reformulate Buss' theories using free logic and conjecture that such theories are…

We extend the notion of belief function to the case where the underlying structure is no more the Boolean lattice of subsets of some universal set, but any lattice, which we will endow with a minimal set of properties according to our…