Related papers: Simplicial blowups and discrete normal surfaces in…
FinInG is a package for computation in Finite Incidence Geometry. It provides users with the basic tools to work in various areas of finite geometry from the realms of projective spaces to the flat lands of generalised polygons. The…
We provide a random simplicial complex by applying standard constructions to a Poisson point process in Euclidean space. It is gigantic in the sense that - up to homotopy equivalence - it almost surely contains infinitely many copies of…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
We prove that every minimal symplectic filling of the link of a quotient surface singularity can be obtained from its minimal resolution by applying a sequence of rational blow-downs and symplectic antiflips. We present an explicit…
We present a Mathematica package for doing computations with gamma matrices, spinors, tensors and other objects, in any dimension and signature. The approach we use is based on defining the commutation relations of the relevant matrices,…
Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners,…
Simflowny is an open platform which automatically generates parallel code of scientific dynamical models for different simulation frameworks. Here we present major upgrades on this software to support an extended set of families of models,…
In this article we construct a new family of simply connected symplectic 4-manifolds with $b_2^+ =1$ and $c_1^2 =2$ which are not diffeomorphic to rational surfaces by using rational blow-down technique. As a corollary, we conclude that a…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. In this paper, we study the embedded homology as well as the homology of the (lower-)associated simplicial complexes for hypergraphs. We…
Many practical applications in topological data analysis arise from data in the form of point clouds, which then yield simplicial complexes. The combinatorial structure of simplicial complexes captures the topological relationships between…
We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of math.CT/9902151 disappear.…
We construct standard resolutions for analytic local modules on complex hypersurfaces using standard basis methods, with extensions to complete intersections. The algebraic version over arbitrary infinite fields is also suggested.…
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…
We construct a minimal complex surface of general type with $p_g=0$, $K^2 =4$, and $\pi_1=\mathbb{Z}/2\mathbb{Z}$ using a rational blow-down surgery and a $\mathbb{Q}$-Gorenstein smoothing theory. In a similar fashion, we also construct a…
A triangulation of a point configuration is regular if it can be given by a height function, that is every point gets lifted to a certain height and projecting the lower convex hull gives the triangulation. Checking regularity of a…
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version…
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…
We use the topology of simplicial complexes to model political structures following [1]. Simplicial complexes are a natural tool to encode interactions in the structures since a simplex can be used to represent a subset of compatible…
The Simplex algorithm for solving linear programs-one of Computing in Science & Engineering's top 10 most influential algorithms of the 20th century-is an important topic in many algorithms courses. While the Simplex algorithm relies on…
Starting from a locally gentle bound quiver, we define on the one hand a simplicial complex, called the non-kissing complex. On the other hand, we construct a punctured, marked, oriented surface with boundary, endowed with a pair of dual…