Related papers: Muchnik degrees and cardinal characteristics
Let $\mathcal{P}$ and $\mathbb{N}$ be the sets of all primes and natural numbers, respectively. In this article, it is proved that there has a positive lower density of the natural numbers which can be represented by the form…
Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…
Capacitary measures form a class of measures that vanish on sets of capacity zero. These measures are compact with respect to so-called $\gamma$-convergence, which relates a sequence of measures to the sequence of solutions of relaxed…
We construct a new class of finite dimensional indecomposable representations of simple superalgebras which may explain, in a natural way, the existence of the heavier elementary particles. In type I Lie superalgebras sl(m/n) and osp(2/2n),…
Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequence of dominating sets of $G$ between $D_s$ and $D_t$ such…
It is a classical result that every subharmonic function, defined and ${\mathcal{L}}^p$-integrable for some $p$, $0<p<+\infty$, on the unit disk $\mathbb{D}$ of the complex plane ${\mathbb{C}}$ is for almost all $\theta$ of the form $o((1-|…
We study expansions of the Weak Monadic Second Order theory of (N,<) by cardinality relations, which are predicates R(X1,...,Xn) whose truth value depends only on the cardinality of the sets X1, ...,Xn. We first provide a (definable)…
Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic…
Let $k$ be a field of characteristic $p>0$, which has infinitely many discrete valuations. We show that every finite embedding problem for $\Gal(k)$ with finitely many prescribed local conditions, whose kernel is a $p$-group, is properly…
We obtain an estimate on the average cardinality of the value set of any family of monic polynomials of Fq[T] of degree d for which s consecutive coefficients a_{d-1},...,a_{d-s} are fixed. Our estimate asserts that…
The classical Monge-Kantorovich (MK) problem as originally posed is concerned with how best to move a pile of soil or rubble to an excavation or fill with the least amount of work relative to some cost function. When the cost is given by…
A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\geq 1$, if $G$ has a dominating set of size…
For a graph $G=(V,E)$, a set $D\subseteq V$ is called a \emph{disjunctive dominating set} of $G$ if for every vertex $v\in V\setminus D$, $v$ is either adjacent to a vertex of $D$ or has at least two vertices in $D$ at distance $2$ from it.…
The problem of graphical model selection is to correctly estimate the graph structure of a Markov random field given samples from the underlying distribution. We analyze the information-theoretic limitations of the problem of graph…
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…
This is a continuation of the paper [J. Symb. Log. 87 (2022), 1065--1092]. For an ideal $\mathcal{I}$ on $\omega$ we denote $\mathcal{D}_{\mathcal{I}}=\{f\in\omega^\omega: f^{-1}[\{n\}]\in\mathcal{I} \text{ for every $n\in \omega$}\}$ and…
We study the index of nilpotency relative to certain Hecke operators in spaces of modular forms with integer weight and level $N$ with integer coefficients modulo primes $p$ for $(p, N) \in \{(3, 1), (5, 1), (7, 1), (3, 4)\}$. In these…
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…
We establish Sobolev-Poincar\'e inequalities for piecewise $W^{1,p}$ functions over families of fairly general polytopic (thence also shape-regular simplicial and Cartesian) meshes in any dimension; amongst others, they cover the case of…
We consider the following variants of the classical minimum dominating set problem in graphs: locating-dominating set, locating total-dominating set and open locating-dominating set. All these problems are known to be hard for general…