Related papers: Parameterized Resolution with bounded conjunction
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
The correspondence between 2-parameter families of oriented lines in ${\Bbb{R}}^3$ and surfaces in $T{\Bbb{P}}^1$ is studied, and the geometric properties of the lines are related to the complex geometry of the surface. Congruences…
We study the parameterized complexity of separating a small set of vertices from a graph by a small vertex-separator. That is, given a graph $G$ and integers $k$, $t$, the task is to find a vertex set $X$ with $|X| \le k$ and $|N(X)| \le…
In this paper we develop explicit and semi-implicit second-order high-resolution finite difference schemes for a structured coagulation-fragmentation model formulated on the space of Radon measures. We prove the convergence of each of the…
The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other. Our main result is decidability, and PSpace-completeness, of the regular separability…
In this work, we expose four bijections each allowing to increase (or decrease) one parameter in either uniform random forests with a fixed number of edges and trees, or quadrangulations with a boundary having a fixed number of faces and a…
We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137--153, 2009) are…
Constraint problems can be trivially solved in parallel by exploring different branches of the search tree concurrently. Previous approaches have focused on implementing this functionality in the solver, more or less transparently to the…
In some super-resolution techniques, adjacent points are illuminated at different times. Thereby, their locations and light intensities can be detected even if the images are very blurred due to diffraction. According to conventional…
We obtain some rigidity results for overdetermined boundary value problems for singular solutions in bounded domains.
In this Part II, we apply the general theory developed in Part I to a detailed analysis of the Constraint Satisfaction Problem (CSP). We show how specific types of resolution rules can be defined. In particular, we introduce the general…
Radar interferometry usually exploits two complex-valued radar images with the same resolution to extract terrain elevation information. This paper considers the interferometry using two radar images with different resolutions, which we…
Two types of approximation to the paradoxical Russell Set are presented, one approximating it from below, one from above. It is shown that any lower approximation gives rise to a better approximation containing it, and that any upper…
Single image super-resolution (SR) aims to estimate a high-resolution (HR) image from a lowresolution (LR) input. Image priors are commonly learned to regularize the otherwise seriously ill-posed SR problem, either using external LR-HR…
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…
We construct solution operators to the $\overline{\partial}$-equation that depend continuously on the domain. This is applied to derive a parameter version of Forstneri\v{c}'s splitting lemma: If both the maps and the domains they are…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
Differential constraints compatible with the linearized equations of partial differential equations are examined. Recursion operators are obtained by integrating the differential constraints.
In the first three papers, we conducted a series of discussions on the statistics of strict partitions and Rogers-Ramanujan partitions, specifically the sequences of odd length (denoted as $\mathrm{sol}$) and its extensions. We established…
We provide a setting-independent definition of reals by introducing the notion of a streak. We show that various standard constructions of reals satisfy our definition. We study the structure of reals by noting that its pieces correspond to…