相关论文: Computing Cocycles on Simplicial Complexes

This paper presents a set of tools to compute topological information of simplicial complexes, tools that are applicable to extract topological information from digital pictures. A simplicial complex is encoded in a (non-unique)…

We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…

The paper studies the connectivity properties of facet graphs of simplicial complexes of combinatorial interest. In particular, it is shown that the facet graphs of $d$-cycles, $d$-hypertrees and $d$-hypercuts are, respectively, $(d+1)$,…

Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all…

This paper displays complexity reduction techniques for calculations of path categories (or fundamental categories) P(K) for finite simplicial and cubical complexes K. The central technique involves identifying inclusions of complexes for…

We classify the possible Scott complexities for models of Peano arithmetic. We construct models of particular complexities by first giving a complete Scott analysis of colored linear orderings and constructing models of Peano arithmetic…

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

To produce cartographic maps, simplification is typically used to reduce complexity of the map to a legible level. With schematic maps, however, this simplification is pushed far beyond the legibility threshold and is instead constrained by…

This paper describes the homology of various simplicial complexes associated to set families from combinatorial number theory, including primitive sets, pairwise coprime sets, product-free sets, and coprime-free sets. We present a condition…

A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…

Principal circle bundle over a PL polyhedron can be triangulated and thus obtains combinatorics. The triangulation is assembled from triangulated circle bundles over simplices. To every triangulated circle bundle over a simplex we associate…

We introduce a new algorithm for the structural analysis of finite abstract simplicial complexes based on local homology. Through an iterative and top-down procedure, our algorithm computes a stratification $\pi$ of the poset $P$ of…

We study cup products in integral cohomology of the Hilbert scheme of $n$ points on a K3 surface and present a computer program for this purpose. In particular, we deal with the question, which classes can be represented by products of…

Motivated by the construction of Steenrod cup-$i$ products in the singular cochain algebra of a space and in the algebra of non-commutative differential forms, we define a category of binomial cup-one differential graded algebras over the…

We present an algebraic framework for the computation of low-degree cohomology of a class of bigraded complexes which arise in Poisson geometry around (pre)symplectic leaves. We also show that this framework can be applied to the more…

To each oriented closed combinatorial manifold we assign the set (with repetitions) of isomorphism classes of links of its vertices. The obtained transformation L is the main object of study of the present paper. We pose a problem on the…

Golodness of 2-dimensional simplicial complexes is studied through polyhedral products, and combinatorial and topoogical characterization of Golodness of surface triangulations is given. An answer to the question of Berglund is also given…

We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…

In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…