English
Related papers

Related papers: Computationally proving triangulated 4-manifolds t…

200 papers

We write out some sequences of linear maps of vector spaces with fixed bases. Each term of a sequence is a linear space of differentials of metric values ascribed to the elements of a simplicial complex - a triangulation of a manifold. If…

Geometric Topology · Mathematics 2019-08-21 Igor G. Korepanov

We construct invariants of four-dimensional piecewise-linear manifolds, represented as simplicial complexes, with respect to rebuildings that transform a cluster of three 4-simplices having a common two-dimensional face in a different…

Geometric Topology · Mathematics 2019-08-21 Igor G. Korepanov

We develop the theory of orbibundles from a geometrical viewpoint using diffeology. One of our goals is to present new tools allowing to calculate invariants of complex hyperbolic disc orbibundles over $2$-orbifolds appearing in the…

Geometric Topology · Mathematics 2023-08-01 Hugo Cattarucci Botós

It is not completely unreasonable to expect that a computable function bounding the number of Pachner moves needed to change any triangulation of a given 3-manifold into any other triangulation of the same 3-manifold exists. In this paper…

Geometric Topology · Mathematics 2007-05-23 Aleksandar Mijatovic

Many authors studied numeric algorithms for solving the linear systems of the pentadiagonal type. The well-known Fast Pentadiagonal System Solver algorithm is an example of such algorithms. The current article are described new numeric and…

Numerical Analysis · Mathematics 2015-01-05 A. A. Karawia

A new formula is obtained in algebraic topology, in terms of Betti numbers, and a new method, called the spinal method, is suggested and developed for generating quadrangulations of closed orientable surfaces. Those surfaces arise as the…

Combinatorics · Mathematics 2013-08-14 Serge Lawrencenko

We classify complete curvature homogeneous metrics on simply connected four dimensional manifolds which are invariant under a cohomogeneity one action. We show that they are either isometric to a symmetric space with one of its…

Differential Geometry · Mathematics 2020-10-20 Luigi Verdiani , Wolfgang Ziller

We report recent research on computing with biology-based neural network models by means of physics-based opto-electronic hardware. New technology provides opportunities for very-high-speed computation and uncovers problems obstructing the…

Neural and Evolutionary Computing · Computer Science 2010-06-09 A. Steven Younger , Emmett Redd

There is a need in general relativity for a consistent and useful mathematical theory defining the multiplication of tensor distributions in a geometric (diffeomorphism invariant) way. Significant progress has been made through the concept…

General Relativity and Quantum Cosmology · Physics 2011-12-12 Jozef Skakala

A compact oriented 4-manifold is defined to be of ``superconformal simple type'' if certain polynomials in the basic classes (constructed using the Seiberg-Witten invariants) vanish identically. We show that all known 4-manifolds of…

Differential Geometry · Mathematics 2007-05-23 Marcos Marino , Gregory Moore , Grigor Peradze

We study trisections of 4-manifolds obtained by spinning and twist-spinning 3-manifolds, and we show that, given a (suitable) Heegaard diagram for the 3-manifold, one can perform simple local modifications to obtain a trisection diagram for…

Geometric Topology · Mathematics 2022-10-19 Jeffrey Meier

The Kirchhoff plate model plays a vital role in modeling, computing and analyzing the mechanical behaviors of thin plate structures. This study propose a novel fourth-order multi-scale (FOMS) computational method for high-accuracy and…

Numerical Analysis · Mathematics 2025-12-10 Hao Dong , Liqun Cao

A method to define the complex structure and separate the conformal mode is proposed for a surface constructed by two-dimensional dynamical triangulation. Applications are made for surfaces coupled to matter fields such as $n$ scalar fields…

High Energy Physics - Theory · Physics 2016-09-06 H. Kawai , N. Tsuda , T. Yukawa

Parametric unfolding of a true distribution distorted due to finite resolution and limited efficiency for the registration of individual events is discussed. Details of the computational algorithm of the unfolding procedure are presented.

Data Analysis, Statistics and Probability · Physics 2020-07-08 Nikolay Gagunashvili

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

Computational Geometry · Computer Science 2018-04-05 Vincent Despré , Olivier Devillers , Hugo Parlier , Jean-Marc Schlenker

We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…

Combinatorics · Mathematics 2018-10-30 Charles Jordan , Michael Joswig , Lars Kastner

We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to…

Geometric Topology · Mathematics 2025-07-01 Benjamin A. Burton , Stephan Tillmann

In this paper, we completely classify all compact 4-manifolds with positive isotropic curvature. We show that they are diffeomorphic to $\mathbb{S}^4,$ or $\mathbb{R}\mathbb{P}^4$ or quotients of $\mathbb{S}^3\times \mathbb{R}$ by a…

Differential Geometry · Mathematics 2008-10-14 Bing-Long Chen , Siu-Hung Tang , Xi-Ping Zhu

Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…

Computational Geometry · Computer Science 2017-06-16 Robert Graham , Adam M. Oberman

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Joerg Schepers