Differentiability conjecture for mixed transport-diffusion quantum graph semigroups
Differentiability conjecture for mixed transport-diffusion quantum graph semigroups
Let be the set of transport edges and the set of diffusive edges. Let generate the semigroup on the state space , with boundary conditions determined by and . Let denote the length of the longest path contained in , computed while taking into account possibly coupled boundary conditions. For transport-supported initial data, the semigroup shifts the profile without smoothing until it reaches an endpoint.
Differentiability conjecture. If , then the semigroup is differentiable for every ; equivalently, for every , the map
is differentiable.
The transport component prevents immediate smoothing, analyticity, and immediate differentiability before profiles reach diffusive edges. The conjecture predicts that the diffusive part smooths the semigroup after the maximal transport-path length, even when the boundary conditions couple transport and diffusion components.
Sources & referencesView supporting material
Primary source
Amru Hussein and Delio Mugnolo, “Quantum graphs with mixed dynamics: the transport/diffusion case”, arXiv:1209.5564 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.