English
Related papers

Related papers: Muchnik degrees and cardinal characteristics

200 papers

We consider the set S(n,0) of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ we let $|p|_{0}$ denote the distance from the origin to the zero set of $p'$. We…

Complex Variables · Mathematics 2007-10-25 Julius Borcea

This work is motivated by the papers [EG85] and [Ngu15] in which the following two problems are solved. Let $\mathcal{O}$ is a finitely generated $\mathbb{Z}$-algebra that is an integrally closed domain of characteristic zero, consider the…

Number Theory · Mathematics 2015-09-01 Jason P. Bell , Khoa D. Nguyen

In this paper we design a new primal-dual algorithm for the classic discrete optimization problem of maximizing a monotone submodular function subject to a cardinality constraint achieving the optimal approximation of $(1-1/e)$. This…

Data Structures and Algorithms · Computer Science 2023-11-15 Deeparnab Chakrabarty , Luc Cote

We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…

Combinatorics · Mathematics 2017-03-22 Michael Engen , Vincent Vatter

It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…

Symbolic Computation · Computer Science 2014-02-11 Bernd Bank , Marc Giusti , Joos Heintz , Mohab Safey El Din

The main result of this paper is the proof of the simultaneous consistency, modulo a weakly compact cardinal, of the equality $2^{< \mathfrak{c}} = \mathfrak{c}$ with the following property (*) of partitions of pairs of $\mathfrak{c}$:…

General Topology · Mathematics 2025-12-30 Alan Dow , István Juhász

We introduce statistically $p$-upward quasi-Cauchy sequences, defined by the condition $\lim_{n\to\infty}\frac{1}{n}|\{k\leq n: x_k - x_{k+p}\geq\varepsilon\}|=0$ for every $\varepsilon>0$, and develop the corresponding notions of…

General Topology · Mathematics 2026-02-17 Açıkgöz.

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…

Dynamical Systems · Mathematics 2015-12-15 Nikita Moriakov

For $n\geq 2$, $p\in(1,n)$, the "best $p$-Sobolev inequality" on an open set $\Omega\subset\mathbb{R}^n$ is identified with a family $\Phi_\Omega$ of variational problems with critical volume and trace constraints. When $\Omega$ is bounded…

Analysis of PDEs · Mathematics 2022-06-27 Francesco Maggi , Robin Neumayer , Ignacio Tomasetti

Mariusz Meszka has conjectured that given a prime p=2n+1 and a list L containing n positive integers not exceeding n there exists a near 1-factor in K_p whose list of edge-lengths is L. In this paper we propose a generalization of this…

Combinatorics · Mathematics 2015-03-09 Anita Pasotti , Marco Antonio Pellegrini

We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…

Number Theory · Mathematics 2007-05-23 Wolfgang M. Ruppert

We consider the $k$-Clustering problem, which is for a given multiset of $n$ vectors $X\subset \mathbb{Z}^d$ and a nonnegative number $D$, to decide whether $X$ can be partitioned into $k$ clusters $C_1, \dots, C_k$ such that the cost…

Data Structures and Algorithms · Computer Science 2019-02-25 Fedor V. Fomin , Petr A. Golovach , Kirill Simonov

Consider a d*n matrix A, with d<n. The problem of solving for x in y=Ax is underdetermined, and has infinitely many solutions (if there are any). Given y, the minimum Kolmogorov complexity solution (MKCS) of the input x is defined to be an…

Information Theory · Computer Science 2016-11-17 David Donoho , Hossein Kakavand , James Mammen

We develop a unified second-order parameterized complexity theory for spaces of integrable functions. This generalizes the well-established case of second-order parameterized complexity theory for spaces of continuous functions.…

Computational Complexity · Computer Science 2025-06-16 Aras Bacho , Martin Ziegler

Given a strong limit cardinal $\lambda$ of countable cofinality, we show that if every $\lambda$-coanalytic subset of the generalised Cantor space ${}^{\lambda}2$ has the $\lambda$-$\mathsf{PSP}$, then there is an inner model with…

Logic · Mathematics 2025-04-23 Fernando Barrera , Vincenzo Dimonte , Sandra Müller

We exhibit an algorithm to solve the following extension problem: Given a finite set $E \subset \mathbb{R}^n$ and a function $f: E \rightarrow \mathbb{R}$, compute an extension $F$ in the Sobolev space $L^{m,p}(\mathbb{R}^n)$, $p>n$, with…

Classical Analysis and ODEs · Mathematics 2014-11-10 Charles L. Fefferman , Arie Israel , Garving K. Luli

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…

Logic · Mathematics 2025-02-05 Alexander Van Abel

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

Discrete Mathematics · Computer Science 2010-07-29 Zan Pan

We consider the classical problem of estimating norms of higher order derivatives of algebraic polynomial via the norms of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by A. A.…

Classical Analysis and ODEs · Mathematics 2016-12-01 Oleksiy Klurman