Generalized Tree-Cotree Gauge

• Generalized tree-cotree gauge is a graph-based method that decomposes a mesh into a spanning tree and its cotree to eliminate nullspaces in discrete electromagnetics.
• It extends the classical gauge by incorporating adaptations for isogeometric analysis, mortared multi-patch domains, reduced-basis approximations, and hierarchical refinements.
• This approach improves numerical stability, reduces memory usage, and offers scalable solutions for parallel-decomposed and low-frequency Maxwell formulations.

Searching arXiv for recent and foundational papers on generalized tree-cotree gauge and related formulations. First, I’ll retrieve the main tree-cotree and generalized-gauge papers directly relevant to the topic. Generalized tree-cotree gauge denotes a family of gauge-fixing constructions in which a graph-theoretic decomposition into a spanning tree and its complementary cotree is used to remove nonphysical nullspaces from discrete electromagnetic formulations, especially curl-curl systems written in terms of vector potentials. In the cited literature, the basic mechanism is to identify degrees of freedom associated with a tree, eliminate or constrain them, and retain cotree variables as a parameterization of the physically relevant subspace. Recent work extends this classical idea to reduced-basis workflows, mortared multi-patch isogeometric spaces, dual-primal domain decomposition, hierarchical splines, and low-frequency-stable two-step Maxwell formulations; a separate line of work in scattering amplitudes provides a closely related algebraic analogue in which the nullspace of a propagator matrix generates generalized gauge freedom in numerator representations (Kapidani et al., 2021, Ziegler et al., 2024, Mally et al., 2024, Merkel et al., 1 Dec 2025, Herles et al., 19 Feb 2025, Vaman et al., 2010).

1. Core mechanism and mathematical role

The classical tree-cotree gauge arises because curl-based formulations of Maxwell or magnetostatic problems are not unique. In the vector-potential formulation, if $\xi$ is a sufficiently smooth scalar field, then

$\mathbf{A}'=\mathbf{A}+\nabla \xi$

produces the same magnetic field because $\nabla\times\nabla\xi=0$. Discretely, this appears as a nontrivial kernel of the curl-curl operator, so the linear system is singular unless a gauge condition removes gradient-type null modes; on nontrivial topologies, harmonic fields must also be treated (Kapidani et al., 2021).

In the tree-cotree construction, the mesh or control mesh is interpreted as a graph with edge-associated unknowns. A spanning tree $T\subset E$ is chosen, and the cotree is its complement

$C=E\setminus T.$

The tree degrees of freedom are eliminated or fixed, while the cotree degrees of freedom parameterize the reduced system. In the simplest block form this is written as

$$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$

which removes the discrete gradient kernel for simply connected domains (Kapidani et al., 2021).

Across the cited electromagnetics papers, the adjective “generalized” does not refer to a single universal new constraint. It refers to adaptations of the classical tree-cotree gauge to settings where nullspace removal must remain compatible with additional structure such as reduced-order modeling, mortar coupling, hierarchical refinement, low-frequency stabilization, or local solvability in parallel subdomain methods (Ziegler et al., 2024, Mally et al., 2024, Herles et al., 19 Feb 2025).

Setting	Nullspace or redundancy	Generalized feature
Classical magnetostatics / Maxwell	Gradient fields; on non-contractible domains also harmonic fields	Spanning tree and cotree on mesh or control mesh
Reduced-basis Maxwell eigenproblem	Spurious eigenmodes from the curl-curl nullspace	Sparse full solves plus cotree projection
Mortared multi-patch $H(\mathrm{curl})$	Enlarged kernel from interface vertices	Modified tree plus multiplier-space enrichment
Dual-primal TI / IETI-DP magnetostatics	Local singularity after decomposition	Compatible trees and primal DOF selection
Hierarchical splines	Gradient-field non-uniqueness under local refinement	One tree per refinement level
Two-step Maxwell	Low-frequency breakdown in the vector-potential step	Region-wise scaled divergence constraint plus tree-cotree split

