We derive an exact solution for Stokes flow in an in a channel with permeable walls. We assume that at the channel walls, the normal component of the fluid velocity is described by Darcy's law and the tangential component of the fluid velocity is described by the no slip condition. The pressure exterior to the channel is assumed to be constant. Although this problem has been well studied, typical studies assume that the permeability of the wall is small relative to other non-dimensional parameters; this work relaxes this assumption and explores a regime in parameter space that has not yet been well studied. A consequence of this relaxation is that transverse velocity is no longer necessarily small when compared with the axial velocity. We use our result to explore how existing asymptotic theories break down in the limit of large permeability.

No abstract uploaded!

Let g be the Witt algebra or the positive Witt algebra. It is well known that the enveloping algebra U(g) has intermediate growth and thus infinite Gelfand–Kirillov (GK-) dimension. We prove that the GK-dimension of U(g) is just infinite in the sense that any proper quotient of U(g) has polynomial growth. This proves a conjecture of Petukhov and the second named author for the positive Witt algebra. We also establish the corresponding results for quotients of the symmetric algebra S(g) by proper Poisson ideals. In fact, we prove more generally that any central quotient of the universal enveloping algebra of the Virasoro algebra has just infinite GK-dimension. We give several applications. In particular, we easily compute the annihilators of Verma modules over the Virasoro algebra.

Edge states attract more and more research interests owing to the novel topologically protected properties. In this work, we studied edge modes and traveling edge states via the linear Dirac equation with so-called edge-admissible masses. The unidirectional edge state provides a heuristic approach to more general traveling edge states through the localized behavior along slowly varying edges. We show the dominated asymptotic solutions of two typical edge states that follow circular and curved edges with small curvature by the analytic and quantitative arguments.

In this paper, we consider the problem of approximating the longest path in a grid graph that possesses a square-free 2-factor. By (1) analyzing several characteristics of four types of cross cells and (2) presenting three cycle-merging operations and one extension operation, we propose an algorithm that finds in an n-vertex grid graph G, a long path of length at least 5/6 n + 2. Our approximation algorithm runs in quadratic time. In addition to its theoretical value, our work has also an interesting application in image-guided maze generation.