More Like this

1. Dynamics Near the Subcritical Transition of the 3D Couette Flow II: Above Threshold Case

   https://doi.org/10.1090/memo/1377  

   Bedrossian, Jacob ; Germain, Pierre ; Masmoudi, Nader ( September 2022 , Memoirs of the American Mathematical Society)

   This is the second in a pair of works which study small disturbances to the plane, periodic 3D Couette flow in the incompressible Navier-Stokes equations at high Reynolds number Re . In this work, we show that there is constant 0 > c 0 ≪ 1 0 > c_0 \ll 1 , independent of R e \mathbf {Re} , such that sufficiently regular disturbances of size ϵ ≲ R e − 2 / 3 − δ \epsilon \lesssim \mathbf {Re}^{-2/3-\delta } for any δ > 0 \delta > 0 exist at least until t = c 0 ϵ − 1 t = c_0\epsilon ^{-1} and in general evolve to be O ( c 0 ) O(c_0) due to the lift-up effect. Further, after times t ≳ R e 1 / 3 t \gtrsim \mathbf {Re}^{1/3} , the streamwise dependence of the solution is rapidly diminished by a mixing-enhanced dissipation effect and the solution is attracted back to the class of “2.5 dimensional” streamwise-independent solutions (sometimes referred to as “streaks”). The largest of these streaks are expected to eventually undergo a secondary instability at t ≈ ϵ − 1 t \approx \epsilon ^{-1} . Hence, our work strongly suggests, for allmore »(sufficiently regular) initial data, the genericity of the “lift-up effect ⇒ \Rightarrow streak growth ⇒ \Rightarrow streak breakdown” scenario for turbulent transition of the 3D Couette flow near the threshold of stability forwarded in the applied mathematics and physics literature.« less
2. A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings

   Lahn, Nathaniel ; Raghvendra, Sharath ( June 2019 , Leibniz international proceedings in informatics)

   We present a weighted approach to compute a maximum cardinality matching in an arbitrary bipartite graph. Our main result is a new algorithm that takes as input a weighted bipartite graph G(A cup B,E) with edge weights of 0 or 1. Let w <= n be an upper bound on the weight of any matching in G. Consider the subgraph induced by all the edges of G with a weight 0. Suppose every connected component in this subgraph has O(r) vertices and O(mr/n) edges. We present an algorithm to compute a maximum cardinality matching in G in O~(m(sqrt{w} + sqrt{r} + wr/n)) time. When all the edge weights are 1 (symmetrically when all weights are 0), our algorithm will be identical to the well-known Hopcroft-Karp (HK) algorithm, which runs in O(m sqrt{n}) time. However, if we can carefully assign weights of 0 and 1 on its edges such that both w and r are sub-linear in n and wr=O(n^{gamma}) for gamma < 3/2, then we can compute maximum cardinality matching in G in o(m sqrt{n}) time. Using our algorithm, we obtain a new O~(n^{4/3}/epsilon^4) time algorithm to compute an epsilon-approximate bottleneck matching of A,B subsetR^2 and an 1/(epsilon^{O(d)}}n^{1+(d-1)/(2d-1)}) poly logmore »n time algorithm for computing epsilon-approximate bottleneck matching in d-dimensions. All previous algorithms take Omega(n^{3/2}) time. Given any graph G(A cup B,E) that has an easily computable balanced vertex separator for every subgraph G'(V',E') of size |V'|^{delta}, for delta in [1/2,1), we can apply our algorithm to compute a maximum matching in O~(mn^{delta/1+delta}) time improving upon the O(m sqrt{n}) time taken by the HK-Algorithm.« less
3. MULTIPLICITY ONE AT FULL CONGRUENCE LEVEL

   https://doi.org/10.1017/S1474748020000225  

   Le, Daniel ; Morra, Stefano ; Schraen, Benjamin ( May 2020 , Journal of the Institute of Mathematics of Jussieu)

   Let $F$ be a totally real field in which $p$ is unramified. Let $\overline{r}:G_{F}\rightarrow \text{GL}_{2}(\overline{\mathbf{F}}_{p})$ be a modular Galois representation that satisfies the Taylor–Wiles hypotheses and is tamely ramified and generic at a place $v$ above $p$ . Let $\mathfrak{m}$ be the corresponding Hecke eigensystem. We describe the $\mathfrak{m}$ -torsion in the $\text{mod}\,p$ cohomology of Shimura curves with full congruence level at $v$ as a $\text{GL}_{2}(k_{v})$ -representation. In particular, it only depends on $\overline{r}|_{I_{F_{v}}}$ and its Jordan–Hölder factors appear with multiplicity one. The main ingredients are a description of the submodule structure for generic $\text{GL}_{2}(\mathbf{F}_{q})$ -projective envelopes and the multiplicity one results of Emerton, Gee and Savitt [Lattices in the cohomology of Shimura curves, Invent. Math.   200 (1) (2015), 1–96].