2. Isogeometric and mortared $H(\mathrm{curl})$ formulations

In isogeometric analysis, tree-cotree gauging is transferred from low-order finite elements to spline spaces by exploiting the correspondence between spline basis functions and entities of the control mesh. For single-patch spaces, the spline de Rham sequence is built so that the derivative structure is represented by incidence matrices of the control mesh, and basis functions of $S_p^1$ correspond to control-mesh edges. This makes it possible to construct the tree-cotree decomposition directly on the control mesh, independently of spline degree (Kapidani et al., 2021).

For mortared multi-patch domains, the discrete kernel is more subtle. The field space is defined patchwise, while nonmatching interfaces are coupled weakly through a Lagrange multiplier space on $\Gamma_{\mathrm{int}}$. In this setting the paper shows

$\mathbf{A}'=\mathbf{A}+\nabla \xi$0

and states that the equality $\mathbf{A}'=\mathbf{A}+\nabla \xi$1 fails in general because interface vertices on $\mathbf{A}'=\mathbf{A}+\nabla \xi$2 generate additional kernel functions. The paper conjectures and numerically verifies

$\mathbf{A}'=\mathbf{A}+\nabla \xi$3

so the classical gauge must be modified to account for interface-induced nullspace contributions (Kapidani et al., 2021).

The remedy has two components. First, the multiplier space is enriched:

$\mathbf{A}'=\mathbf{A}+\nabla \xi$4

This enrichment is introduced specifically because the naive multiplier space, although stable for standard mortaring, is not sufficient when gauging is required. Second, the tree construction on the dependent subdomain is modified so that the interface is treated like a Dirichlet boundary during tree growth, but interface degrees of freedom are restored to the cotree because they remain coupled through the mortar multiplier. The resulting gauged mortared system is a reduced nonsingular cotree system, and the paper reports stable inf-sup behavior, elimination of spurious zero modes, and optimal convergence on a realistic permanent magnet synchronous machine model (Kapidani et al., 2021).

A common misconception is that a spanning tree alone always suffices. In the mortared setting this is false: additional interface-vertex kernel functions require multiplier-space enrichment, so the gauge is a coupled graph-theoretic and variational construction rather than a purely combinatorial one (Kapidani et al., 2021).

3. Reduced-basis approximation and the mixed tree-cotree gauge

For the Maxwell eigenvalue problem, the continuous cavity problem

$\mathbf{A}'=\mathbf{A}+\nabla \xi$5

leads after IGA discretization to the generalized eigenvalue problem

$\mathbf{A}'=\mathbf{A}+\nabla \xi$6

with parameter-dependent matrices. The discrete curl-curl operator has a nontrivial nullspace, so gradient fields produce spurious eigenmodes. The tree-cotree gauge removes these nonphysical solutions by selecting cotree degrees of freedom as the reduced coordinate system (Ziegler et al., 2024).

The classical cotree formulation is expressed using

$\mathbf{A}'=\mathbf{A}+\nabla \xi$7

together with the transformed cotree matrices

$\mathbf{A}'=\mathbf{A}+\nabla \xi$8

and the variable transformation

$\mathbf{A}'=\mathbf{A}+\nabla \xi$9

This directly removes the gradient nullspace, but the paper emphasizes that the transformed cotree matrices are dense and ill-conditioned, which increases memory use and runtime (Ziegler et al., 2024).

The paper’s “mixed tree-cotree gauge” is therefore an implementation-level generalization rather than a new mathematical gauge constraint in the strict sense. During initialization and POD, it solves the sparse full high-fidelity eigenproblem and projects the eigenvectors to cotree coordinates by

$\nabla\times\nabla\xi=0$0

These projected snapshots form the matrix $\nabla\times\nabla\xi=0$1, from which the reduced basis $\nabla\times\nabla\xi=0$2 is built. During greedy enrichment, reduced matrices are assembled as

$\nabla\times\nabla\xi=0$3

or equivalently using

$\nabla\times\nabla\xi=0$4

