Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2020
Hodge Laplacians on Graphs
This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph Laplacian. We will discuss basic properties including cohomology and Hodge theory. The main feature of our approach is simplicity, requiring ...
- research-articleNovember 2019
3D hodge decompositions of edge- and face-based vector fields
ACM Transactions on Graphics (TOG), Volume 38, Issue 6Article No.: 181, Pages 1–13https://doi.org/10.1145/3355089.3356546We present a compendium of Hodge decompositions of vector fields on tetrahedral meshes embedded in the 3D Euclidean space. After describing the foundations of the Hodge decomposition in the continuous setting, we describe how to implement a five-...
- articleDecember 2018
The cohomological and the resource-theoretic perspective on quantum contextuality: common ground through the contextual fraction
We unify the resource-theoretic and the cohomological perspective on quantum contextuality. At the center of this unification stands the notion of the contextual fraction. For both symmetry and parity based contextuality proofs, we establish ...
- articleNovember 2017
Topological proofs of contextuality in qunatum mechanics
We provide a cohomological framework for contextuality of quantum mechanics that is suited to describing contextuality as a resource in measurement-based quantum computation. This framework applies to the parity proofs first discussed by Mermin, as well ...
- tutorialJune 2014
Computing Topological Persistence for Simplicial Maps
SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometryPages 345–354https://doi.org/10.1145/2582112.2582165Algorithms for persistent homology are well-studied where homomorphisms are induced by inclusion maps. In this paper, we propose a practical algorithm for computing persistence under Z2 coefficients for a (monotone) sequence of general simplicial maps ...
- research-articleApril 2014
Cyclic network automata and cohomological waves
IPSN '14: Proceedings of the 13th international symposium on Information processing in sensor networksPages 215–224Following Baryshnikov-Coffman-Kwak, we use cyclic network automata (CNA) to generate a decentralized protocol for dynamic coverage problems in a sensor network, with only a small fraction of sensors awake at every moment. This paper gives a rigorous ...
- ArticleMay 2011
Cup products on polyhedral approximations of 3D digital images
IWCIA'11: Proceedings of the 14th international conference on Combinatorial image analysisPages 107–119Let I be a 3D digital image, and let Q(I) be the associated cubical complex. In this paper we show how to simplify the combinatorial structure of Q(I) and obtain a homeomorphic cellular complex P(I) with fewer cells. We introduce formulas for a diagonal ...
- ArticleJune 2009
Connectivity Forests for Homological Analysis of Digital Volumes
IWANN '09: Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient IntelligencePages 415–423https://doi.org/10.1007/978-3-642-02478-8_52In this paper, we provide a graph-based representation of the homology (information related to the different "holes" the object has) of a binary digital volume. We analyze the digital volume AT-model representation [8] from this point of view and the ...
- invited-talkJuly 2008
Digital atlases and difference forms
ISSAC '08: Proceedings of the twenty-first international symposium on Symbolic and algebraic computationPages 3–4https://doi.org/10.1145/1390768.1390770When integrating a differential equation numerically, it can be important for the solution method to reflect the geometric properties of the original model. These include
conservation laws and first integrals, symmetries, and symplectic or variational ...
- ArticleJune 2007
Linear Transformations in Boolean Complexity Theory
CiE '07: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real WorldPages 307–315https://doi.org/10.1007/978-3-540-73001-9_32We attempt to understand a cohomological approach to lower bounds in Boolean circuits (of [Fri05]) by studying a very restricted case; in this case Boolean complexity is described via the kernel (or nullspace) of a fairly simple linear transformation ...
- articleMay 2003
Cohomology, stratifications and parametric Gröbner bases in characteristic zero
Journal of Symbolic Computation (JOSC), Volume 35, Issue 5Pages 527–542https://doi.org/10.1016/S0747-7171(03)00019-1Let PK (n,d) be the set of polynomials in n variables of degree at most d over the field K of characteristic zero. We show that there is a number c n,d such that if f ∈ PK (n,d) then the algebraic de Rham cohomology group HdR i (Kn \Var(f)) has ...
- articleMarch 2002
A Characterisation of the Generalized Quadrangle Q (5, q) Using Cohomology
Journal of Algebraic Combinatorics: An International Journal (KLU-JACO), Volume 15, Issue 2Pages 107–125https://doi.org/10.1023/A:1013812619953If a GQ \S^\prime of order ( s, s ) is contained in a GQ \S of order ( s, s 2) as a subquadrangle, then for each point X of \S{\setminus}\S^\prime the set of points \O_X of \S^\prime collinear with X form an ovoid of \S^\prime . Thas and Payne ...
- research-articleNovember 1998
The Algebra of Flows in Graphs
Advances in Applied Mathematics (AAMA), Volume 21, Issue 4Pages 644–684https://doi.org/10.1006/aama.1998.0610We define a contravariant functorKfrom the category of finite graphs and graph morphisms to the category of finitely generated graded abelian groups and homomorphisms. For a graphX, an abelian groupB, and a nonnegative integerj, an element of Hom(Kj(X),...
- articleOctober 1996
Subspace Arrangements of Type Bn and Dn
Journal of Algebraic Combinatorics: An International Journal (KLU-JACO), Volume 5, Issue 4Pages 291–314https://doi.org/10.1023/A:1022492431260Let {\cal D}_{n, k} be the family of linear subspaces of \Bbb {R}^n given by all equations of the form \epsilon_1x_{i_1}=\epsilon_2 x_{i_2} = \cdots = \epsilon_k x_{i_k} for 1 \leq i_1 \lt \cdots \lt i_k \leq n and (\epsilon_1,\ldots , \epsilon_k)\...
- doctoral_thesisMay 1991