Pith. sign in

REVIEW

Quantum graph vertices with minimal number of passbands

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1312.6075 v2 pith:E57SZS6B submitted 2013-12-20 quant-ph math-phmath.MP

Quantum graph vertices with minimal number of passbands

classification quant-ph math-phmath.MP
keywords numbervertexboundaryconditionsconsideredcouplingsgraphsminimal
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem, we reconstruct boundary conditions of scale-invariant vertex couplings. Potential-controlled universal flat filtering properties are found for considered types of vertex couplings. Obtained boundary conditions are approximated by simple graphs carrying only $\delta$ potentials and inner magnetic field.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.