Math-3731 · mathematics · Graph theory

Math-3731

Reconstruction and Response Sets of AC Networks

Status Partially solved · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedPartially solvedOpen

Statement

Definitions and mathematical statement

The supplied record asks for reconstruction and classification of alternating-current networks. The following standard network model makes the response matrix explicit; the source qualifications that remain unresolved are stated below.

Let $b\geq 1$, and let $G=(V,E)$ be a finite connected undirected graph with a labeled boundary set $B=\{v_1,\ldots,v_b\}\subseteq V$ and interior set $I=V\setminus B$. Assign a complex conductance $c_e$ to each edge. Provisionally interpret "positive-real conductances" as \[ \operatorname{Re}c_e>0\qquad(e\in E). \] The supplied record does not explicitly define this phrase or specify the graph conventions; these choices require confirmation against the source.

For boundary potentials $f\in{\mathbb{C}}^b$, extend $f$ to potentials $u:V\to{\mathbb{C}}$ satisfying Kirchhoff's law at every interior vertex: \[ u(v_j)=f_j\quad(1\leq j\leq b),\qquad \sum_{e=\{v,w\}\in E}c_e\left(u(v)-u(w)\right)=0\quad(v\in I), \] where each sum is over edges incident to its indicated vertex. The boundary current is \[ J_j=\sum_{e=\{v_j,w\}\in E}c_e\left(f_j-u(w)\right),\qquad 1\leq j\leq b. \] Under the strict positivity convention above, this defines the response matrix $\Lambda_{G,c}\in{\mathbb{C}}^{b\times b}$ by $J=\Lambda_{G,c}f$. Equivalently, if $L$ is the weighted graph Laplacian partitioned by $V=B\sqcup I$, then \[ \Lambda_{G,c}=L_{BB}-L_{BI}L_{II}^{-1}L_{IB}, \] with $\Lambda_{G,c}=L_{BB}$ when $I=\varnothing$. For a specified class $\mathcal G$ of such graphs with labeled boundary, define its response set by \[ \mathcal R_b(\mathcal G)=\left\{\Lambda_{G,c}:G\in\mathcal G,\ \operatorname{Re}c_e>0\text{ for every }e\in E(G)\right\}. \]

The requested tasks are as follows.

  1. Given $b$ and a matrix $\Lambda$ known to arise from a connected alternating-current network, give an algorithm producing a network $G$ and admissible edge conductances $c$ with $\Lambda_{G,c}=\Lambda$. The target is a realizing network; the record supplies no uniqueness requirement or information sufficient to identify an original network.
  2. Characterize the response set for series-parallel networks. The record does not specify whether this means two-terminal series-parallel networks or another graph class, or how the $b$ boundary vertices participate in the series-parallel construction. Consequently this part does not yet specify a unique class $\mathcal G$.
  3. Characterize $\mathcal R_b(\mathcal G_{\mathrm{out}})$, where $\mathcal G_{\mathrm{out}}$ consists of graphs admitting a planar embedding in which every boundary vertex lies on the outer face. The record does not specify whether a cyclic order of the labeled boundary vertices is prescribed.
  4. For each fixed graph $G$ and fixed assignment $\sigma:E(G)\to\{1,-1\}$, put $c_e(\omega)=\omega^{\sigma(e)}$. Describe all response-matrix functions \[ \omega\longmapsto\Lambda_{G,c(\omega)} \] obtainable in this manner. Under the provisional strict positive-real convention, a common admissible parameter domain is $\{\omega\in{\mathbb{C}}:\operatorname{Re}\omega>0\}$. The supplied record gives no parameter domain, does not state whether singular or boundary parameter values are included, and does not explicitly say whether this part concerns all connected networks or one of the restricted classes above. These qualifications remain unresolved; the displayed domain is conditional on the stated convention.
The supplied formulation gives a realizability promise for the reconstruction input. Its accompanying literature assessment also mentions realizability, but does not specify a separate decision problem for arbitrary input matrices.

Short English statement

Reconstruct an alternating-current network from its boundary response matrix, characterize the responses of series-parallel networks and planar networks whose boundary vertices lie on the outer face, and classify response functions when every edge conductance is $\omega$ or $1/\omega$. The meaning of positive-real conductance, the series-parallel boundary convention, the planar boundary order, and the parameter domain require source clarification. The supplied dated curation labels the problem partially solved; this draft does not independently verify that assessment.

Sources

  • Supplied local UnsolvedMath registry record, permanent ID $30002818$, title Reconstruction and Response Sets of AC Networks, source problem code catalogue entry, in the Oberwolfach Reports Open Problems collection. The record associates the problem with 2015 and names no individual proposer.
  • Discrete Differential Geometry (2015), Oberwolfach Reports, DOI 10.4171/owr/2015/13, pp. 661--729. Supplied source report and literature link: https://doi.org/10.4171/owr/2015/13. The record describes Oberwolfach Reports as documenting mathematical workshops and their open-problem discussions; it supplies no more specific page or problem locator within this report.
  • Rote, "response maps of AC networks" (label supplied by the registry): https://arxiv.org/abs/1904.02031. No fuller bibliographic details are supplied.
  • Literature assessment dated exactly 2026-08-21: the supplied curation labels the problem partially solved and states that Rote solves reconstruction and realizability, while the series-parallel, planar, and variable-conductance classification questions in the extracted record are not all resolved. This is supplied dated curation derived from the OWR record, not independently verified literature assessment. The record expressly requests independent verification of time-sensitive status and cited claims.
  • The registry labels the statement corrected_verified and reports a manual semantic, typographic, and LaTeX review of its cleanup. These are supplied editorial claims and do not establish mathematical correctness or independent source verification of this draft.

Catalogue entry

Statement licence: CC-BY-SA-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.