4. Measurement of the CP-violating phase $$\phi _s$$ in $$ B_{s}^{0} \rightarrow J/\psi \phi $$ decays in ATLAS at 13 TeV

   https://doi.org/10.1140/epjc/s10052-021-09011-0  

   Aad, G. ; Abbott, B. ; Abbott, D. C. ; Abdinov, O. ; Abud, A. Abed ; Abeling, K. ; Abhayasinghe, D. K. ; Abidi, S. H. ; AbouZeid, O. S. ; Abraham, N. L. ; et al ( April 2021 , The European Physical Journal C)

   Abstract A measurement of the $$ B_{s}^{0} \rightarrow J/\psi \phi $$ B s 0 → J / ψ ϕ decay parameters using $$ 80.5\, \mathrm {fb^{-1}} $$ 80.5 fb - 1 of integrated luminosity collected with the ATLAS detector from 13  $$\text {Te}\text {V}$$ Te proton–proton collisions at the LHC is presented. The measured parameters include the CP -violating phase $$\phi _{s} $$ ϕ s , the width difference $$ \Delta \Gamma _{s}$$ Δ Γ s between the $$B_{s}^{0}$$ B s 0 meson mass eigenstates and the average decay width $$ \Gamma _{s}$$ Γ s . The values measured for the physical parameters are combined with those from $$ 19.2\, \mathrm {fb^{-1}} $$ 19.2 fb - 1 of 7 and 8  $$\text {Te}\text {V}$$ Te data, leading to the following: $$\begin{aligned} \phi _{s}= & {} -0.087 \pm 0.036 ~\mathrm {(stat.)} \pm 0.021 ~\mathrm {(syst.)~rad} \\ \Delta \Gamma _{s}= & {} 0.0657 \pm 0.0043 ~\mathrm {(stat.)}\pm 0.0037 ~\mathrm {(syst.)~ps}^{-1} \\ \Gamma _{s}= & {} 0.6703 \pm 0.0014 ~\mathrm {(stat.)}\pm 0.0018 ~\mathrm {(syst.)~ps}^{-1} \end{aligned}$$ ϕ s = - 0.087 ± 0.036 ( stat . ) ± 0.021 ( syst . ) rad Δ Γ s = 0.0657 ± 0.0043 ( stat .more ») ± 0.0037 ( syst . ) ps - 1 Γ s = 0.6703 ± 0.0014 ( stat . ) ± 0.0018 ( syst . ) ps - 1 Results for $$\phi _{s} $$ ϕ s and $$ \Delta \Gamma _{s}$$ Δ Γ s are also presented as 68% confidence level contours in the $$\phi _{s} $$ ϕ s – $$ \Delta \Gamma _{s}$$ Δ Γ s plane. Furthermore the transversity amplitudes and corresponding strong phases are measured. $$\phi _{s} $$ ϕ s and $$ \Delta \Gamma _{s}$$ Δ Γ s measurements are in agreement with the Standard Model predictions.« less
5. Zeroes of polynomials on definable hypersurfaces: pathologies exist, but they are rare

   https://doi.org/10.1093/qmath/haz022  

   Basu, Saugata ; Lerario, Antonio ; Natarajan, Abhiram ( October 2019 , The Quarterly Journal of Mathematics)

   Given a sequence $\{Z_d\}_{d\in \mathbb{N}}$ of smooth and compact hypersurfaces in ${\mathbb{R}}^{n-1}$, we prove that (up to extracting subsequences) there exists a regular definable hypersurface $\Gamma \subset {\mathbb{R}}\textrm{P}^n$ such that each manifold $Z_d$ is diffeomorphic to a component of the zero set on $\Gamma$ of some polynomial of degree $d$. (This is in sharp contrast with the case when $\Gamma$ is semialgebraic, where for example the homological complexity of the zero set of a polynomial $p$ on $\Gamma$ is bounded by a polynomial in $\deg (p)$.) More precisely, given the above sequence of hypersurfaces, we construct a regular, compact, semianalytic hypersurface $\Gamma \subset {\mathbb{R}}\textrm{P}^{n}$ containing a subset $D$ homeomorphic to a disk, and a family of polynomials $\{p_m\}_{m\in \mathbb{N}}$ of degree $\deg (p_m)=d_m$ such that $(D, Z(p_m)\cap D)\sim ({\mathbb{R}}^{n-1}, Z_{d_m}),$ i.e. the zero set of $p_m$ in $D$ is isotopic to $Z_{d_m}$ in ${\mathbb{R}}^{n-1}$. This says that, up to extracting subsequences, the intersection of $\Gamma$ with a hypersurface of degree $d$ can be as complicated as we want. We call these ‘pathological examples’. In particular, we show that for every $0 \leq k \leq n-2$ and every sequence of natural numbers $a=\{a_d\}_{d\in \mathbb{N}}$ there is a regular, compact semianalyticmore »hypersurface $\Gamma \subset {\mathbb{R}}\textrm{P}^n$, a subsequence $\{a_{d_m}\}_{m\in \mathbb{N}}$ and homogeneous polynomials $\{p_{m}\}_{m\in \mathbb{N}}$ of degree $\deg (p_m)=d_m$ such that (0.1)$$\begin{equation}b_k(\Gamma\cap Z(p_m))\geq a_{d_m}.\end{equation}$$ (Here $b_k$ denotes the $k$th Betti number.) This generalizes a result of Gwoździewicz et al. [13]. On the other hand, for a given definable $\Gamma$ we show that the Fubini–Study measure, in the Gaussian probability space of polynomials of degree $d$, of the set $\Sigma _{d_m,a, \Gamma }$ of polynomials verifying (0.1) is positive, but there exists a constant $c_\Gamma$ such that $$\begin{equation*}0<{\mathbb{P}}(\Sigma_{d_m, a, \Gamma})\leq \frac{c_{\Gamma} d_m^{\frac{n-1}{2}}}{a_{d_m}}.\end{equation*}$$ This shows that the set of ‘pathological examples’ has ‘small’ measure (the faster $a$ grows, the smaller the measure and pathologies are therefore rare). In fact we show that given $\Gamma$, for most polynomials a Bézout-type bound holds for the intersection $\Gamma \cap Z(p)$: for every $0\leq k\leq n-2$ and $t>0$: $$\begin{equation*}{\mathbb{P}}\left(\{b_k(\Gamma\cap Z(p))\geq t d^{n-1} \}\right)\leq \frac{c_\Gamma}{td^{\frac{n-1}{2}}}.\end{equation*}$$

   « less