相关论文: Variants of Solovay reducibility

The theory of random real numbers is exceedingly well-developed, and fascinating from many points of view. It is also quite challenging mathematically. The present notes are intended as no more than a gateway to the larger theory. They…

We establish general versions of a variety of results for quasiconvex, lower-semicontinuous, and law-invariant functionals. Our results extend well-known results from the literature to a large class of spaces of random variables. We…

We generalise the randomness test definitions in the literature for both the Martin-L\"of and Schnorr randomness of a series of binary outcomes, in order to allow for interval-valued rather than merely precise forecasts for these outcomes,…

The term translationese has been used to describe the presence of unusual features of translated text. In this paper, we provide a detailed analysis of the adverse effects of translationese on machine translation evaluation results. Our…

This paper studies the multivariate approximation of functions in weighted Korobov spaces using multiple rank-1 lattice rules. It has been shown by K\"{a}mmerer and Volkmer (2019) that algorithms based on multiple rank-1 lattices achieve…

We revisit random search for stochastic optimization, where only noisy function evaluations are available. We show that the method works under weaker smoothness assumptions than previously considered, and that stronger assumptions enable…

This paper is an extended version of our work in \cite{Ca2025}. We extend the concept of effective reducibility between statements of set theory with ordinal Turing machines (OTMs) explored in \cite{Ca2018} for $\Pi_{2}$-statements to…

In this paper, we introduce a new semi-discrete modulus of smoothness, which generalizes the definition given by Kolomoitsev and Lomako (KL) in 2023 (in the paper published in the J. Approx. Theory), and we establish very general one- and…

B\o gvad and H\"agg proved that for a rational function with simple poles, the zeros of successive derivatives accumulate on the Voronoi diagram of the pole set, and the normalized zero-counting measures converge to a canonical probability…

In 1933, G\"odel introduced a provability interpretation of the propositional intuitionistic logic to establish a formalization for the BHK interpretation. He used the modal system, $\mathbf{S4}$, as a formalization of the intuitive concept…

We consider covariance asymptotics for linear statistics of general stationary random measures in terms of their truncated pair correlation measure. We give exact infinite series-expansion formulas for covariance of smooth statistics of…

Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions which are far from linear. Linearity tests were first…

We propose a new variant of Chubanov's method for solving the feasibility problem over the symmetric cone by extending Roos's method (2018) of solving the feasibility problem over the nonnegative orthant. The proposed method considers a…

In this paper, we construct four different theories of integration, two that are for Voevodsky motives, one for mixed $\ell$-adic sheaves, and a fourth theory of integration for rational mixed Hodge structures. We then show that they…

Boyer and Moore have discussed a recursive function that puts conditional expressions into normal form [1]. It is difficult to prove that this function terminates on all inputs. Three termination proofs are compared: (1) using a measure…

Involution words are variations of reduced words for involutions in Coxeter groups, first studied under the name of "admissible sequences" by Richardson and Springer. They are maximal chains in Richardson and Springer's weak order on…

We elaborate the notions of Martin-L\"of and Schnorr randomness for real numbers in terms of uniform distribution of sequences. We give a necessary condition for a real number to be Schnorr random expressed in terms of classical uniform…

This paper studies the limits of recursive classifications in proof theory and program extraction, using the refined $A$-translation as a central example. The refined $A$-translation, due to Berger, Buchholz, and Schwichtenberg, is based on…

In recent years, unified correspondence has been developed as a generalized Sahlqvist theory which applies uniformly to all signatures of normal and regular (distributive) lattice expansions. This includes a general definition of the…

It is well known that if a random vector satisfies a log-Sobolev inequality, all of its marginals have subgaussian tails. In the spirit of the KLS conjecture, we investigate whether this implication can be reversed under a log-concavity…