Related papers: On the computational power of $C$-random strings
Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…
For a $C^1_{t,x}$ solution $u$ to the incompressible 3D Euler equations, the helicity $H(u(t))=\int_{\mathbb{T}^3} u \cdot \textrm{curl}\, u$ is constant in time. For general low-regularity weak solutions, it is not always clear how to…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
Suppose $\mathcal{A}$ is a compact normal operator on a Hilbert space $H$ with certain lacunarity condition on the spectrum (which means, in particular, that its eigenvalues go to zero exponentially fast), and let $\mathcal{L}$ be its rank…
We consider quantum Hamiltonians of the form $H = H_0 - U \sum_j \cos(C_j)$ where $H_0$ is a quadratic function of position and momentum variables $\{x_1, p_1, x_2, p_2,...\}$ and the $C_j$'s are linear in these variables. We allow $H_0$…
$H$-Packing is the problem of finding a maximum number of vertex-disjoint copies of $H$ in a given graph $G$. $H$-Partition is the special case of finding a set of vertex-disjoint copies that cover each vertex of $G$ exactly once. Our goal…
We have proved the following Problem:{\it Let $R$ be a $\mathbb{C}$-affine domain, let $T$ be an element in $R \setminus \mathbb{C}$ and let $i : \mathbb{C}[T] \hookrightarrow R$ be the inclusion. Assume that $R/TR \cong_{\mathbb{C}}…
In this paper we consider the $p$-Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$-norm of its Hamming distances to the strings. Specifically, given a set of…
We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on $2^\omega$, the so-called proper sequences. Our main results are as follows: (1) We…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
We define the accumulated spectrogram associated to a locally trace class orthogonal projection operator and to a bounded set using the polar decomposition of its restriction on that set and prove a convergence theorem for accumulated…
We consider the Cauchy problem for the barotropic Euler system coupled to Helmholtz or Poisson equations, in the whole space. We assume that the initial density is small enough, and that the initial velocity is close to some reference…
Given a Hamiltonian that is a sum of commuting few-body terms, the commuting Hamiltonian problem is to determine if there exists a quantum state that is the simultaneous eigenstate of all of these terms that minimizes each term…
The piecewise complexity $h(u)$ of a word is the minimal length of subwords needed to exactly characterise $u$. Its piecewise minimality index $\rho(u)$ is the smallest length $k$ such that $u$ is minimal among its order-$k$ class $[u]_k$…
Although the halting problem is undecidable, imperfect testers that fail on some instances are possible. Such instances are called hard for the tester. One variant of imperfect testers replies "I don't know" on hard instances, another…
For unconstrained control problems, a local convergence rate is established for an $hp$-method based on collocation at the Radau quadrature points in each mesh interval of the discretization. If the continuous problem has a sufficiently…
For a class $F$ of complex-valued functions on a set $D$, we denote by $g_n(F)$ its sampling numbers, i.e., the minimal worst-case error on $F$, measured in $L_2$, that can be achieved with a recovery algorithm based on $n$ function…
The constrained synchronization problem (CSP) asks for a synchronizing word of a given input automaton contained in a regular set of constraints. It could be viewed as a special case of synchronization of a discrete event system under…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…