Related papers: simpcomp -- A GAP toolbox for simplicial complexes
Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…
Collective Adaptive Systems often consist of many heterogeneous components typically organised in groups. These entities interact with each other by adapting their behaviour to pursue individual or collective goals. In these systems, the…
We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times…
The simplification of a multigraph into a simple graph can be abstracted to a more general comma category under some common conditions. When using the identity functor, the category of simple objects in a comma category generalizes the…
A method for computing integrals of polynomial functions on compact symmetric spaces is given. Those integrals are expressed as sums of functions on symmetric groups.
SARAH is a Mathematica package for building and studying supersymmetric models. It calculates for a given superpotential and gauge sector the full Lagrangian of a model. With the new version of SARAH it is possible to calculate…
The Physics Analysis eXpert (PAX) is an open source toolkit for high energy physics analysis. The C++ class collection provided by PAX is deployed in a number of analyses with complex event topologies at Tevatron and LHC. In this article,…
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…
In this note we compute the cohomology of the elliptic tangent bundle, a Lie algebroid used to describe singular symplectic forms arising from generalized complex geometry.
In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…
In this paper, we compare several functors which take simplicial categories or model categories to complete Segal spaces, which are particularly nice simplicial spaces which, like simplicial categories, can be considered to be models for…
We describe a general purpose Mathematica package for computing Superfield Operator Product Expansions in meromorphic $N=2$ superconformal field theory. Given the SOPEs for a set of ``basic" superfields, SOPEs of arbitrarily complicated…
We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…
Global Average Pooling (GAP) [4] has been used previously to generate class activation for image classification tasks. The motivation behind SIMILARnet comes from the fact that the convolutional filters possess position information of the…
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…
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.…
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…
Answer set programming (ASP) is a popular nonmonotonic-logic based paradigm for knowledge representation and solving combinatorial problems. Computing the answer set of an ASP program is NP-hard in general, and researchers have been…
We present novel mixed-integer programming (MIP) formulations for optimization over nonconvex piecewise linear functions. We exploit recent advances in the systematic construction of MIP formulations to derive new formulations for…
Twenty years ago Gromov asked about how large is the set of isomorphism classes of groups whose systolic area is bounded from above. This article introduces a new combinatorial invariant for finitely presentable groups called {\it…