Manakov system on metric graphs: Modeling the reflectionless propagation of vector solitons in networks

Abstract

We consider the reflectionless transport of Manakov solitons in networks. The system is modelled in terms of the Manakov system on metric graphs subject to transparent boundary conditions at the branching points. Simple constraints combining the equivalent usual Kirchhoff vertex conditions with the transparent conditions are derived in terms of nonlinearity coefficients. Although the method is used for a metric star graph, an extension to more complicated graph topologies is easily possible.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…