Related papers: Generalized low solution of $\mathsf{RT}_k^1$ prob…

We consider uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a complete solution for the case in which one resolution class is $K_2$ and…

A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this…

We propose an algorithm for general nonlinear conic programming which does not require the knowledge of the full cone, but rather a simpler, more tractable, approximation of it. We prove that the algorithm satisfies a strong global…

Self-rational maps of generic algebraic K3 surfaces are conjectured to be trivial. We relate this conjecture to a conjecture concerning the irreducibility of the universal Severi varieties parametrizing nodal curves of given genus and…

Considering the three-dimensional incompressible Navier-Stokes equations on the whole space, we address the question: is it possible to infer global regularity of a mild solution from a single approximate solution? Assuming a relatively…

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…

This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a…

Let $X$ be a compact connected strongly pseudoconvex $CR$ manifold of real dimension $2n-1$ in $\mathbb{C}^{N}$. It has been an interesting question to find an intrinsic smoothness criteria for the complex Plateau problem. For $n\ge 3$ and…

Let $V$ be a smooth cubic surface over a $p$-adic field $k$ with good reduction. Swinnerton-Dyer (1981) proved that $R$-equivalence is trivial on $V(k)$ except perhaps if $V$ is one of three special types--those whose $R$-equivalence he…

We show that a suitable weak solution to the incompressible Navier-Stokes equations on ${\mathbb{R}^3\times(-1,1)}$ is regular on $\mathbb{R}^3\times(0,1]$ if $\partial_3 u $ belongs to $M^{2p/(2p-3),\alpha } ((-1,0);L^p (\mathbb{R}^3 ))$…

The goal of this paper is to study when uniform Roe algebras have certain $C^*$-algebraic properties in terms of the underlying space: in particular, we study properties like having stable rank one or real rank zero that are thought of as…

Introducing a new notion of generalized suitable weak solutions, we first prove validity of the energy inequality for such a class of weak solutions to the Navier-Stokes equations in the whole space $\mathbb{R}^n$. Although we need certain…

We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…

We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with…

In this note, we prove that for every integer $d\geq 2$ which is not a prime power, there exists a finite solvable group $G$ such that $d\mid |G|$, $\pi(G)=\pi(d)$ and $G$ has no subgroup of order $d$. We also introduce the CLT-degree of a…

Ramsey's theorem for $n$-tuples and $k$-colors ($\mathsf{RT}^n_k$) asserts that every k-coloring of $[\mathbb{N}]^n$ admits an infinite monochromatic subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and two…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…