Related papers: Muchnik degrees and cardinal characteristics

Let $\phi(x) = x^d + c$ be an integral polynomial of degree at least 2, and consider the sequence $(\phi^n(0))_{n=0}^\infty$, which is the orbit of $0$ under iteration by $\phi$. Let $D_{d,c}$ denote the set of positive integers $n$ for…

We determine the cardinality of the value sets of bivariate Chebyshev maps over finite fields. We achieve this using the dynamical properties of these maps and the algebraic expressions of their fixed points in terms of roots of unity.

The named space denoted by $V_{pq}^k$ consists of $L_q$ functions on $[0,1)^d$ of bounded $p$-variation of order $k\in\mathbb N$. It generalizes the classical spaces $V_p(0,1)$ ($=V_{p\infty}^1$) and $BV([0,1)^d)$ ($V_{1q}^1$ where…

The $k$-tuple domination problem, for a fixed positive integer $k$, is to find a minimum sized vertex subset such that every vertex in the graph is dominated by at least $k$ vertices in this set. The $k$-tuple domination is NP-hard even for…

We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple…

This paper introduces the \emph{$d$-distance $b$-matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges, an integer $d\in\mathbb{Z}_+$ and a degree bound function…

$\renewcommand{\Re}{\mathbb{R}}$Given a set $P$ of $n$ points in $\Re^d$, consider the problem of computing $k$ subsets of $P$ that form clusters that are well-separated from each other, and each of them is large (cardinality wise). We…

Let K be an algebraically closed field of characteristic 0. Following Medvedev-Scanlon, a polynomial of degree d > 1 is said to be disintegrated if neither f nor -f is linearly conjugate to x^d or T_d(x) where T_d is the Chebyshev…

Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit a polynomial-time computable $(1+\varepsilon, \dots ,…

Let, J, be an m-by-m-signature matrix and let D be the open unit disk in the complex plane. Denote by P{J,0}(D) the class of all meromorphic m-by-m-matrix-valued functions, f, in D which are holomorphic at 0 and take J-contractive values at…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…

The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…

In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin,…

Let $K(\gamma)$ be the weakly equilibrium Cantor type set introduced in [10]. It is proven that the monic orthogonal polynomials $Q_{2^s}$ with respect to the equilibrium measure of $K(\gamma)$ coincide with the Chebyshev polynomials of the…

Let $Y$ be a metrizable space containing at least two points, and let $X$ be a $Y_{\mathcal{I}}$-Tychonoff space for some ideal $\mathcal{I}$ of compact sets of $X$. Denote by $C_{\mathcal{I}}(X,Y)$ the space of continuous functions from…

Let (\Omega,\mu) be a finite measure space, X a Banach space, and let 1\le p<\infty. The aim of this paper is to give an elementary proof of the Diaz--Mayoral theorem that a subset V of L^p(\mu;X) is relatively compact if and only if it is…

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…

In this paper, we prove that if $\kappa$ is a almost strongly compact cardinal, then any MAEC with L\"owenheim-Skolem number below $\kappa$ is $<\kappa$-d-tame.

The Closest Vector Problem (CVP) is a computational problem in lattices that is central to modern cryptography. The study of its fine-grained complexity has gained momentum in the last few years, partly due to the upcoming deployment of…