Related papers: Recovering Lexicographic Triangulations

Given any finitely presented group G we find a triangular algebra such that has two presentations, one with fundamental group G and another with trivial group. Thus proving that given a collection G1,...,Gn of finitely presented groups…

This paper uses mathematics to analyze the challenges of geometrically noisy environments on triangulation. Given widely accepted algorithmic triangulation methods, such as O (n ln n) or a simpler O (n^3) method, we can mathematically prove…

We consider the problem of constructing triangulations of projective planes over Hurwitz algebras with minimal numbers of vertices. We observe that the numbers of faces of each dimension must be equal to the dimensions of certain…

This thesis gives an overview of the state-of-the-art randomized linear algebra algorithms for singular value decomposition (SVD), including the presentation of existing pseudo-codes and theoretical error analysis. Our main focus is on…

In this thesis, we offer a thorough investigation of different regularisation terms used in variational imaging problems, together with detailed optimisation processes of these problems. We begin by studying smooth problems and partially…

A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…

The triangulations of a surface $\Sigma$ with a prescribed set of vertices can be endowed with a graph structure $\mathcal{F}(\Sigma)$. Its edges connect two triangulations that differ by a single arc. It is known that, when $\Sigma$ is a…

In this paper, we propose a general framework for tensor singular value decomposition (tensor SVD), which focuses on the methodology and theory for extracting the hidden low-rank structure from high-dimensional tensor data. Comprehensive…

We consider in this work triangulations of $\mathbb{Z}^n$ that are periodic along $\mathbb{Z}^n$. They generalize the triangulations obtained from Delaunay tessellations of lattices. Other important property is the regularity and…

Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…

In this expository paper, given a field $K$ and two automorphisms $\sigma, \tau \in \mathrm{Aut}(K)$, we give a self-contained proof of the classification of finite dimensional $K$-vector spaces equipped with two operators $F$ and $V$,…

We study the Ginzburg dg algebra $\Gamma_\mathbf{T}$ associated to the quiver with potential arising from a triangulation $\mathbf{T}$ of a decorated marked surface $\mathbf{S}_\bigtriangleup$, in the sense of Qiu. We show that there is a…

Medical images, especially volumetric images, are of high resolution and often exceed the capacity of standard desktop GPUs. As a result, most deep learning-based medical image analysis tasks require the input images to be downsampled,…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)\in E$. A triangular grid graph is a subgraph of a tiling of the plane with…

Let $p$ be a prime number. Every two-variable polynomial $f(x_1, x_2)$ over a finite field of characteristic $p$ defines an Artin--Schreier--Witt tower of surfaces whose Galois group is isomorphic to $\mathbb Z_p$. Our goal of this paper is…

Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of moduli spaces of complex curves with boundaries in his proof of Witten's conjecture. In this work, we define four types of generalised Kontsevich…

Let V be a complex vector space with basis {x_1,x_2,...,x_n} and G be a finite subgroup of GL(V). The tensor algebra T(V) over the complex is isomorphic to the polynomials in the non-commutative variables x_1, x_2,..., x_n with complex…

Tensor completion can estimate missing values of a high-order data from its partially observed entries. Recent works show that low rank tensor ring approximation is one of the most powerful tools to solve tensor completion problem. However,…

We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between the…

We propose a new type of regularization functional for images called oscillation total generalized variation (TGV) which can represent structured textures with oscillatory character in a specified direction and scale. The infimal…