Related papers: Abstract zip data
Persistent homology provides a robust methodology to infer topological structures from point cloud data. Here we explore the persistent homology of point clouds embedded into a probabilistic setting, exploiting the theory of point…
Framed combinatorial topology is a recent approach to tame geometry which expresses higher-dimensional stratified spaces via tractable combinatorial data. The resulting theory of spaces is well-behaved and computable. In this paper we…
Using persistent homology to guide optimization has emerged as a novel application of topological data analysis. Existing methods treat persistence calculation as a black box and backpropagate gradients only onto the simplices involved in…
The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichm\"uller space…
Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…
We use a labelled deduction system based on the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type. We also define a term rewriting system that is used to make computations between these…
We compute the cohomology of the right generalised projective Stiefel manifolds and use it to find bounds on the rank of the complementary bundle for certain vector bundles. Further the cohomology computations are also used to find bounds…
Affinely closed homogeneous spaces G/H, i.e., affine homogeneous spaces that admit only the trivial affine embedding, are characterized for any affine algebraic group G. As a corollary, a description of affine G-algebras with finitely…
A method of {\it topological grammars} is proposed for multidimensional data approximation. For data with complex topology we define a {\it principal cubic complex} of low dimension and given complexity that gives the best approximation for…
In this article, we compute the topological expansion of all possible mixed-traces in a hermitian two matrix model. In other words we give a recipe to compute the number of discrete surfaces of given genus, carrying an Ising model, and with…
Motivated by the desire for a new kind of approximation, we define a type of localization called pixelation. We present how pixelation manifests in representation theory and in the study of sites and sheaves. A path category is constructed…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
Let $R=\mathbb{F}_p$ or a field of characteristic $0$. For each $R$-good topological space $Y$, we define a collection of higher cohomology operations which, together with the cohomology algebra $H^*(Y;R)$ suffice to determine $Y$ up to…
Given a point configuration A, we uncover a connection between polynomial-reproducing spline spaces over subsets of conv(A) and fine zonotopal tilings of the zonotope Z(V) associated to the corresponding vector configuration. This link…
We compute the Hodge and de Rham cohomology of the classifying space BG (defined as etale cohomology on the algebraic stack BG) for reductive groups G over many fields, including fields of small characteristic. These calculations have a…
We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…
A detailed study of graded frame, graded fuzzy topological system and fuzzy topological space with graded inclusion is already done in our earlier paper. The notions of graded fuzzy topological system and fuzzy topological space with graded…
We consider the problem of producing compact architectures for text classification, such that the full model fits in a limited amount of memory. After considering different solutions inspired by the hashing literature, we propose a method…
We propose a refinement of the Betti numbers and of the homology with coefficients in a field of a compact ANR in the presence of a continuous real valued function. The refinement of Betti numbers consists of finite configurations of points…
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…