English
Related papers

Related papers: Computationally proving triangulated 4-manifolds t…

200 papers

We distinguish diffeomorphism types of relative trisections using a ``capping'' operation, which yields a trisection diagram of a closed 4-manifold from a relative trisection diagram. Using this operation, we give various examples of…

Geometric Topology · Mathematics 2026-02-17 Natsuya Takahashi

The possibility of a complex 4-dimensional space-time manifold is suggested. This may imply the existence of a matter wave.

General Physics · Physics 2007-05-23 Lu Lin

We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…

Geometric Topology · Mathematics 2025-02-19 Shintaro Fushida-Hardy

A new topological invariant of closed connected orientable four-dimensional manifolds is proposed. The invariant, constructed via surgery on a special link, is a four-dimensional counterpart of the celebrated SU(2) three-manifold invariant…

High Energy Physics - Theory · Physics 2008-02-03 B. Broda

This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…

Algebraic Topology · Mathematics 2007-05-23 Michael Joswig

In this paper, we show that a smooth 4-manifold diffeomorphic to a complex hypersurface in $\mathbb{CP}^3 $ of degree $d\geq 5$ can be decomposed as the union of $d(d-4)^2$ copies of 4-dimensional pair-of-pants and certain subsets of K3…

Differential Geometry · Mathematics 2021-02-22 Yuguang Zhang

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

We show that there exists an algorithm that takes as input two closed, simply connected, topological 4-manifolds and decides whether or not these 4-manifolds are homeomorphic. In particular, we explain in detail how closed, simply…

We classify four-dimensional compact solvmanifolds up to diffeomorphism, while determining which of them have complex analytic structures. In particular, we shall see that a four-dimensional compact solvmanifold S can be written, up to…

Complex Variables · Mathematics 2007-05-23 Keizo Hasegawa

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…

Geometric Topology · Mathematics 2019-10-24 Benjamin A. Burton , Jonathan Spreer

In this paper, a lot of examples of four-dimensional manifolds with an almost hypercomplex pseudo-Hermitian structure are constructed in several explicit ways. The received 4-manifolds are characterized by their linear invariants in the…

Differential Geometry · Mathematics 2012-05-08 Mancho Manev , Kouei Sekigawa

New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The…

Data Structures and Algorithms · Computer Science 2009-10-09 Wei-Mei Chen , Hsien-Kuei Hwang , Tsung-Hsi Tsai

An orientation preserving diffeomorphism over a surface embedded in a 4-manifold is called extendable, if this diffeomorphism is a restriction of an orientation preserving diffeomorphism on this 4-manifold. In this paper, we investigate…

Geometric Topology · Mathematics 2014-10-01 Susumu Hirose

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Computational Geometry · Computer Science 2018-10-24 Bhaskar Bagchi , Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a…

Complex Variables · Mathematics 2022-11-18 Vitaly A. Krasikov

We compute the dynamical degrees of certain compositions of reflections in points on a smooth cubic fourfold. Our interest in these computations stems from the irrationality problem for cubic fourfolds. Namely, we hope that they will…

Algebraic Geometry · Mathematics 2017-09-21 Christian Böhning , Hans-Christian Graf von Bothmer , Pawel Sosna

We investigate proper biharmonic hypersurfaces with at most three distinct principal curvatures in space forms. We obtain the full classification of proper biharmonic hypersurfaces in 4-dimensional space forms.

Differential Geometry · Mathematics 2007-09-14 A. Balmuş , S. Montaldo , C. Oniciuc

We construct closed, aspherical, smooth 4-manifolds that are homeomorphic but not diffeomorphic. These provide counterexamples to a smooth analog of the Borel conjecture in dimension four. Our technique is to apply the `reflection group…

Geometric Topology · Mathematics 2026-05-06 Michael Davis , Kyle Hayden , Jingyin Huang , Daniel Ruberman , Nathan Sunukjian

In this note explicit algorithms for calculating the exponentials of important structured 4 x 4 matrices are provided. These lead to closed form formulae for these exponentials. The techniques rely on one particular Clifford Algebra…

Mathematical Physics · Physics 2009-11-10 Viswanath Ramakrishna , F. Costa

The analysis of manifold-valued data requires efficient tools from Riemannian geometry to cope with the computational complexity at stake. This complexity arises from the always-increasing dimension of the data, and the absence of…

Computer Vision and Pattern Recognition · Computer Science 2017-11-27 Maxime Louis , Alexandre Bône , Benjamin Charlier , Stanley Durrleman