Related papers: Slicing, Threading & Parametric Manifolds
We use the trimming transformations to study the tight span of a metric space.
Our work proposes a unified approach to three different topics in a general Riemannian setting: splitting theorems, symmetry results and overdetermined elliptic problems. By the existence of a stable solution to the semilinear equation…
This paper describes a generalization of decomposition in orbifolds. In general terms, decomposition states that two-dimensional orbifolds and gauge theories whose gauge groups have trivially-acting subgroups decompose into disjoint unions…
We apply the geometric-topology surgery theory on spacetime manifolds to study the constraints of quantum statistics data in 2+1 and 3+1 spacetime dimensions. First, we introduce the fusion data for worldline and worldsheet operators…
Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…
In view of the existing limitations of sequential computing, parallelization has emerged as an alternative in order to improve the speedup of numerical simulations. In the framework of evolutionary problems, space-time parallel methods…
In this paper we develop a generalization of foliated manifolds in the context of metric spaces. In particular we study dendritations of surfaces that are defined as maximal atlases of compatible upper semicontinuous local decompositions…
A basic problem in quantizing a field in curved space is the decomposition of the classical modes in positive and negative frequency. The decomposition is equivalent to a choice of a complex structure in the space of classical solutions. In…
In this paper, we proposes the construction methods of sliced space-filling design when the quantitative factors are mixture components. Leveraging the representative points framework for distribution and energy distance decomposition…
Motivated by the algorithmic study of 3-dimensional manifolds, we explore the structural relationship between the JSJ decomposition of a given 3-manifold and its triangulations. Building on work of Bachman, Derby-Talbot and Sedgwick, we…
We study some measure partition problems: Cut the same positive fraction of $d+1$ measures in $\mathbb R^d$ with a hyperplane or find a convex subset of $\mathbb R^d$ on which $d+1$ given measures have the same prescribed value. For both…
Topological surgery in dimension $3$ is intrinsically connected with the classification of $3$-manifolds and with patterns of natural phenomena. In this expository paper, we present two different approaches for understanding and visualizing…
We consider a singularly perturbed fourth-order problem with third-order terms on the unit square. With a formal power series approach, we decompose the solution into solutions of reduced (third-order) problems and various layer parts. The…
Given a sequence of oriented links L^1,L^2,L^3,... each of which has a distinguished, unknotted component, there is a decomposition of the 3-sphere naturally associated to it, which is constructed as the components of the intersection of an…
A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A related problem is to find representations for multiple…
This text is the extended version of a talk given at the conference Geometry, Topology, QFT and Cosmology hold from May 28 to May 30, 2008 at the Observatoire de Paris. We explore the notion of solder (or soldering form) in differential…
The exact complexity of geometric cuts and bisections is the longstanding open problem including even the dimension one. In this paper, we resolve this problem for dimension one (the real line) by designing an exact polynomial time…
Let $S=\{K_{1,3},K_3,P_4\}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subseteq S$. The problem is known to be NP-complete for any…
In the context of holography, entanglement entropy can be studied either by i) extremal surfaces or ii) bit threads, i.e., divergenceless vector fields with a norm bound set by the Planck length. In this paper we develop a new method for…