Related papers: Reconstructing resurrection
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
Missing transverse momentum is a crucial observable for physics at hadron colliders, being the only constraint on the kinematics of "invisible" objects such as neutrinos and hypothetical dark matter particles. Computing missing transverse…
In this paper we study the recovery conditions of weighted $l_{1}$ minimization for signal reconstruction from incomplete linear measurements when partial prior support information is available. We obtain that a high order RIP condition can…
In theories with renormalons the perturbative series is factorially divergent even after restricting to a given order in $1/N$, making the $1/N$ expansion a natural testing ground for the theory of resurgence. We study in detail the…
In this note we study the connection between the existence of a projective reconstruction and the existence of a fundamental matrix satisfying the epipolar constraints.
Godel numbering is an arithmetization of sintax which defines provability by coding a primitive recursive predicate, Pf(x,v). A multiplicity of researches and results all around this well-known recursive predicate are today widespread in…
A multi-scale approach to the inverse reconstruction of a pattern's microstructure is reported. Instead of a correlation function, a pair of entropic descriptors (EDs) is proposed for stochastic optimization method. The first of them…
This work demonstrates the development of a strong and ductile medium entropy alloy by employing conventional alloying and thermomechanical processing to induce partial recrystallization (PR) and precipitation strengthening in the…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
Motivated by average-case trace reconstruction and coding for portable DNA-based storage systems, we initiate the study of \emph{coded trace reconstruction}, the design and analysis of high-rate efficiently encodable codes that can be…
In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…
The reconstruction problem of voxels with individual weightings can be modeled a position- and angle- dependent function in the forward-projection. This changes the system matrix and prohibits to use standard filtered backprojection. In…
A recursive construction is presented for the projective cubature formulas of index $p$ on the unit spheres $S(m,K)\subset K^m$ where $K$ is $R$ or $C$, or $H$. This yields a lot of new upper bounds for the minimal number of nodes…
This work is concerned with applying iterative image reconstruction, based on constrained total-variation minimization, to low-intensity X-ray CT systems that have a high sampling rate. Such systems pose a challenge for iterative image…
We consider the problem of recovering an unknown low-rank matrix X with (possibly) non-orthogonal, effectively sparse rank-1 decomposition from measurements y gathered in a linear measurement process A. We propose a variational formulation…
We study those rings in which all invertible elements are weakly nil-clean calling them {\it UWNC rings}. This somewhat extends results due to Karimi-Mansoub et al. in Contemp. Math. (2018), where rings in which all invertible elements are…
Inference algorithms based on evolving interactions between replicated solutions are introduced and analyzed on a prototypical NP-hard problem - the capacity of the binary Ising perceptron. The efficiency of the algorithm is examined…
We prove that nilsystems possess the IPr*-recurrence property and, moreover, are characterized by this property.
We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let $\Omega$ be a regular uncountable cardinal. Let $m<\omega$ and $M$ be an $m$-sound premouse and $\Sigma$ be an…
Perron-Frobenius theory developed for irreducible non-negative kernels deals with so-called $R$-positive recurrent kernels. If kernel $M$ is $R$-positive recurrent, then the main result determines the limit of the scaled kernel iterations…