Related papers: Orbifold deconstruction: a computational approach

Image reconstruction in X ray tomography consists in determining an object from its projections. In many applications such as non destructive testing, we look for an image who has a constant value inside a region (default) and another…

This thesis deals with a class of integrable field theories called models with twist function. The main examples of such models are integrable non-linear sigma models, such as the Principal Chiral Model, and their deformations. A first…

We consider the imaging problem of the reconstruction of a three-dimensional object via optical diffraction tomography under the assumptions of the Born approximation. Our focus lies in the situation that a rigid object performs an…

Airfoil shape design is a classical problem in engineering and manufacturing. In this work, we combine principled physics-based considerations for the shape design problem with modern computational techniques using a data-driven approach.…

Complexity of patterns is a key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal…

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

Let $P$ be a Poisson structure on a finite-dimensional affine real manifold. Can $P$ be deformed in such a way that it stays Poisson? The language of Kontsevich graphs provides a universal approach -- with respect to all affine Poisson…

It has been recently shown that neural networks can recover the geometric structure of a face from a single given image. A common denominator of most existing face geometry reconstruction methods is the restriction of the solution space to…

An approach is proposed which, given a family of linearly independent functions, constructs the appropriate biorthogonal set so as to represent the orthogonal projector operator onto the corresponding subspace. The procedure evolves…

The kinematical part of general theory of deformational structures on smooth manifolds is developed. We introduce general concept of d-objects deformation, then within the set of all such deformations we develop some special algebra and…

We consider deformations of G-structures via the right action on the frame bundle in a base-point-dependent manner. We investigate which of these deformations again lead to G-structures and in which cases the original and the deformed…

Let $A$ be a $n$ by $n$ matrix. A skeleton decomposition is any factorization of the form $CUR$ where $C$ comprises columns of $A$, and $R$ comprises rows of $A$. In this paper, we consider uniformly sampling $\l\simeq k \log n$ rows and…

Relative orbifold Gromov-Witten theory is set-up and the degeneration formula is given.

We use curvature decompositions to construct generating sets for the space of algebraic curvature tensors and for the space of tensors with the same symmetries as those of a torsion free, Ricci symmetric connection; the latter naturally…

Deformable medical image registration is an essential task in computer-assisted interventions. This problem is particularly relevant to oncological treatments, where precise image alignment is necessary for tracking tumor growth, assessing…

We study first order deformations of the tangent sheaf of resolutions of Calabi-Yau threefolds that are of the form $\mathbb{C}^3/Z_r$, focusing on the cases where the orbifold has an isolated singularity. We prove a lower bound on the…

Suzuki-Trotter decompositions of exponential operators like $\exp(Ht)$ are required in almost every branch of numerical physics. Often the exponent under consideration has to be split into more than two operators $H=\sum_k A_k$, for…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…