Related papers: Analysis of a method to parameterize planar curves…
We prove the global triangulation conjecture for families of refined p-adic representations under a mild condition. That is, for a refined family, the associated family of (phi, Gamma)-modules admits a global triangulation on a Zariski open…
A new graph-based order parameter is introduced for the characterization of atomistic structures. The order parameter is universal to any material/chemical system, and is transferable to all structural geometries. Three sets of data are…
The notion of a (polynomial) kernelization from parameterized complexity is a well-studied model for efficient preprocessing for hard computational problems. By now, it is quite well understood which parameterized problems do or…
In this article we study solutions to the (interior) thin obstacle problem under low regularity assumptions on the coefficients, the obstacle and the underlying manifold. Combining the linearization method of Andersson \cite{An16} and the…
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. The motivation comes from the problem of establishing a…
Let $\Gamma$ be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve $\gamma \in \Gamma$, we denote the bounded region enclosed by $\gamma$ as $\tilde{\gamma}$. We say that $\Gamma$ is…
Point cloud is the most fundamental representation of 3D geometric objects. Analyzing and processing point cloud surfaces is important in computer graphics and computer vision. However, most of the existing algorithms for surface analysis…
We use a canonical parametrization of twisted geometries describing the classical phase space of loop quantum gravity on a fixed graph, and establish its explicit correspondence with the associated frame bases and spinorial descriptions.…
This paper studies the parameter tuning problem of positive linear systems for optimizing their stability properties. We specifically show that, under certain regularity assumptions on the parametrization, the problem of finding the…
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\frac{1}{6}$ fraction of the triangular…
We establish the existence of a non-trivial, branched immersion of a closed Riemann surface $\Sigma$ with constant mean curvature (CMC) $H$ into any closed, orientable 3-manifold $\mathcal{M}$, for almost every prescribed value of $H$. The…
We present a unified approach for characterizing the boundary of a possibly nonconvex domain. Motivated by the well-known Pascoletti--Serafini method of scalarization, we recast the boundary characterization as a multi-criteria optimization…
This paper focuses on studying the configuration spaces of graphs realised in $\mathbb C^2$, such that the configuration space is, after normalisation, one dimensional. If this is the case, then the configuration space is, generically, a…
We prove that the crossed product $C^*$-algebra $C^*_r(\Gamma,\partial\Gamma)$ of a free group $\Gamma$ with its boundary $\partial\Gamma$ naturally sits between the reduced group $C^*$-algebra $C^*_r\Gamma$ and its injective envelope…
It was recently determined exactly through how many general points a nondegenerate curve with nonspecial hyperplane section can pass. This gives rise to a method of constructing reducible curves $C_1 \cup_\Gamma C_2 \to \mathbb{P}^r$ with…
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…
Let PG$(\mathbb{F}_q^v)$ be the $(v-1)$-dimensional projective space over $\mathbb{F}_q$ and let $\Gamma$ be a simple graph of order ${q^k-1\over q-1}$ for some $k$. A 2$-(v,\Gamma,\lambda)$ design over $\mathbb{F}_q$ is a collection $\cal…
Consider a random graph process where vertices are chosen from the interval $[0,1]$, and edges are chosen independently at random, but so that, for a given vertex $x$, the probability that there is an edge to a vertex $y$ decreases as the…
We introduce a conceptually simple and efficient algorithm for seamless parametrization, a key element in constructing quad layouts and texture charts on surfaces. More specifically, we consider the construction of parametrizations with…
Resolution parameters in graph clustering represent a size and quality trade-off. We address the task of efficiently solving a parameterized graph clustering objective for all values of a resolution parameter. Specifically, we consider an…