Related papers: Simplicial blowups and discrete normal surfaces in…
simpcomp is an extension (a so called package) to GAP, the well known system for computational discrete algebra. The package enables the user to compute numerous properties of (abstract) simplicial complexes, provides functions to construct…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
In the spirit of topological entropy we introduce new complexity functions for general dynamical systems (namely groups and semigroups acting on closed manifolds) but with an emphasis on the dynamics induced on simplicial complexes. For…
The immediate snapshot complexes were introduced as combinatorial models for the protocol complexes in the context of theoretical distributed computing. In the previous work we have developed a formal language of witness structures in order…
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…
Computer algebra systems are complex software systems that cover a wide range of scientific and practical problems. However, the absolute coverage cannot be achieved. Often, it is required to create a user extension for an existing computer…
We present the SLIM (https://github.com/slimgroup) open-source software framework for computational geophysics, and more generally, inverse problems based on the wave-equation (e.g., medical ultrasound). We developed a software environment…
{\tt AbstractSimplicialComplexes.m2} is a computer algebra package written for the computer algebra system {\tt Macaulay2} \cite{M2}. It provides new infrastructure to work with abstract simplicial complexes and related homological…
Motivated by the theory of Riemann surfaces, we classify all possibilities for finite simple groups acting faithfully on a compact Riemann surface of genus at least 2 in such a way that all non-trivial elements have at most three fixed…
Simflowny is an open platform which automatically generates efficient parallel code of scientific dynamical models for different simulation frameworks. Here we present major upgrades on this software to support simultaneously a quite…
The 4-dimensional abstract Kummer variety K^4 with 16 nodes leads to the K3 surface by resolving the 16 singularities. Here we present a simplicial realization of this minimal resolution. Starting with a minimal 16-vertex triangulation of…
We present semisimp, a tool for semiautomatic simplification of three dimensional polygonal models. Existing automatic simplification technology is quite mature, but is not sensitive to the heightened importance of distinct semantic model…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
The package numericalsgps performs computations with and for numerical semigroups. Recently also affine semigroups are admitted as objects for calculations. This manuscript is a survey of what the package does, and at the same time of the…
In this paper, we define the notion of exterior isoclinism of crossed modules. Functions for computing with these structures have been written using the GAP computational discrete algebra programming language
Several recent SIGGRAPH papers on surface simplification are described.
In this paper we classify all singular irreducible symplectic surfaces, i.e., compact, connected complex surfaces with canonical singularities that have a holomorphic symplectic form $\sigma$ on the smooth locus, and for which every finite…
A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…