We prove the almost everywhere convergence of the inverse spherical transform of$L$_{$p$}bi-$K$-invariant functions on the group$SL$(2,$R$), 4/3<$p$≤2. The result appears to be sharp.

We characterize quasiconformal mappings as those homeomorphisms between two metric measure spaces of locally bounded geometry that preserve a class of quasiminimizers. We also consider quasiconformal mappings and densities in metric spaces and give a characterization of quasiconformal mappings in terms of the uniform density property introduced by Gehring and Kelly.

We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of groups with exotic properties: • We construct the first examples of finitely generated coarsely non-amenable groups (that is, groups without Guoliang Yu’s Property A) that are coarsely embeddable into a Hilbert space. Moreover, our groups act properly on CAT(0) cubical complexes. • We construct the first examples of finitely generated groups, with expanders embedded isometrically into their Cayley graphs—in contrast, in the case of the Gromov monster expanders are not even coarsely embedded. We present further applications.

In his monograph Arthur (The endoscopic classification of representations: orthogonal and symplectic groups, Colloquium Publications, American Mathematical Society, Providence, 2013) characterizes the L-packets of quasisplit symplectic groups and orthogonal groups. By extending his work, we characterize the L-packets for the corresponding similitude groups with desired properties. In particular, we show these packets satisfy the conjectural endoscopic character identities.

In this paper, we present entropy satisfying schemes for solving an integro-differential equation that describes the evolution of a population structured with respect to a continuous trait. In [P.-E. Jabin and G. Raoul, J. Math. Biol., 63 (2011), pp. 493–517] solutions are shown to converge toward the so-called evolutionary stable distribution (ESD) as time becomes large, using the relative entropy. At the discrete level, the ESD is shown to be the solution to a quadratic programming problem and can be computed by any well-established nonlinear programing algorithm. The schemes are then shown to satisfy the entropy dissipation inequality on the set where initial data are positive and the numerical solutions tend toward the discrete ESD in time. An alternative algorithm is presented to capture the global ESD for nonnegative initial data, which is made possible due to the mutation mechanism built into the modified scheme. A series of numerical tests are given to confirm both accuracy and the entropy satisfying property and to underline the efficiency of capturing the large time asymptotic behavior of numerical solutions in various settings.