Related papers: Simplicial blowups and discrete normal surfaces in…
This paper is an overview of Image Processing and Analysis using Scilab, a free prototyping environment for numerical calculations similar to Matlab. We demonstrate the capabilities of SIP -- the Scilab Image Processing Toolbox -- which…
NPAP (Network Partitioning and Aggregation Package) is an open-source Python library for reducing the spatial complexity of network graphs. Built on NetworkX, it provides an accessible standalone package designed to be readily integrated…
We survey recent progress on the birational geometry of foliations on complex varieties. We focus on the MMP viewpoint: singularities, adjunction and applications to the MMP for foliations on surfaces and to the existence of flips on…
The goal of this paper is to give a new method of constructing finite-dimensional semisimple triangular Hopf algebras, including minimal ones which are non-trivial (i.e. not group algebras). The paper shows that such Hopf algebras are quite…
Topological Signal Processing (TSP) over simplicial complexes is a framework that has been recently proposed, as a generalization of graph signal processing (GSP), to extend GSP to analyzing signals defined over sets of any order (i.e., not…
We introduce blow-up and blow-down operations for generalized complex 4-manifolds. Combining these with a surgery analogous to the logarithmic transform, we then construct generalized complex structures on nCP2 # m \bar{CP2} for n odd, a…
We define vertex cover algebras for weighted simplicial multicomplexes and prove basics properties of them. Also, we describe these algebras for multicomplexes which have only one maximal facet and we prove that they are finitely generated.
This paper extends a recently proposed robust computational framework for constructing the boundary representation (brep) of the volume swept by a given smooth solid moving along a one parameter family $h$ of rigid motions. Our extension…
The recent implementation of a swap Monte Carlo algorithm (SWAP) for polydisperse mixtures fully bypasses computational sluggishness and closes the gap between experimental and simulation timescales in physical dimensions $d=2$ and $3$.…
In this study, we delve into the discrete TC of surjective simplicial fibrations, aiming to unravel the interplay between topological complexity, discrete geometric structures, and computational efficiency. Moreover, we examine the…
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…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
A notion known as smooth envelope, or superposition closure, appears naturally in several approaches to generalized smooth manifolds which were proposed in the last decades. Such an operation is indispensable in order to perform…
In this paper we present a method for extending the blowup method, in the formulation of Krupa and Szmolyan, to flat slow manifolds that lose hyperbolicity beyond any algebraic order. Although these manifolds have infinite co-dimension,…
Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…
The high-order accurate continuous Galerkin finite element method offers attractive computational efficiency for computational fluid dynamics. A challenge is however spurious oscillations which result for convection dominated flows over…
We introduce a new `geometric realization' of an (abstract) simplicial complex, inspired by probability theory. This space (and its completion) is a metric space, which has the right (weak) homotopy type, and which can be compared with the…
Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…
JuMP is an open-source modeling language that allows users to express a wide range of optimization problems (linear, mixed-integer, quadratic, conic-quadratic, semidefinite, and nonlinear) in a high-level, algebraic syntax. JuMP takes…
This is a collection of examples showing how the GAP system can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in the…