The residual-based error estimator uses

$\nabla\times\nabla\xi=0$5

which permits greedy evaluation without solving the full high-fidelity problem at every parameter sample (Ziegler et al., 2024).

The significance of this mixed formulation is operational. The gauge is not merely a preprocessing step: it is embedded into snapshot generation, POD, greedy enrichment, and reduced online/offline assembly. The reported advantages are lower memory consumption, lower runtime for basis construction, improved accuracy relative to the classical tree-cotree formulation in the tests, and better scalability as problem size grows (Ziegler et al., 2024).

4. Parallel-compatible and hierarchical extensions

In dual-primal tearing-and-interconnecting for 3D magnetostatics, a direct transfer of the classical global tree-cotree gauge is insufficient because every local subdomain problem must be uniquely solvable to enable parallel factorization. The adapted construction therefore combines tree-cotree gauging with a dual-primal splitting. The tree is built hierarchically across the wire basket, the boundary graph, and the subdomain interior, using Kruskal’s algorithm with an explicit weight hierarchy:

• weight 1: $\nabla\times\nabla\xi=0$6
• weight 2: remaining $\nabla\times\nabla\xi=0$7
• weight 3: remaining $\nabla\times\nabla\xi=0$8
• weight 4: remaining $\nabla\times\nabla\xi=0$9
• weight 5: remaining $T\subset E$0 and $T\subset E$1
• weight 6: remaining $T\subset E$2
• weight 7: remaining interior edges

This priority order enforces compatibility with mixed boundary conditions, interface structure, and subdomain coupling. The paper’s central theorem is summarized as “Local Connectedness implies Local Invertibility”: the reduced local matrix $T\subset E$3 is invertible if the graph formed by the locally eliminated degrees of freedom is connected. For non-simply connected domains, an extra tree edge may be required to eliminate the harmonic kernel (Mally et al., 2024).

A different generalization appears for two-dimensional hierarchical splines. There, the obstacle is that no single global auxiliary grid survives adaptive local refinement. The proposed remedy is to build one spanning tree $T\subset E$4 on each level’s Greville subgrid $T\subset E$5, with the ordered growth rule boundary $T\subset E$6 active $T\subset E$7 deactivated. In minimum-spanning-tree form this is implemented by

$T\subset E$8

Only the active tree edges from all levels are retained in the final gauge,

$T\subset E$9

This is the multi-level tree, and the multi-level cotree is the complement among active edges and basis functions (Merkel et al., 1 Dec 2025).

The hierarchical construction is explicitly level-wise rather than global. For $C=E\setminus T.$0, the paper states that hierarchical spline spaces coincide with standard bilinear finite elements, so the same construction applies to quadrilateral meshes with hanging nodes. Validation is performed through a Maxwell eigenvalue problem, and the paper reports that the eigenvalues of the gauged formulation match the nonzero eigenvalues of the ungauged formulation for both $C=E\setminus T.$1 and $C=E\setminus T.$2 (Merkel et al., 1 Dec 2025).

Taken together, these two extensions show that “generalized” can mean either parallel-compatible solvability under domain decomposition or refinement-compatible gauging under multi-level spline hierarchies. In both cases the tree-cotree principle is preserved, but the admissible tree is constrained by structure beyond simple graph connectivity (Mally et al., 2024, Merkel et al., 1 Dec 2025).

5. Two-step Maxwell formulations and low-frequency stabilization

A distinct use of the term appears in a two-step formulation of the full frequency-domain Maxwell system. The method splits the computation into an electroquasistatic problem for the electric scalar potential $C=E\setminus T.$3 and a magnetic vector-potential problem for $C=E\setminus T.$4. The magnetic step is governed by

$C=E\setminus T.$5

with

$C=E\setminus T.$6

As $C=E\setminus T.$7, $C=E\setminus T.$8, and $C=E\setminus T.$9 is singular because the curl-curl operator annihilates gradient fields. The original implicit gauge degenerates in air and becomes numerically weak, producing low-frequency breakdown (Herles et al., 19 Feb 2025).

