Related papers: Sketches for arithmetic universes
Inspired by the theory of classifying topoi for geometric theories, we define rounded sketches and logoi and provide the notion of classifying logos for a rounded sketch. Rounded sketches can be used to axiomatise all the known fragments of…
We develop differential calculus and gauge theory on a finite set G. An elegant formulation is obtained when G is supplied with a group structure and in particular for a cyclic group. Connes' two-point model (which is an essential…
We define the notion of subspace of an arithmetic universe by using its internal dependent type theory.
We define the notion of subspace of an arithmetic universe by using its internal dependent type theory.
We study the two-player communication problem of determining whether two vertices $x, y$ are nearby in a graph $G$, with the goal of determining the graph structures that allow the problem to be solved with a constant-cost randomized…
Computer-aided design (CAD) is the most widely used modeling approach for technical design. The typical starting point in these designs is 2D sketches which can later be extruded and combined to obtain complex three-dimensional assemblies.…
A speculative overview of a future topic of research. The paper is a collection of ideas concerning two related areas: 1) Graph computation machines ("computing with graphs"). This is the class of models of computation in which the state of…
A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and…
Shape grammars compute over shapes which are defined in the universe $U^*$. Shapes in the universe $U^*$ are analogous to line drawings that can be physically realized in the plane. Any shape is embedded or contained in an arrangement of…
We propose a theory for modeling concepts that uses the state-context-property theory (SCOP), a generalization of the quantum formalism, whose basic notions are states, contexts and properties. This theory enables us to incorporate context…
Sketches have been used to conceptualise and depict visual objects from pre-historic times. Sketch research has flourished in the past decade, particularly with the proliferation of touchscreen devices. Much of the utilisation of sketch has…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
In the finite-dimensional case, we present a new approach to the theory of cones with a mapping cone symmetry, first introduced by St{\o}rmer. Our method is based on a definition of an inner product in the space of linear maps between two…
Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories, which can be made all-loop finite, both in the dimensionless (gauge and Yukawa couplings) and dimensionful (soft supersymmetry breaking terms) sectors. This…
We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…
We study the possibility of applying a finite-dimensionality argument in order to address parts of the Baum-Connes conjecture for finitely generated linear groups. This gives an alternative approach to the results of Guentner, Higson, and…
Sketch2Prototype is an AI-based framework that transforms a hand-drawn sketch into a diverse set of 2D images and 3D prototypes through sketch-to-text, text-to-image, and image-to-3D stages. This framework, shown across various sketches,…
Several machine learning models are defined for inputs of any size, such as graphs with different numbers of nodes and point clouds containing varying numbers of points. The universality properties of such any-dimensional models remain…
Partial descriptions of the Universe are presented in the form of linear equations considered in the free (full, super) Fock space. The universal properties of these equations are discussed. The closure problem caused by computational and…