相关论文: On needed reals

We consider a general regularised interpolation problem for learning a parameter vector from data. The well known representer theorem says that under certain conditions on the regulariser there exists a solution in the linear span of the…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…

Given a set of matrices, it is often of interest to determine the algebra they generate. Here we exploit the concept of the Burnside graph of a set of matrices, and show how it may be used to deduce properties of the algebra they generate.…

We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…

We define the notion of {\em rational presentation of a complete metric space} in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some presentations of the space $\czu$ of uniformly…

Qualitative spatial and temporal reasoning is based on so-called qualitative calculi. Algebraic properties of these calculi have several implications on reasoning algorithms. But what exactly is a qualitative calculus? And to which extent…

Let $S$ be an integral domain with field of fractions $F$ and let $A$ be an $F$-algebra having an $S$-stable basis. We prove the existence of an $S$-subalgebra $R$ of $A$ lying over $S$ whose localization with respect to $S$ is $A$ (we call…

We construct, using mild combinatorial hypotheses, a real Menger set that is not Scheepers, and two real sets that are Menger in all finite powers, with a non-Menger product. By a forcing-theoretic argument, we show that the same holds in…

Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…

Empirical science needs to be based on facts and claims that can be reproduced. This calls for replicating the studies that proclaim the claims, but practice in most fields still fails to implement this idea. When such studies emerged in…

Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…

In this paper, we prove some sufficient conditions for Cohen-Macaulay normal Rees algebras to be $F$-rational. Let $(R,\mathfrak{m})$ be a Gorenstein normal local domain of dimension $d\geq 2$ and of characteristic $p > 0$. Let $I$ be a…

We study partial supersymmetry breaking from ${\cal N}=2$ to ${\cal N}=1$ by adding non-linear terms to the ${\cal N}=2$ supersymmetry transformations. By exploiting the necessary existence of a deformed supersymmetry algebra for partial…

Recent binary representation learning models usually require sophisticated binary optimization, similarity measure or even generative models as auxiliaries. However, one may wonder whether these non-trivial components are needed to…

Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

Some top-down problem specifications, if executed directly, may compute sub-problems repeatedly. Instead, we may want a bottom-up algorithm that stores solutions of sub-problems in a table to be reused. It can be tricky, however, to figure…

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…

The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…