English
Related papers

Related papers: Kolmogorov Complexity and Solovay Functions

200 papers

We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function is. This notion can be viewed as an extension of both BSS…

Computational Complexity · Computer Science 2007-05-23 Mark Braverman

The aim of this paper is to show Cauchy-Kowalevski and Holmgren type theorems with infinite number of variables. We adopt von Koch and Hilbert's definition of analyticity of functions as monomial expansions. Our Cauchy-Kowalevski type…

Functional Analysis · Mathematics 2019-05-07 Jiayang Yu , Xu Zhang

TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set. If the given sequence is drawn i.i.d. and the probability mass function involved (the target)…

Machine Learning · Computer Science 2014-07-14 Paul M. B. Vitanyi , Nick Chater

Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing…

Symbolic Computation · Computer Science 2009-04-19 Jaime Gutierrez , Rosario Rubio , David Sevilla

Let $S^{*}(1-b)$ ($b \not= 0$ complex) denote the class of functions $f(z)=z+\alpha_{2}z^{2}+...$ analytic in $D={z \mid | z | < 1}$ which satisfies,for $z=e^{i\theta} \in D$, $(f(z)/z)\not= 0$ in D, and $Re \Biggr [ 1+ {1 \over b} \Biggr…

Complex Variables · Mathematics 2016-09-07 Yasar Polatoglu , Metin Bolcal , Arzu Sen

We describe algebraic curves $ X : F(x, y) = 0 $ defined over $\overline{\mathbb{Q}}$ that satisfy the following property: there exist a number field $k$ and an infinite set $S \subset k$ such that, for every $y \in S$, the roots of the…

Number Theory · Mathematics 2025-08-18 Fedor Pakovich

Let $f$ be a transcendental meromorphic function in the complex plane $\mathbb{C}$, and $a$ be a nonzero complex number . We give quantitative estimates for the characteristic function $T(r,f)$ in terms of $N(r,1/(f^l(f^{(k)})^n-a))$, for…

Complex Variables · Mathematics 2014-05-16 Jiang Yan , Huang Bin

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

Combinatorics · Mathematics 2026-01-05 Robert Coulter , Steven Senger

The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…

For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…

Logic · Mathematics 2013-10-23 Ivan Georgiev , Dimiter Skordev

In this paper, among other things, we prove that any subset of $\overline{\mathbb{Q}}^m$ (closed under complex conjugation and which contains the origin) is the exceptional set of uncountable many transcendental entire functions over…

Number Theory · Mathematics 2024-11-20 Diego Alves , Jean Lelis , Diego Marques , Pavel Trojovský

We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…

Number Theory · Mathematics 2017-08-24 Yann Bugeaud , Dong Han Kim

Let $ K(X_1, \ldots, X_n)$ and $H(X_n | X_{n-1}, \ldots, X_1)$ denote the Kolmogorov complexity and Shannon's entropy rate of a stationary and ergodic process $\{X_i\}_{i=-\infty}^\infty$. It has been proved that \[ \frac{K(X_1, \ldots,…

Information Theory · Computer Science 2017-02-07 Morgane Austern , Arian Maleki

Let $F$ be the set of functions from an infinite set, $S$, to an ordered ring, $R$. For $f$, $g$, and $h$ in $F$, the assertion $f = g + O(h)$ means that for some constant $C$, $|f(x) - g(x)| \leq C |h(x)|$ for every $x$ in $S$. Let $L$ be…

Logic in Computer Science · Computer Science 2007-05-23 Jeremy Avigad , Kevin Donnelly

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

Combinatorics · Mathematics 2013-08-29 Robert Coulter , Steven Senger

In this article, we undertake the study of the function $\mathscr{F}(x;u,v)$, which we refer to as the Herglotz-Zagier-Novikov function. This function appears in Novikov's work on the Kronecker limit formula, which was motivated by Zagier's…

Number Theory · Mathematics 2023-09-20 YoungJu Choie , Rahul Kumar

It is known that all $k$-homogeneous orthogonally additive polynomials $P$ over $C(K)$ are of the form $$ P(x)=\int_K x^k d\mu . $$ Thus $x\mapsto x^k$ factors all orthogonally additive polynomials through some linear form $\mu$. We show…

Functional Analysis · Mathematics 2011-01-13 Daniel Carando , Silvia Lassalle , Ignacio Zalduendo

Here is a sample of the results proved in this paper: Let $f:{\bf R}\to {\bf R}$ be a continuous function, let $\rho>0$ and let $\omega:[0,\rho[\to [0,+\infty[$ be a continuous increasing function such that $\lim_{\xi\to…

Optimization and Control · Mathematics 2022-10-25 Biagio Ricceri

Let X^{(k)}(t) = (X_1(t), ..., X_k(t)) denote a k-vector of i.i.d. random variables, each taking the values 1 or 0 with respective probabilities p and 1-p. As a process indexed by non-negative t, $X^{(k)}(t)$ is constructed--following…

Probability · Mathematics 2009-06-10 Davar Khoshnevisan , David A. Levin , Pedro J. Mendez-Hernandez

For a rational function f we consider the norm of the derivative with respect to the spherical metric and denote by K(f) the supremum of this norm. We give estimates of this quantity K(f) both for an individual function and for sequences of…

Dynamical Systems · Mathematics 2015-12-18 Matthew Barrett , Alexandre Eremenko