Related papers: Online premeans and their computation complexity

Family of quasi-arithmetic means has a natural, partial order (point-wise order) $A^{[f]}\le A^{[g]}$ if and only if $A^{[f]}(v)\le A^{[g]}(v)$ for all admissible vectors $v$ ($f,\,g$ and, later, $h$ are continuous and monotone and defined…

Based on collection of bijections, variable and function are extended into ``isomorphic variable'' and ``dual-variable-isomorphic function'', then mean values such as arithmetic mean and mean of a function are extended to ``isomorphic…

In this paper we characterize generalized quasi-arithmetic means, that is means of the form $M(x_1,...,x_n):=(f_1+...+f_n)^{-1}(f_1(x_1)+...+f_n(x_n))$, where $f_1,...,f_n:I\to\mathbb{R}$ are strictly increasing and continuous functions.…

We continue the investigation of algorithmically random functions and closed sets, and in particular the connection with the notion of capacity. We study notions of random continuous functions given in terms of a family of computable…

Each family $\mathcal{M}$ of means has a natural, partial order (point-wise order), that is $M \le N$ iff $M(x) \le N(x)$ for all admissible $x$. In this setting we can introduce the notion of interval-type set (a subset $\mathcal{I}…

For a family of quasi-arithmetic means satisfying certain smoothness condition we majorize the speed of convergence of the iterative sequence of self-mappings having a mean on each entry, described in the definition of Gaussian product, to…

Given two continuous functions $f,g:I\to\mathbb{R}$ such that $g$ is positive and $f/g$ is strictly monotone, a measurable space $(T,A)$, a measurable family of $d$-variable means $m: I^d\times T\to I$, and a probability measure $\mu$ on…

For each positive integer n this paper considers a one-parameter family of complex-valued measures on the symmetric group S_n, depending on a complex parameter z. For parameter values z=p^f a prime power, this measure describes splitting…

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) =…

On the set $\mathcal M$ of mean functions the symmetric mean of $M$ with respect to mean $M_0$ can be defined in several ways. The first one is related to the group structure on $\mathcal M$ and the second one is defined trough Gauss'…

We characterize the streaming space complexity of every symmetric norm $l$ (a norm on $\mathbb{R}^n$ invariant under sign-flips and coordinate-permutations), by relating this space complexity to the measure-concentration characteristics of…

In this note, we introduce a family of "power sum" kernels and the corresponding Gaussian processes on symmetric groups $\mathrm{S}_n$. Such processes are bi-invariant: the action of $\mathrm{S}_n$ on itself from both sides does not change…

We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…

For a family of continuous functions $f_1,f_2,\dots \colon I \to \mathbb{R}$ ($I$ is a fixed interval) with $f_1\le f_2\le \dots$ define a set $$ I_f:=\big\{x \in I \colon \lim_{n \to \infty} f_n(x)=+\infty\big\}.$$ We study the properties…

We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a…

We briefly describe some well-known means and their properties, focusing on the relationship with integer sequences. In particular, the harmonic numbers, deriving from the harmonic mean, motivate the definition of a new kind of mean that we…

Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…

A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…

The aim of this paper is to characterize the so-called $\sigma$-balancing property in the class of generalized quasi-arithmetic means. In general, the question is whether those elements of a given family of means that possess this property…

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…