scholarly journals Cosheaf representations of relations and Dowker complexes

Author(s):  
Michael Robinson

AbstractThe Dowker complex is an abstract simplicial complex that is constructed from a binary relation in a straightforward way. Although there are two ways to perform this construction—vertices for the complex are either the rows or the columns of the matrix representing the relation—the two constructions are homotopy equivalent. This article shows that the construction of a Dowker complex from a relation is a non-faithful covariant functor. Furthermore, we show that this functor can be made faithful by enriching the construction into a cosheaf on the Dowker complex. The cosheaf can be summarized by an integer weight function on the Dowker complex that is a complete isomorphism invariant for the relation. The cosheaf representation of a relation actually embodies both Dowker complexes, and we construct a duality functor that exchanges the two complexes.

2012 ◽  
Vol 153 (3) ◽  
pp. 457-469 ◽  
Author(s):  
A. BAHRI ◽  
M. BENDERSKY ◽  
F. R. COHEN ◽  
S. GITLER

AbstractDavis–Januszkiewicz introduced manifolds which are now known as moment-angle manifolds over a polytope [6]. Buchstaber–Panov introduced and extensively studied moment-angle complexes defined for any abstract simplicial complex K [4]. They completely described the rational cohomology ring structure in terms of the Tor-algebra of the Stanley-Reisner algebra [4].Subsequent developments were given in work of Denham–Suciu [7] and Franz [9] which were followed by [1, 2]. Namely, given a family of based CW-pairs X, A) = {(Xi, Ai)}mi=1 together with an abstract simplicial complex K with m vertices, there is a direct extension of the Buchstaber–Panov moment-angle complex. That extension denoted Z(K;(X,A)) is known as the polyhedral product functor, terminology due to Bill Browder, and agrees with the Buchstaber–Panov moment-angle complex in the special case (X,A) = (D2, S1) [1, 2]. A decomposition theorem was proven which splits the suspension of Z(K; (X, A)) into a bouquet of spaces determined by the full sub-complexes of K.This paper is a study of the cup-product structure for the cohomology ring of Z(K; (X, A)). The new result in the current paper is that the structure of the cohomology ring is given in terms of this geometric decomposition arising from the “stable” decomposition of Z(K; (X, A)) [1, 2]. The methods here give a determination of the cohomology ring structure for many new values of the polyhedral product functor as well as retrieve many known results.Explicit computations are made for families of suspension pairs and for the cases where Xi is the cone on Ai. These results complement and extend those of Davis–Januszkiewicz [6], Buchstaber–Panov [3, 4], Panov [13], Baskakov–Buchstaber–Panov, [3], Franz, [8, 9], as well as Hochster [12]. Furthermore, under the conditions stated below (essentially the strong form of the Künneth theorem), these theorems also apply to any cohomology theory.


2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Vladimir I. Danilov ◽  
Alexander V. Karzanov ◽  
Gleb A. Koshevoy

International audience Let $G=(V,E)$ be a finite acyclic directed graph. Being motivated by a study of certain aspects of cluster algebras, we are interested in a class of triangulations of the cone of non-negative flows in $G, \mathcal F_+(G)$. To construct a triangulation, we fix a raming at each inner vertex $v$ of $G$, which consists of two linear orders: one on the set of incoming edges, and the other on the set of outgoing edges of $v$. A digraph $G$ endowed with a framing at each inner vertex is called $framed$. Given a framing on $G$, we define a reflexive and symmetric binary relation on the set of extreme rays of $\mathcal F_+ (G)$. We prove that that the complex of cliques formed by this binary relation is a pure simplicial complex, and that the cones spanned by cliques constitute a unimodular simplicial regular fan $Σ (G)$ covering the entire $\mathcal F_+(G)$. Soit $G=(V,E)$ un graphe orientè, fini et acyclique. Nous nous intéressons, en lien avec l’étude de certains aspects des algèbres amassées, à une classe de triangulations du cône des flots positifs de $G, \mathcal F_+(G)$. Pour construire une triangulation, nous ajoutons une structure en chaque sommet interne $v$ de $G$, constituée de deux ordres totaux : l'un sur l'ensemble des arcs entrants, l'autre sur l'ensemble des arcs sortants de $v$. On dit alors que $G$ est structurè. On définit ensuite une relation binaire réflexive et symétrique sur l'ensemble des rayons extrêmes de $\mathcal F_+ (G)$. Nous démontrons que le complexe des cliques formè par cette relation binaire est un complexe simplicial pur, et que le cône engendré par les cliques forme un éventail régulier simplicial unimodulaire $Σ (G)$ qui couvre complètement $\mathcal F_+(G)$.


1980 ◽  
Vol 33 (2) ◽  
pp. 449 ◽  
Author(s):  
Kailash Kumar

The matrix elements of the linear Boltzmann collision operator are calculated in a Burnett-function basis determined by a weight function which itself describes a velocity distribution with a net drift and an anisotropic pressure (or temperature) tensor. Three different methods of calculation are described, leading to three different types of formulae. Two of these involve infinite summations, while the third involves only finite sums, but at the cost of greater complications in the summands and the integrals over cross sections. Both elastic and inelastic collisions are treated. Special cases arising from particular choices of the parameters in the weight functions are pointed out. The structure of the formulae is illustrated by means of diagrams. The work is a contribution towards establishing efficient methods of calculation based upon a better understanding of the matrix elements in such bases.


