extension:

application: common

Property Types

application: group

Objects

User Functions

  •  
    group_from_cyclic_notation0 (group) → Group

    Constructs a group from a string with generators in cyclic notation. All numbers in the string are 0-based. Example: "(0,2)(1,3)"

    Parameters
    Stringgroup
    generators in cyclic notation
    Returns
    Group
    \@see group_from_cyclic_notation1
  •  
    group_from_cyclic_notation1 (group) → Group

    Constructs a group from a string with generators in cyclic notation. All numbers in the string are 1-based. Example: "(1,3)(2,4)"

    Parameters
    Stringgroup
    generators in cyclic notation
    Returns
    Group
    \@see group_from_cyclic_notation0

application: polytope

Objects

User Functions

  •  
    alternating_group (degree, domain) → GroupOfPolytope

    Constructs an alternating group of given degree.

    Parameters
    Intdegree
    of the alternating group"
    Intdomain
    of the polytope's symmetry group
    Returns
    GroupOfPolytope
    \@see group::alternating_group
  •  
    cs_quotient (Polytope)

    For a centrally symmetric polytope, return the quotient space obtained by dividing out the central symmetry, i.e, identifying diametrically opposite faces

    Parameters
    PPolytope
    , centrally symmetric
  •  
    cyclic_group (degree, domain) → GroupOfPolytope

    Constructs a cyclic group of given degree.

    Parameters
    Intdegree
    of the cyclic group"
    Intdomain
    of the polytope's symmetry group
    Returns
    GroupOfPolytope
    \@see group::cyclic_group
  •  
    cylinder_2 ()

    Return a 2-dimensional cylinder obtained by identifying two opposite sides of a square

  •  
    group_from_cyclic_notation0 (group, domain) → GroupOfPolytope

    Constructs a group from a string with generators in cyclic notation. All numbers in the string are 0-based. Example: "(0,2)(1,3)"

    Parameters
    Stringgroup
    generators in cyclic notation
    Intdomain
    of the polytope symmetry group
    Returns
    GroupOfPolytope
    \@see group_from_cyclic_notation1
  •  
    group_from_cyclic_notation1 (group, domain) → GroupOfPolytope

    Constructs a group from a string with generators in cyclic notation. All numbers in the string are 1-based. Example: "(1,3)(2,4)"

    Parameters
    Stringgroup
    generators in cyclic notation
    Intdomain
    of the polytope symmetry group
    Returns
    GroupOfPolytope
    \@see group_from_cyclic_notation0
  •  
    max_interior_simplices (P) → Array<Set>

    Find the maximal interior simplices of a polytope P. Symmetries of P are NOT taken into account.

    Parameters
    PolytopeP
    the input polytope
    Returns
    Array<Set>
  •  
    max_interior_simplices (P)

    find the maximal interior simplices of a point configuration that DO NOT contain any point in their closure, except for the vertices. Symmetries of the configuration are NOT taken into account.

    Parameters
    PointConfigurationP
    the input point configuration
  •  
    quarter_turn_manifold ()

    Return the 3-dimensional Euclidean manifold obtained by identifying opposite faces of a 3-dimensional cube by a quarter turn. After identification, two classes of vertices remain.

  •  
    symmetric_group (degree, domain) → GroupOfPolytope

    Constructs a symmetric group of given degree.

    Parameters
    Intdegree
    of the symmetric group"
    Intdomain
    of the polytope's symmetry group
    Returns
    GroupOfPolytope
    \@see group::symmetric_group
  •  
    write_foldable_max_signature_ilp (P, outfile_name)

    construct a linear program whose optimal value is an upper bound for the algebraic signature of a triangulation of P.

    Parameters
    PolytopeP
    Stringoutfile_name
  •  
    write_quotient_space_simplexity_ilp ()

    outputs a linear program whose optimal value is a lower bound for the number of simplices necessary to triangulate the polytope in such a way that its symmetries respect the triangulation of the boundary.

  •  
    write_simplexity_ilp (P, outfile_name)

    construct a linear program whose optimal value is a lower bound for the minimal number of simplices in a triangulation of P.

    Parameters
    PolytopeP
    Stringoutfile_name