相关论文: Computing Cocycles on Simplicial Complexes

We present here a combinatorial method for computing cup-$i$ products and Steenrod squares of a simplicial set $X$. This method is essentially based on the determination of explicit formulae for the component morphisms of a higher diagonal…

Operations on the cohomology of spaces are important tools enhancing the descriptive power of this computable invariant. For cohomology with mod 2 coefficients, Steenrod squares are the most significant of these operations. Their effective…

This paper offers an algorithmic solution to the problem of obtaining "economical" formulae for some maps in Simplicial Topology, having, in principle, a high computational cost in their evaluation. In particular, maps of this kind are used…

We describe the action of the mod $2$ Steenrod algebra on the cohomology of various polyhedral products and related spaces. We carry this out for Davis-Januszkiewicz spaces and their generalizations, for moment-angle complexes as well as…

Steenrod defined in 1947 the Steenrod squares on the mod 2 cohomology of spaces using explicit cochain formulae for the cup-$i$ products; a family of coherent homotopies derived from the broken symmetry of Alexander--Whitney's chain…

We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree…

Let $I=(\mathbb{Z}^3,26,6,B)$ be a 3D digital image, let $Q(I)$ be the associated cubical complex and let $\partial Q(I)$ be the subcomplex of $Q(I)$ whose maximal cells are the quadrangles of $Q(I)$ shared by a voxel of $B$ in the…

We propose a method for calculating cohomology operations for finite simplicial complexes. Of course, there exist well--known methods for computing (co)homology groups, for example, the reduction algorithm consisting in reducing the…

Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…

We prove a conjecture raised by M. Goresky and W. Pardon, concerning the range of validity of the perverse degree of Steenrod squares in intersection cohomology. This answer turns out of importance for the definition of characteristic…

In 1947, N.E. Steenrod defined the Steenrod Squares, which are mod 2 cohomology operations, using explicit cochain formulae for cup-i products of cocycles. He later recast the construction in more general homological terms, using group…

We study the homology of simplicial and cubical sets with symmetries. These are simplicial and cubical sets with additional maps expressing the symmetries of simplices and cubes. We consider the chain complex computing the homology groups…

A numerical characterization is given of the so-called h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result characterizes the number of faces of various dimensions and codimensions in such a complex, generalizing the…

We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…

A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…

Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…

The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials (written as sums of monomials). We give recurrence formulae…

The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…

Explicit extensions representing cocycles $x \in Ext_{A}^{s,t}(F_2,F_2)$ are useful in calculating Steenrod operations $Sq^i : Ext_{A}^{s,t}(F_2,F_2) \longrightarrow Ext_{A}^{s+i,2t}(F_2,F_2)$ by a method devised by the second author. This…

Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes…