Wolfram Language Paclet Repository

Community-contributed installable additions to the Wolfram Language

Primary Navigation

    • Cloud & Deployment
    • Core Language & Structure
    • Data Manipulation & Analysis
    • Engineering Data & Computation
    • External Interfaces & Connections
    • Financial Data & Computation
    • Geographic Data & Computation
    • Geometry
    • Graphs & Networks
    • Higher Mathematical Computation
    • Images
    • Knowledge Representation & Natural Language
    • Machine Learning
    • Notebook Documents & Presentation
    • Scientific and Medical Data & Computation
    • Social, Cultural & Linguistic Data
    • Strings & Text
    • Symbolic & Numeric Computation
    • System Operation & Setup
    • Time-Related Computation
    • User Interface Construction
    • Visualization & Graphics
    • Random Paclet
    • Alphabetical List
  • Using Paclets
    • Get Started
    • Download Definition Notebook
  • Learn More about Wolfram Language

Hypergraph

Guides

  • Hypergraph Functionality

Tech Notes

  • Hypergraph Rewriting

Symbols

  • AdjacencyHypergraph
  • AdjacencyTensor
  • CanonicalHypergraph
  • CanonicalHypergraphRule
  • ConnectedHypergraphQ
  • CyclicEdge
  • EdgeListTagged
  • EdgeMultiplicity
  • EdgeSymmetry
  • EnumerateHypergraphRules
  • EnumerateHypergraphs
  • EnumerateOrderedHypergraphs
  • EnumerateWolframModelRules
  • HighlightRule
  • HyperedgeList
  • Hyperedge
  • Hyperedges
  • HyperedgesQ
  • Hypergraph3D
  • HypergraphArityReduce
  • HypergraphDraw
  • HypergraphEmbedding
  • HypergraphHadamardProduct
  • HypergraphIncidenceMatrix
  • HypergraphIncidence
  • HypergraphInsertionBracketDegree
  • HypergraphInsertionBracket
  • HypergraphInsertion
  • HypergraphLargeQ
  • Hypergraph
  • HypergraphQ
  • HypergraphRuleDraw
  • HypergraphRule
  • HypergraphRuleQ
  • HypergraphToGraph
  • HypergraphTransitionMatrix
  • HypergraphUnion
  • HypermatrixGraph
  • Hypermatrix
  • HypermatrixQ
  • IncidenceHypergraph
  • IsomorphicHypergraphQ
  • KoszulSign
  • LinkedHypergraph
  • OrderedHypergraphToGraph
  • RandomAllHypergraph
  • RandomConnectedHypergraph
  • RandomHypergraph
  • RandomHypergraphRule
  • SetHypergraphSummaryThresholds
  • SimpleHypergraph
  • SimpleHypergraphPlot3D
  • SimpleHypergraphPlot
  • SimpleHypergraphQ
  • ToLabeledEdges
  • ToLabeledPatternEdges
  • ToOrderedHypergraph
  • ToPatternRules
WolframInstitute`Hypergraph`
HypergraphInsertionBracket
​
HypergraphInsertionBracket
[hg1,hg2,…]
gives the graded antisymmetric insertion bracket of the hypergraphs hg1, hg2, …, as an association from resulting hypergraphs to integer coefficients.
​
​
HypergraphInsertionBracket
[assoc1,hg2,…]
extends the bracket linearly whenever an argument is given as an association <|hg -> c, …|>, representing a formal sum of hypergraphs.
​
Details and Options
▪
Inserting a hypergraph hg' at a vertex v of a hypergraph hg identifies v with the root of hg', which by convention is the first vertex in
VertexList
[hg'].
▪
For two hypergraphs, the bracket sums the insertions of hg2 into hg1 at every vertex of hg1, minus the insertions of hg1 into hg2 at every vertex of hg2, each term carrying a sign from the Koszul convention applied to the (graded) vertex being replaced.
▪
For n hypergraphs, the bracket sums consecutive insertions of all n arguments over every permutation of their order, each term signed by the permutation's parity together with the Koszul sign of the insertion.
▪
Terms are collected up to isomorphism: results that agree after canonicalization are merged by adding their coefficients, and terms whose coefficients cancel to 0 are dropped from the resulting association.
▪
Insertion at a vertex only happens when that vertex's "Degree" annotation (see
HypergraphInsertionBracketDegree
) matches the degree of the root of the inserted hypergraph; every vertex defaults to degree 0, so plain hypergraphs (with no degree annotations) insert at every vertex.
▪
For n = 2, the bracket satisfies the antisymmetry of a graded Lie bracket: swapping the two arguments negates the result.
▪
The following option can be given:
option
default
effect
"Kind"
"Ordered"
which isomorphism classes of hypergraphs the bracket is computed on
▪
Possible settings for
"Kind"
include:
▪
|
"Ordered"
| hypergraphs up to relabeling of (possibly graded) ordered vertices | |
"Rooted"
| hypergraphs with a distinguished root vertex | |
"Tagged"
| hypergraphs with a distinguished (tagged) hyperedge |
​
Examples  
(7)
Basic Examples  
(2)
Compute the insertion bracket of a triangle and a single edge:
In[1]:=
DatasetKeyMapEdgeList,
HypergraphInsertionBracket

Hypergraph
[{{1,2,3}}],
Hypergraph
[{{1,2}}]
Out[1]=
{1,2}
{1,3,4}
1
{2,3}
{1,2,4}
1
{3,4}
{1,2,3}
1
{1,4}
{1,2,3}
-1
{1,2}
{2,3,4}
-1
_________________________________________________________________________________________________________________
The bracket of a hypergraph with itself vanishes:
In[1]:=
HypergraphInsertionBracket

Hypergraph
[{{1,2}}],
Hypergraph
[{{1,2}}]
Out[1]=

Scope  
(2)

Properties & Relations  
(2)

Possible Issues  
(1)

SeeAlso
HypergraphInsertionBracketDegree
 
▪
CanonicalHypergraph
 
▪
IsomorphicHypergraphQ
 
▪
Hypergraph
RelatedGuides
▪
HypergraphFunctionality
""

© 2026 Wolfram. All rights reserved.

  • Legal & Privacy Policy
  • Contact Us
  • WolframAlpha.com
  • WolframCloud.com