Related papers: Effective MC-finiteness

We study multiple simultaneous cut events for k-out-of-n:F and linear consecutive k-out-of-n:F systems in which each component has a constant failure probability. We list the multicuts of these systems and describe the structural…

The Functional Machine Calculus (FMC), recently introduced by the authors, is a generalization of the lambda-calculus which may faithfully encode the effects of higher-order mutable store, I/O and probabilistic/non-deterministic input.…

Let [\theta] denote the integer part and {\theta} the fractional part of the real number \theta. For \theta > 1 and {\theta^{1/n}} \neq 0, define M_{\theta}(n) = [1/{\theta^{1/n}}]. The arithmetic function M_{\theta}(n) is eventually…

A countable group $G$ is said to be \emph{matricial field} (MF) if it admits a strongly converging sequence of approximate homomorphisms into matrices; i.e, the norms of polynomials converge to those in the left regular representation. $G$…

Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf…

Let $M(n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M(n)$ has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \to \infty$ is not known…

We consider the computation of the permanent of a binary n by n matrix. It is well- known that the exact computation is a #P complete problem. A variety of Markov chain Monte Carlo (MCMC) computational algorithms have been introduced in the…

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…

Let $\mathcal X$ be an infinite locally compact separable metric space with metric $\rho$ and let $f : \mathcal X \longrightarrow \mathcal X$ be a continuous weakly mixing map. Let $\beta = \sup \big\{ \rho(x, y): \{x, y \} \subset \mathcal…

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

Consider a_1,a_2,...,a_n, arbitrary elements of R. We characterize those real functions f that decompose into the sum of a_j-periodic functions, i.e., f=f_1+...+f_n with D_{a_j}f(x):=f(x+a_j)-f(x)=0. We show that f has such a decomposition…

We determine continuous bijections $f$, acting on a real interval into itself, whose $k$-fold iterate is the quasi-arithmetic mean of all its subsequent iterates from $f^0$ up to $f^n$ (where $0\le k\le n$). Namely, we prove that if at most…

We construct a symmetric invertible binary pairing function $F(m,n)$ on the set of positive integers with a property of $F(m,n)=F(n,m)$. Then we provide a complete proof of its symmetry and bijectivity, from which the construction of…

A sequence of functions {f_n(q)}_{n=1}^{\infty} satisfies the functional equation for multiplication of quantum integers if f_{mn}(q) = f_m(q)f_n(q^m) for all positive integers m and n. This paper describes the structure of all sequences of…

Let $f\colon\mathbb{N}\rightarrow\mathbb{N}_0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p^{\alpha})<p^{\alpha}$ and $f(p)\vert f(p^{\alpha})$. Suppose also that any prime that…

Let $S = \{q_1, \ldots , q_s\}$ be a finite, non-empty set of distinct prime numbers. For a non-zero integer $m$, write $m = q_1^{r_1} \ldots q_s^{r_s} M$, where $r_1, \ldots , r_s$ are non-negative integers and $M$ is an integer relatively…

A subset $A$ of a topological space $X$ is called relatively functionally countable (RFC) in $X$, if for each continuous function $f : X \to \mathbb{R}$ the set $f[A]$ is countable. We prove that all RFC subsets of a product…

We consider Diophantine inequalities of the kind |f(x)| \le m, where F(X) \in Z[X] is a homogeneous polynomial which can be expressed as a product of d homogeneous linear forms in n variables with complex coefficients and m\ge 1. We say…

Let $D: \mathbb{Z}_m^n \to \mathbb{Z}_m^n$ be defined so \[D(x_1, x_2, ..., x_n)=(x_1+x_2 \; \text{mod} \; m, x_2+x_3 \; \text{mod} \; m, ..., x_n+x_1 \; \text{mod} \; m).\] $D$ is known as the Ducci function and for $\mathbf{u} \in…

We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…