Differentiability conjecture for mixed transport-diffusion quantum graph semigroups
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.