Related papers: Definable selector for $\bf\Delta^0_2$ sets modulo…
We give a complete list of indecomposable exact module categories over the finite tensor category $\mathrm{Rep}(u_q(\mathfrak{sl}_2))$ of representations of the small quantum group $u_q(\mathfrak{sl}_2)$, where $q$ is a root of unity of odd…
We introduce the notion of smooth cell complexes and its subclass consisting of gathered cell complexes within the category of diffeological spaces (cf. Definitions 1 and 3). It is shown that the following hold. (1) With respect to the…
A differential category is an additive symmetric monoidal category, that is, a symmetric monoidal category enriched over commutative monoids, with an algebra modality, axiomatizing smooth functions, and a deriving transformation on this…
We develop a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational endpoints. Internally, such sets…
This paper provides a complete suite of axioms for a version of set theory that I call Explication. Explication borrows from the two most prominent existing systems of set theory. Explication starts with class variables. After several…
The column number question asks for the maximal number of columns of an integer matrix with the property that all its rank size minors are bounded by a fixed parameter $\Delta$ in absolute value. Polynomial upper bounds have been proved in…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
Let $\det_2(A)$ be the block-wise determinant (partial determinant). We consider the condition for completing the determinant $\det(\det_2(A)) = \det(A),$ and characterize the case for an arbitrary Kronecker product $A$ of matrices over an…
Declarative modeling uses symbolic expressions to represent models. With such expressions one can formalize high-level mathematical computations on models that would be difficult or impossible to perform directly on a lower-level simulation…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new…
We first show that in the function realizability topos every metric space is separable, and every object with decidable equality is countable. More generally, working with synthetic topology, every $T_0$-space is separable and every…
In this note we obtain defining equations of modular curves $X_0(2^{2n})$. The key ingredient is a recursive formula for certain generators of the function fields on $X_0(2^{2n})$.
We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…
A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive…
In this paper we give elementary conditions completely characterising when the theory of modules of a Pr\"ufer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is…
A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…
A calcular algebra is a subalgebra of $H^\infty(\Omega)$ with norm given by $\| \phi \| = \sup \| \phi(T) \|$ as $T$ ranges over a given class of commutative $d$-tuples of operators with Taylor spectrum in $\O$. We discuss what algebras…
For an exact category having enough projective objects, we establish a bijection between thick subcategories containing the projective objects and thick subcategories of the stable derived category. Using this bijection we classify thick…
Arbitrarily many pairwise inequivalent modular categories can share the same modular data. We exhibit a family of examples that are module categories over twisted Drinfeld doubles of finite groups, and thus in particular integral modular…