Related papers: A constructive theory of shape
On objects of a triangulated category with a stability condition, we construct a topology.
We combine Homotopy Type Theory with axiomatic cohesion, expressing the latter internally with a version of "adjoint logic" in which the discretization and codiscretization modalities are characterized using a judgmental formalism of "crisp…
We formalize the general principle of significance with respect to binary relations which is a universal tool for description and analysis of various situations in and apart from mathematics. We derive the basic properties and focus on a…
We study a type of object, called a pathway (generalizing pathways in the sense of P. E. Cohen [Proc. Amer. Math. Soc. 74, No. 2 (1979), 318--321]), which is useful for several set-theoretic constructions and whose existence, in a sense,…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We discuss here geometric structures of condensed matters by means of a fundamental topological method. Any geometric pattern can be universally represented by a decomposition space of a topological space consisting of the infinite product…
Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…
We use convex decomposition theory to (1) reprove the existence of a universally tight contact structure on every irreducible 3-manifold with nonempty boundary, and (2) prove that every toroidal 3-manifold carries infinitely many…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
We give necessary and sufficient conditions on a presentable infinity-category C so that families of objects of C form an infinity-topos. In particular, we prove a conjecture of Joyal that this is the case whenever C is stable.
"Theory figures" are a staple of theoretical visualization research. Common shapes such as Cartesian planes and flowcharts can be used not only to explain conceptual contributions, but to think through and refine the contribution itself.…
A class of models intended to be as minimal and structureless as possible is introduced. Even in cases with simple rules, rich and complex behavior is found to emerge, and striking correspondences to some important core known features of…
We here show that the family of finite-dimensional, discrete-time, passive, linear time-invariant systems can be characterized through the structure of maximal, matrix-convex set, closed under multiplication among its elements. Moreover,…
In this paper we will develop an axiomatic foundation for the geometric study of straight edge, protractor, and compass constructions, which while being related to previous foundations, will be the first to have all axioms written and all…
An age-old controversy in mathematics concerns the necessity and the possibility of constructive proofs. The controversy has been rekindled by recent advances which demonstrate the feasibility of a fully constructive mathematics. This…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
In a previous effort [arXiv:1708.05492] we have created a framework that explains why topological structures naturally arise within a scientific theory; namely, they capture the requirements of experimental verification. This is…
We present a theory of information expressed solely in terms of which transformations of physical systems are possible and which are impossible - i.e. in constructor-theoretic terms. Although it includes conjectured laws of physics that are…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…