Related papers: Definable selector for $\bf\Delta^0_2$ sets modulo…

Variable-length splittable codes are derived from encoding sequences of ordered integer pairs, where one of the pair's components is upper bounded by some constant, and the other one is any positive integer. Each pair is encoded by the…

In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…

In a perfect category every object has a minimal projective resolution. We give a criterion for the category of modules over a categorygraded algebra to be perfect.

We introduce the definition of conformable derivative on time scales and develop its calculus. Fundamental properties of the conformable derivative and integral on time scales are proved. Linear conformable differential equations with…

A clonoid is a set of finitary functions from a set $A$ to a set $B$ that is closed under taking minors. Hence clonoids are generalizations of clones. By a classical result of Post, there are only countably many clones on a 2-element set.…

We construct (in significant generality) moduli spaces representing the functor of morphisms from a scheme into a solvable algebraic group.

All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…

A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…

There has been growing interest in developing accurate models that can also be explained to humans. Unfortunately, if there exist multiple distinct but accurate models for some dataset, current machine learning methods are unlikely to find…

A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.

A deflatable permutation class is one in which the simple permutations are contained in a proper subclass. Deflatable permutation classes are often easier to describe and enumerate than non-deflatable ones. Some theorems which guarantee…

We describe the ind- and pro- categories of the category of definable sets, in some first order theory, in terms of points in a sufficiently saturated model.

In this paper, we classify all finite irreducible conformal modules over a class of Lie conformal algebras $\mathcal{W}(b)$ with $b\in\mathbb{C}$ related to the Virasoro conformal algebra. Explicitly, any finite irreducible conformal module…

Let $K$ be a subfield of $\mathbb{R}$. The theory of $\mathbb{R}$ viewed as an ordered $K$-vector space and expanded by a predicate for $\mathbb{Z}$ is decidable if and only if $K$ is a real quadratic field.

We construct a dg-enhancement of KLRW algebras that categorifies the tensor product of a universal $\mathfrak{sl}_2$ Verma module and several integrable irreducible modules. When the integrable modules are two-dimensional, we construct a…

Let $\{a_1,\dots,a_p\}$ be the minimal generating set of a numerical monoid $S$. For any $s\in S$, its Delta set is defined by $\Delta(s)=\{l_{i}-l_{i-1}|i=2,\dots,k\}$ where $\{l_1<\dots<l_k\}$ is the set $\{\sum_{i=1}^px_i\,|\,…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.

We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space $X$. When $X$ is second countable, we observe that the…

We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.