In this setting the electroquasistatic step acts as a gauge condition. The source decomposition is written as

$$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$0

and the second step implies a generalized Coulomb-type divergence constraint on $$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$1 involving $$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$2. The stabilization augments this with region-wise scaling,

$$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$3

where the experiments use

$$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$4

The tree-cotree decomposition is applied to the magnetic vector-potential degrees of freedom over the entire domain, not only in the conductor (Herles et al., 19 Feb 2025).

The paper presents two variants. In Method 1, after reordering into cotree and tree variables,

$$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$5

a redundant low-frequency row is replaced by the discrete gauge equation

$$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$6

In Method 2, the tree degrees of freedom are eliminated by

$$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$7

leading to a reduced Schur-complement system (Herles et al., 19 Feb 2025).

The paper emphasizes that this generalized tree-cotree gauge is not merely “setting tree DOFs to zero.” Its function is to enforce a divergence-compatible constraint that remains consistent with the partial decoupling of scalar and vector potentials. The reported examples show that the original formulation becomes singular in the static limit, while the stabilized variants retain finite condition numbers and small gauge residuals over the frequency range considered (Herles et al., 19 Feb 2025).

6. Algebraic analogues and broader conceptual usage

The term “generalized tree-cotree gauge” is not used uniformly across all parts of mathematical physics. In tree-level scattering amplitudes, the closest analogue is an explicitly linear-algebraic description in which the amplitude data are written as

$$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$8

Here $$\begin{bmatrix} \mathbf{K}_{CC} & \mathbf{K}_{CT}\ \mathbf{K}_{TC} & \mathbf{K}_{TT} \end{bmatrix} \begin{bmatrix} \mathbf{a}_C\ \mathbf{a}_T \end{bmatrix} = \begin{bmatrix} \mathbf{j}_C\ \mathbf{j}_T \end{bmatrix}, \qquad \mathbf{a}_T=0,$$9 is a propagator matrix, $H(\mathrm{curl})$0 is a Kleiss-Kuijf basis of color-ordered amplitudes, and $H(\mathrm{curl})$1, $H(\mathrm{curl})$2, and $H(\mathrm{curl})$3 are numerator and color vectors in the same ordering. For an $H(\mathrm{curl})$4-particle process, $H(\mathrm{curl})$5 has

$H(\mathrm{curl})$6

independent null eigenvectors $H(\mathrm{curl})$7, yielding relations

$H(\mathrm{curl})$8

The numerator freedom

$H(\mathrm{curl})$9

is the generalized gauge freedom of the amplitude representation. The paper does not literally use the term “tree-cotree gauge,” but it identifies the kernel of $H(\mathrm{curl})$0 as the algebraic origin of redundancy, BCJ amplitude relations, and KLT/double-copy structure, which is the closest tree-level analogue of quotienting by null directions in a tree-cotree construction (Vaman et al., 2010).

A further conceptual extension appears in the theory of generalized gauge fields with mixed Young symmetries. There the issue is not a tree-cotree algorithm but the structure of sources and gauge representations. The paper states that the analog of a point source is a special brane whose worldsheet has another brane interwoven into it, a “current within a current,” and derives the generalized Dirac quantization condition

$H(\mathrm{curl})$1

This provides geometric motivation for nested constraint structures, but not an explicit tree-cotree gauge-fixing method (Bunster et al., 2013).

A recurring source of confusion is therefore terminological. In computational electromagnetics, generalized tree-cotree gauge refers to a practical nullspace-removal construction grounded in graph topology and compatible discretization. In amplitude theory, the analogue is the nullspace of the propagator matrix. In mixed-symmetry gauge theory, the connection is only conceptual. What unifies these usages is the same structural motif: physical data live in a reduced quotient space, while null directions represent redundant degrees of freedom that must be fixed, projected out, or parameterized in a compatible way (Vaman et al., 2010, Bunster et al., 2013).