Related papers: Solovay functions and their applications in algori…
It is known since the work of [AA14] that for any permutation symmetric function $f$, the quantum query complexity is at most polynomially smaller than the classical randomized query complexity, more precisely that $R(f) =…
Aaronson and Ambainis (SICOMP `18) showed that any partial function on $N$ bits that can be computed with an advantage $\delta$ over a random guess by making $q$ quantum queries, can also be computed classically with an advantage $\delta/2$…
Kolmogorov suggested to measure quality of a statistical hypothesis $P$ for a data $x$ by two parameters: Kolmogorov complexity $C(P)$ of the hypothesis and the probability $P(x)$ of $x$ with respect to $P$. P. G\'acs, J. Tromp, P.M.B.…
Motivated by their role for integrality and integrability in topological string theory, we introduce the general mathematical notion of "s-functions" as integral linear combinations of poly-logarithms. 2-functions arise as disk amplitudes…
We investigate the dividing line between classical and quantum computational power in estimating properties of matrix functions. More precisely, we study the computational complexity of two primitive problems: given a function $f$ and a…
The notion of monogenic (or regular) functions, which is a correspondence of holomorphic functions, has been studied extensively in hypercomplex analysis, including quaternionic, octonionic, and Clifford analysis. Recently, the concept of…
Diverse applications of Kolmogorov complexity to learning [CIKK16], circuit complexity [OPS19], cryptography [LP20], average-case complexity [Hir21], and proof search [Kra22] have been discovered in recent years. Since the running time of…
Every K-trivial set is computable from an incomplete Martin-L\"of random set, i.e., a Martin-L\"of random set that does not compute 0'.
Partial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial…
Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…
The main subject of the paper is everywhere complex sequences. An everywhere complex sequence is a sequence that does not contain substrings of Kolmogorov complexity less than $\alpha n-O(1)$ where $n$ is the length of substring and…
Given a hereditary class $\mathcal{F}$ of finite relational structures, the rank function $\mathsf{rk}:\sigma\mathcal{F}\to\omega_1\cup\{\infty\}$, introduced by Kubi\'{s} and Shelah, measures how far a countable structure is from being…
Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller…
This note is purely expository. We show how in the course of the Kolmogorov-Arnold solution of Hilbert's 13-th problem on superpositions there appeared the notion of a basic embedding. A subset K of R^2 is {\it basic} if for each continuous…
The backward uniqueness of the Kolmogorov operator $L=\sum_{i,k=1}^n\partial_{x_i}(a_{i,k}(x,t)\partial_{x_k})+\sum_{l=1}^m x_l\partial_{y_l}-\partial_t$, was proved in this paper. We obtained a weak Carleman inequality via Littlewood-Paley…
Under a certain condition, we find the explicit formulas for the trace functions of certain intertwining operators among gl(n)-modules, introduced by Etingof in connection with the solutions of the Calogero-Sutherland model. If n=2, the…
In this paper we study subsequences of random numbers. In Kamae (1973), selection functions that depend only on coordinates are studied, and their necessary and sufficient condition for the selected sequences to be normal numbers is given.…
Classical parking functions are a generalization of permutations that appear in many combinatorial structures. Prime parking functions are indecomposable components such that any classical parking function can be uniquely described as a…
In this paper we present results on asymptotic characteristics of multivariate function classes in the uniform norm. Our main interest is the approximation of functions with mixed smoothness parameter not larger than $1/2$. Our focus will…