Related papers: A lightface analysis of the differentiability rank

Let R be a ring and G a group. An R-module A is said to be artinian-by-(finite rank) if TorR(A) is artinian and A/TorR(A) has finite R-rank. The authors study ZG-modules A such that A/CA(H) is artinian-by-(finite rank) (as a Z-module) for…

Validation is a major challenge in differentiable programming. The state of the art is based on algorithmic differentiation. Consistency of first-order tangent and adjoint programs is defined by a well-known first-order differential…

In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

Martin's Conjecture is a proposed classification of the definable functions on the Turing degrees. It is usually divided into two parts, the first of which classifies functions which are not above the identity and the second of which…

We consider the problem of classifying (possibly noncommutative) R-algebras of low rank over an arbitrary base ring R. We first classify algebras by their degree, and we relate the class of algebras of degree 2 to algebras with a standard…

Dimension reduction is often necessary in functional data analysis, with functional principal component analysis being one of the most widely used techniques. A key challenge in applying these methods is determining the number of…

We calculate zeta functions for certain orders of rank $3$ defined by standard integral table algebras and integral fusion rings that have irrational-valued irreducible characters. The calculations are obtained from explicit calculations of…

We develop a systematic algorithmic framework that unites global and local classification problems using index sets. We prove that the classification problem for continuous (binary) regular functions among almost everywhere linear,…

We study rank functions on a triangulated category $\mathcal{C}$ via its abelianisation $\operatorname{mod}\mathcal{C}$. We prove that every rank function on $\mathcal{C}$ can be interpreted as an additive function on…

We show that there exists a separable, nuclear C*-algebra with real rank zero and trivial K-theory such that its multiplier and corona algebra have real rank one. This disproves two conjectures of Brown and Pedersen. We also compute the…

The Terwilliger algebras of asymmetric association schemes of rank $3$, whose nonidentity relations correspond to doubly regular tournaments, are shown to have thin irreducible modules, and to always be of dimension $4k+9$ for some positive…

For a real-valued non-negative and log-concave function we introduce a notion of difference function; the difference function represents a functional analog on the difference body of a convex body. We prove a sharp inequality which bounds…

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

Scientific studies often require the precise calculation of derivatives. In many cases an analytical calculation is not feasible and one resorts to evaluating derivatives numerically. These are error-prone, especially for higher-order…

In this paper we develop a technique for proving determinacy of classes of the form $\omega^2-\Pi^1_1+\Gamma$ (a refinement of the difference hierarchy on the co-analytic sets lying between $\omega^2-\Pi^1_1$ and $(\omega^2+1)-\Pi^1_1$)…

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

In classical function theory, a function is holomorphic if and only if it is complex analytic. For higher dimensional spaces it is natural to work in the context of Clifford algebras. The structures of these algebras depend on the parity of…