Integral Representations of the Large and Little Schröder Numbers

In the paper, the authors establish several integral representations for the generating functions of the large and little Schröder numbers and for the large and little Schröder numbers.     

Mesoscopic Modeling of Capillarity-Induced Two-Phase Transport in a Microfluidic Porous Structure

Mesoscopic modeling at the pore scale offers great promise in exploring the underlying structure transport performance of flow through porous media. The present work studies the fluid flow subjected to capillarity-induced resonance in porous media characterized by different porous structure and wettability. The effects of porosity and wettability on the displacement behavior of the fluid flow through porous media are discussed. The results are presented in the form of temporal evolution of percentage saturation and displacement of the fluid front through porous media. The present study reveals that the vibration in the form of acoustic excitation could be significant in the mobilization of fluid through the porous media. The dependence of displacement of the fluid on physicochemical parameters like wettability of the surface, frequency along with the porosity is analyzed. It was observed that the mean displacement of the fluid is more in the case of invading fluid with wetting phase where the driving force strength is not so dominant.     

Three-term polynomial progressions in subsets of finite fields

We prove that the group of diffeomorphisms of the interval [0, 1] contains surface groups whose action on (0, 1) has no global fix point and such that only countably many points of the interval (0, 1) have non-trivial stabiliser.     

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.     

Raman Scattering Enhancement Based on High-Pressure High-Temperature Diamonds†

Journal of Russian Laser Research - We discuss the use of high-pressure high-temperature (HPHT) diamonds for the determination of trace amounts of various Raman active substances. The amount of the...