Related papers: Muchnik degrees and cardinal characteristics

With increasing use of digital control it is natural to view control inputs and outputs as stochastic processes assuming values over finite alphabets rather than in a Euclidean space. As control over networks becomes increasingly common,…

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…

A topological space $Y$ is said to have (AEEP) if the following condition is fulfilled. Whenever $(X,\mathfrak{M})$ is a measurable space and $f, g: X \to Y$ are two measurable functions, then the set $\Delta(f,g) = \{x \in X:\ f(x) =…

Let $k$ be a fixed integer. We determine the complexity of finding a $p$-partition $(V_1, \dots, V_p)$ of the vertex set of a given digraph such that the maximum out-degree of each of the digraphs induced by $V_i$, ($1\leq i\leq p$) is at…

We study the classic Max-Cut problem under multiple cardinality constraints, which we refer to as the Constrained Max-Cut problem. Given a graph $G=(V, E)$, a partition of the vertices into $c$ disjoint parts $V_1, \ldots, V_c$, and…

For each ${\small b\in(0, \infty)}$ we intend to generate a decreasing sequence of subsets $(\mathcal{Y}_{b}^{(n)}) \subset Y_{\mathrm{conc}}$ depending on $b$ such that whenever $n\in\mathbb{N}$, then $\mathcal{A}\cap\mathcal{Y}_{b}^{(n)}%…

We show in detail that every compact countable subset of a metric space is homeomorphic to a countable ordinal number, which extends a result given by Mazurkiewicz and Sierpinski for finite-dimensional Euclidean spaces. In order to achieve…

Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…

We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…

We prove that if $p\ge 1$ and $0< r\le p$ then the sequence $\binom{mp+r}{m}\frac{r}{mp+r}$, $m=0,1,2,...$, is positive definite, more precisely, is the moment sequence of a probability measure $\mu(p,r)$ with compact support contained in…

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…

Let $P^{k}(n,p) $ be the set of all real polynomial map germs $f = ( f_1 , ..., f_p ) : (\mathbb{R}^{n},0) \rightarrow (\mathbb{R}^{p},0)$ with degree of $f_1 , ...,f_p$ less than or equal to $ k \in \mathbb{N}$. The main result of this…

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

This paper describes a purely functional library for computing level-$p$-complexity of Boolean functions, and applies it to two-level iterated majority. Boolean functions are simply functions from $n$ bits to one bit, and they can describe…

Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. The cardinality of a smallest super…

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

A topological space X$ has the Frechet-Urysohn property if for each subset A of X and each element x in the closure of A, there exists a countable sequence of elements of A which converges to x. Reznichenko introduced a natural…