2019 ◽  
Vol 45 (3) ◽  
pp. 1-20 ◽  
Author(s):  
Christopher T. Lee ◽  
John B. Moody ◽  
Rommie E. Amaro ◽  
J. Andrew Mccammon ◽  
Michael J. Holst

2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Shuchita Goyal ◽  
Samir Shukla ◽  
Anurag Singh

The matching complex of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. In the last few years the matching complexes of grid graphs have gained much attention among the topological combinatorists. In 2017, Braun and Hough obtained homological results related to the matching complexes of $2 \times n$ grid graphs. Further in 2019, Matsushita showed  that the matching complexes of $2 \times n$ grid graphs are homotopy equivalent to a wedge of spheres. In this article we prove that the matching complexes of $3\times n$ grid graphs are homotopy equivalent to a wedge of spheres. We also give the comprehensive list of the dimensions of spheres appearing in the wedge.  


2010 ◽  
Vol 02 (04) ◽  
pp. 539-552 ◽  
Author(s):  
OLEKSIY BUSARYEV ◽  
TAMAL K. DEY ◽  
YUSU WANG

The persistent homology provides a mathematical tool to describe "features" in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. can compute not only the persistent homology for a filtered simplicial complex, but also representative generating cycles for persistent homology groups. However, if there are dynamic changes either in the filtration or in the underlying simplicial complex, the representative generating cycle can change wildly. In this paper, we consider the problem of tracking generating cycles with temporal coherence. Specifically, our goal is to track a chosen essential generating cycle so that the changes in it are "local". This requires reordering simplices in the filtration. To handle reordering operations, we build upon the matrix framework proposed by Cohen-Steiner et al. to swap two consecutive simplices, so that we can process a reordering directly. We present an application showing how our algorithm can track an essential cycle in a complex constructed out of a point cloud data.


2002 ◽  
Vol 44 (1) ◽  
pp. 41-50 ◽  
Author(s):  
N. S. Witte ◽  
P. J. Forrester ◽  
Christopher M. Cosgrove

AbstractThe probability that an interval I is free of eigenvalues in a matrix ensemble with unitary symmetry is given by a Fredholm determinant. When the weight function in the matrix ensemble is a classical weight function, and the interval I includes an endpoint of the support, Tracy and Widom have given a formalism which gives coupled differential equations for the required probability and some auxiliary quantities. We summarize and extend earlier work by expressing the probability and some of the auxiliary quantities in terms of Painlevé transcendents.


10.37236/7866 ◽  
2019 ◽  
Vol 26 (1) ◽  
Author(s):  
Emily Barnard

A canonical join representation is a certain minimal "factorization" of an element in a finite lattice $L$ analogous to the prime factorization of an integer from number theory. The expression $\bigvee A =w$ is the canonical join representation of $w$ if $A$ is the unique lowest subset of $L$ satisfying $\bigvee A=w$ (where "lowest" is made precise by comparing order ideals under containment). Canonical join representations appear in many familiar guises, with connections to comparability graphs and noncrossing partitions. When each element in $L$ has a canonical join representation, we define the canonical join complex to be the abstract simplicial complex of subsets $A$ such that $\bigvee A$ is a canonical join representation. We characterize the class of finite lattices whose canonical join complex is flag, and show how the canonical join complex is related to the topology of $L$.


10.37236/1828 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Axel Hultman

Let $G$ be a directed graph, and let $\Delta^{ACY}_G$ be the simplicial complex whose simplices are the edge sets of acyclic subgraphs of $G$. Similarly, we define $\Delta^{NSC}_G$ to be the simplicial complex with the edge sets of not strongly connected subgraphs of $G$ as simplices. We show that $\Delta^{ACY}_G$ is homotopy equivalent to the $(n-1-k)$-dimensional sphere if $G$ is a disjoint union of $k$ strongly connected graphs. Otherwise, it is contractible. If $G$ belongs to a certain class of graphs, the homotopy type of $\Delta^{NSC}_G$ is shown to be a wedge of $(2n-4)$-dimensional spheres. The number of spheres can easily be read off the chromatic polynomial of a certain associated undirected graph. We also consider some consequences related to finite topologies and hyperplane arrangements.


Author(s):  
Odell T. Minick ◽  
Hidejiro Yokoo

Mitochondrial alterations were studied in 25 liver biopsies from patients with alcoholic liver disease. Of special interest were the morphologic resemblance of certain fine structural variations in mitochondria and crystalloid inclusions. Four types of alterations within mitochondria were found that seemed to relate to cytoplasmic crystalloids.Type 1 alteration consisted of localized groups of cristae, usually oriented in the long direction of the organelle (Fig. 1A). In this plane they appeared serrated at the periphery with blind endings in the matrix. Other sections revealed a system of equally-spaced diagonal lines lengthwise in the mitochondrion with cristae protruding from both ends (Fig. 1B). Profiles of this inclusion were not unlike tangential cuts of a crystalloid structure frequently seen in enlarged mitochondria described below.


Sign in / Sign up

Export Citation Format

Share Document