Related papers: Generalized low solution of $\mathsf{RT}_k^1$ prob…
Random constraint satisfaction problems (CSPs) such as random $3$-SAT are conjectured to be computationally intractable. The average case hardness of random $3$-SAT and other CSPs has broad and far-reaching implications on problems in…
We present a unified framework to study threshold functions for the existence of solutions to linear systems of equations in random sets which includes arithmetic progressions, sum-free sets, $B_{h}[g]$-sets and Hilbert cubes. In…
With the aim of understanding the localization topology correspondence for non periodic gapped quantum systems, we investigate the relation between the existence of an algebraically well-localized generalized Wannier basis and the…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
In this paper we prove the almost sure existence of global weak solution to the 3D incompressible Navier-Stokes Equation for a set of large data in $\dot{H}^{-\alpha}(\mathbb{R}^{3})$ or $\dot{H}^{-\alpha}(\mathbb{T}^{3})$ with…
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive integer k, there exists a linear equation that is (k-1)-regular…
A generalized 1-in-3SAT problem is defined and found to be in complexity class P when restricted to a certain subset of CNF expressions. In particular, 1-in-kSAT with no restrictions on the number of literals per clause can be decided in…
We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…
In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of…
One proves the existence and uniqueness in $(L^p(\mathbb{R}^3))^3$, $\frac{3}{2}<p<2$, of a global mild solution to random vorticity equations associated to stochastic $3D$ Navier-Stokes equations with linear multiplicative Gaussian noise…
A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory,…
We consider a natural generalization of the Nagell-Ljunggren equation to the case where the qth power of an integer y, for q >= 2, has a base-b representation that consists of a length-l block of digits repeated n times, where n >= 2.…
We compute the reductions of irreducible crystalline two-dimensional representations of $G_{\mathbf{Q}_p}$ of slope 1, for primes $p \geq 5$, and all weights. We describe the semisimplification of the reductions completely. In particular,…
The coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content. A coding theorem for resource-bounded Kolmogorov complexity is the key to…
We propose a general error analysis related to the low-rank approximation of a given real matrix in both the spectral and Frobenius norms. First, we derive deterministic error bounds that hold with some minimal assumptions. Second, we…
Parameter identification problems typically consist of a model equation, e.g. a (system of) ordinary or partial differential equation(s), and the observation equation. In the conventional reduced setting, the model equation is eliminated…
In this paper, we study the global regularity of strong solution to the Cauchy problem of 3D incompressible Navier-Stokes equations with large data and non-zero force. We prove that the strong solution exists globally for $\nabla u\in…
In the All-Reduce problem, each one of the K nodes holds an input and wishes to compute the sum of all K inputs through a communication network where each pair of nodes is connected by a parallel link with arbitrary bandwidth. The…
We study small non-trivial solutions of quadratic congruences of the form $x_1^2+\alpha_2x_2^2+\alpha_3x_3^2\equiv 0 \bmod{q}$, with $q$ being an odd natural number, in an average sense. This extends previous work of the authors in which…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…