File: morse_matching_properties.rules

package info (click to toggle)
polymake 4.15-2
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 35,892 kB
  • sloc: cpp: 168,945; perl: 43,410; javascript: 31,575; ansic: 3,007; java: 2,654; python: 632; sh: 268; xml: 117; makefile: 61
file content (60 lines) | stat: -rw-r--r-- 2,244 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#  Copyright (c) 1997-2024
#  Ewgenij Gawrilow, Michael Joswig, and the polymake team
#  Technische Universität Berlin, Germany
#  https://polymake.org
#
#  This program is free software; you can redistribute it and/or modify it
#  under the terms of the GNU General Public License as published by the
#  Free Software Foundation; either version 2, or (at your option) any
#  later version: http://www.gnu.org/licenses/gpl.txt.
#
#  This program is distributed in the hope that it will be useful,
#  but WITHOUT ANY WARRANTY; without even the implied warranty of
#  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
#  GNU General Public License for more details.
#-------------------------------------------------------------------------------


# @category Topology
# A Morse matching is a reorientation of the arcs in the Hasse diagram of a simplicial complex
# such that at most one arc incident to each face is reoriented (matching condition) and the
# resulting orientation is acyclic (acyclicity condition). Morse matchings capture the main
# structure of discrete Morse functions, see
#
#	Robin Forman: Morse Theory for Cell-Complexes,
#	Advances in Math., 134 (1998), pp. 90-145.
#
# This property is computed by one of two heuristics. The default heuristic is
# a simple greedy algorithm ([[topaz::SimplicialComplex|greedy]]). The alternative is to use a canceling algorithm
# due to Forman ([[topaz::SimplicialComplex|cancel]]) or both ([[topaz::SimplicialComplex|both]]) together. Note that the computation of a Morse matching of largest
# size is NP-hard. See
#
#	Michael Joswig, Marc E. Pfetsch: Computing Optimal Morse Matchings
#	SIAM J. Discrete Math., 2006, to appear
#
# @relates objects/SimplicialComplex
declare object MorseMatching {


# Size of the computed Morse matching.
property SIZE : Int;


# The critical faces of the computed Morse matching, i.e., the faces not
# incident to any reoriented arc (not matched).
property CRITICAL_FACES : Array<Set>;


# The vector of critical faces in each dimension.
property CRITICAL_FACE_VECTOR : Array<Int>;


# Number of critical faces of the computed Morse matching.
property N_CRITICAL_FACES : Int;

}

# Local Variables:
# mode: perl
# c-basic-offset:3
# End: