Related papers: Orbifold deconstruction: a computational approach
Decompositions of networks are useful not only for structural exploration. They also have implications and use in analysis and computational solution of processes (such as the Ising model, percolation, SIR model) running on a given network.…
A new predictor-corrector type incremental algorithm is proposed for the exact construction of weighted straight skeletons of 2D general planar polygons of arbitrary complexity based on the notion of deforming polygon. In the proposed…
Trimming is a core technique in geometric modeling. Unfortunately, the resulting objects do not take the requirements of numerical simulations into account and yield various problems. This paper outlines principal issues of trimmed models…
We propose a method to recover the structure of a compound object from multiple silhouettes. Structure is expressed as a collection of 3D primitives chosen from a pre-defined library, each with an associated pose. This has several…
We derive exact reconstruction methods for cracks consisting of unions of Lipschitz hypersurfaces in the context of Calder\'on's inverse conductivity problem. Our first method obtains upper bounds for the unknown cracks, bounds that can be…
We consider conformal field theories around points of large twist degeneracy. Examples of this are theories with weakly broken higher spin symmetry and perturbations around generalised free fields. At the degenerate point we introduce twist…
The twist construction is a geometric model of T-duality that includes constructions of nilmanifolds from tori. This paper shows how one-dimensional foliations on manifolds may be used in a shear construction, which in algebraic form builds…
We explore methods for constructing normal forms of indecomposable quiver representations. The first part of the paper develops homological tools for recursively constructing families of indecomposable representations from indecomposables…
A refinement of manifold data is a computational process, which produces a denser set of discrete data from a given one. Such refinements are closely related to multiresolution representations of manifold data by pyramid transforms, and…
A general reconstruction and calibration procedure for tracking and wire position determination of the OPERA drift tubes is presented. The mathematics of the pattern recognition and the track fit are explained.
Model calculations of nuclear properties are peformed using quantum computing algorithms on simulated and real quantum computers. The models are a realistic calculation of deuteron binding based on effective field theory, and a simplified…
The Decomposition Problem in the class $LIP(\mathbb{S}^2)$ is to decompose any bi-Lipschitz map $f:\mathbb{S}^2 \to \mathbb{S}^2$ as a composition of finitely many maps of arbitrarily small isometric distortion. In this paper, we construct…
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters…
Traditional tensor decomposition methods, e.g., two dimensional principal component analysis and two dimensional singular value decomposition, that minimize mean square errors, are sensitive to outliers. To overcome this problem, in this…
Dimensionality reduction is an essential technique for multi-way large-scale data, i.e., tensor. Tensor ring (TR) decomposition has become popular due to its high representation ability and flexibility. However, the traditional TR…
We consider the problem of selecting an optimal mask for an image manifold, i.e., choosing a subset of the pixels of the image that preserves the manifold's geometric structure present in the original data. Such masking implements a form of…
The main purpose of this paper is to lay the foundations of a general theory which encompasses the features of the classical Hough transform and extend them to general algebraic objects such as affine schemes. The main motivation comes from…
We consider representations of tensors as sums of decomposable tensors or, equivalently, decomposition of multilinear forms into one--forms. In this short note we show that there exists a particular finite strongly orthogonal decomposition…
We consider a strongly heterogeneous medium saturated by an incompressible viscous fluid as it appears in geomechanical modeling. This poroelasticity problem suffers from rapidly oscillating material parameters, which calls for a thorough…
Maximum likelihood iteration is one of the most commonly used reconstruction algorithms in quantum tomography. The main appeal of the method is that it is easy to implement and that it converges reliably to a physically meaningful density…