TY - JOUR
AB - We report the results of an experimental investigation into the decay of turbulence in plane Couette–Poiseuille flow using ‘quench’ experiments where the flow laminarises after a sudden reduction in Reynolds number Re. Specifically, we study the velocity field in the streamwise–spanwise plane. We show that the spanwise velocity containing rolls decays faster than the streamwise velocity, which displays elongated regions of higher or lower velocity called streaks. At final Reynolds numbers above 425, the decay of streaks displays two stages: first a slow decay when rolls are present and secondly a more rapid decay of streaks alone. The difference in behaviour results from the regeneration of streaks by rolls, called the lift-up effect. We define the turbulent fraction as the portion of the flow containing turbulence and this is estimated by thresholding the spanwise velocity component. It decreases linearly with time in the whole range of final Re. The corresponding decay slope increases linearly with final Re. The extrapolated value at which this decay slope vanishes is Reaz≈656±10, close to Reg≈670 at which turbulence is self-sustained. The decay of the energy computed from the spanwise velocity component is found to be exponential. The corresponding decay rate increases linearly with Re, with an extrapolated vanishing value at ReAz≈688±10. This value is also close to the value at which the turbulence is self-sustained, showing that valuable information on the transition can be obtained over a wide range of Re.
AU - Liu, T.
AU - Semin, B.
AU - Klotz, Lukasz
AU - Godoy-Diana, R.
AU - Wesfreid, J. E.
AU - Mullin, T.
ID - 9297
JF - Journal of Fluid Mechanics
SN - 0022-1120
TI - Decay of streaks and rolls in plane Couette-Poiseuille flow
VL - 915
ER -
TY - JOUR
AB - Hill's Conjecture states that the crossing number cr(𝐾𝑛) of the complete graph 𝐾𝑛 in the plane (equivalently, the sphere) is 14⌊𝑛2⌋⌊𝑛−12⌋⌊𝑛−22⌋⌊𝑛−32⌋=𝑛4/64+𝑂(𝑛3) . Moon proved that the expected number of crossings in a spherical drawing in which the points are randomly distributed and joined by geodesics is precisely 𝑛4/64+𝑂(𝑛3) , thus matching asymptotically the conjectured value of cr(𝐾𝑛) . Let cr𝑃(𝐺) denote the crossing number of a graph 𝐺 in the projective plane. Recently, Elkies proved that the expected number of crossings in a naturally defined random projective plane drawing of 𝐾𝑛 is (𝑛4/8𝜋2)+𝑂(𝑛3) . In analogy with the relation of Moon's result to Hill's conjecture, Elkies asked if lim𝑛→∞ cr𝑃(𝐾𝑛)/𝑛4=1/8𝜋2 . We construct drawings of 𝐾𝑛 in the projective plane that disprove this.
AU - Arroyo Guevara, Alan M
AU - Mcquillan, Dan
AU - Richter, R. Bruce
AU - Salazar, Gelasio
AU - Sullivan, Matthew
ID - 9295
JF - Journal of Graph Theory
SN - 0364-9024
TI - Drawings of complete graphs in the projective plane
ER -
TY - JOUR
AB - We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.
AU - Chatterjee, Krishnendu
AU - Dvořák, Wolfgang
AU - Henzinger, Monika
AU - Svozil, Alexander
ID - 9293
IS - 8
JF - Artificial Intelligence
SN - 00043702
TI - Algorithms and conditional lower bounds for planning problems
VL - 297
ER -
TY - JOUR
AB - In this issue of Developmental Cell, Doyle and colleagues identify periodic anterior contraction as a characteristic feature of fibroblasts and mesenchymal cancer cells embedded in 3D collagen gels. This contractile mechanism generates a matrix prestrain required for crawling in fibrous 3D environments.
AU - Gärtner, Florian R
AU - Sixt, Michael K
ID - 9294
IS - 6
JF - Developmental Cell
SN - 15345807
TI - Engaging the front wheels to drive through fibrous terrain
VL - 56
ER -
TY - JOUR
AB - We establish finite time extinction with probability one for weak solutions of the Cauchy–Dirichlet problem for the 1D stochastic porous medium equation with Stratonovich transport noise and compactly supported smooth initial datum. Heuristically, this is expected to hold because Brownian motion has average spread rate O(t12) whereas the support of solutions to the deterministic PME grows only with rate O(t1m+1). The rigorous proof relies on a contraction principle up to time-dependent shift for Wong–Zakai type approximations, the transformation to a deterministic PME with two copies of a Brownian path as the lateral boundary, and techniques from the theory of viscosity solutions.
AU - Hensel, Sebastian
ID - 9307
JF - Stochastics and Partial Differential Equations: Analysis and Computations
SN - 21940401
TI - Finite time extinction for the 1D stochastic porous medium equation with transport noise
ER -