We classify all possible JSJ decompositions of doubles of free groups of rank two, and we also compute the Makanin–Razborov diagram of a particular double of a free group and deduce that in general limit groups are not freely subgroup separable.

In this note we consider parabolic subroot systems of a complex simple Lie Algebra. We describe root theoretic data of the subroot systems in terms of that of the root system and we give a selection of applications of our results to the study of generalized flag manifolds.

In this paper, we introduce a dynamical urban planning model. This leads to the study of a system of nonlinear equations coupled through multi-marginal optimal transport problems. A first example consists in solving two equations coupled through the solution to the Monge–Ampère equation. We show that theWasserstein gradient flow theory provides a very good framework to solve these highly nonlinear systems. At the end, a uniqueness result is presented in dimension one based on convexity arguments.

Let M be an arbitrary factor and $\sigma : \Gamma \curvearrowright M$ an action of a discrete group. In this paper, we study the fullness of the crossed product $M \rtimes _\sigma \Gamma $. When Γ is amenable, we obtain a complete characterization: the crossed product factor $M \rtimes _\sigma \Gamma $ is full if and only if M is full and the quotient map $\overline {\sigma } : \Gamma \rightarrow {\rm out}(M)$ has finite kernel and discrete image. This answers the question of Jones from [11]. When M is full and Γ is arbitrary, we give a sufficient condition for $M \rtimes _\sigma \Gamma $ to be full which generalizes both Jones' criterion and Choda's criterion. In particular, we show that if M is any full factor (possibly of type III) and Γ is a non-inner amenable group, then the crossed product $M \rtimes _\sigma \Gamma $ is full.

We give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to the generating set consisting of all simple closed curves.

The unified transform method (UTM) or Fokas method for analyzing initial-boundary value (IBV) problems provides an important generalization of the inverse scattering transform (IST) method for analyzing initial value problems. In comparison with the IST, a major difficulty of the implementation of the UTM, in general, is the involvement of unknown boundary values. In this paper we analyze the IBV problem for the massive Thirring model in the quarter plane, assuming that the initial and boundary data belong to the Schwartz class. We show that for this integrable model, the UTM is as effective as the IST method: Riemann-Hilbert problems we formulated for such a problem have explicit (x, t)-dependence and depend only on the given initial and boundary values; they do not involve additional unknown boundary values.

We consider the asymptotics of the difference between the empirical measures of the β-Hermite tridiagonal matrix and its minor. We prove that this difference has a deterministic limit and Gaussian fluctuations. Through a correspondence between measures and continual Young diagrams, this deterministic limit is identified with the Vershik–Kerov–Logan–Shepp curve. Moreover, the Gaussian fluctuations are identified with a sectional derivative of the Gaussian free field.

We study $\text{Sp}_{2n}(F)$-distinction for representations of the quasi-split unitary group $U_{2n}(E/F)$ in $2n$ variables with respect to a quadratic extension $E/F$ of $p$-adic fields. A conjecture of Dijols and Prasad predicts that no tempered representation is distinguished. We verify this for a large family of representations in terms of the Mœglin–Tadić classification of the discrete series. We further study distinction for some families of non-tempered representations. In particular, we exhibit $L$-packets with no distinguished members that transfer under base change to $\text{Sp}_{2n}(E)$-distinguished representations of $\text{GL}_{2n}(E)$.

Given complex numbers w1,…,wn, we define the weight w(X) of a set X of 0–1 vectors as the sum of $w_1^{x_1} \cdots w_n^{x_n}$ over all vectors (x1,…,xn) in X. We present an algorithm which, for a set X defined by a system of homogeneous linear equations with at most r variables per equation and at most c equations per variable, computes w(X) within relative error ∊ > 0 in (rc)O(lnn-ln∊) time provided $|w_j| \leq \beta (r \sqrt{c})^{-1}$ for an absolute constant β > 0 and all j = 1,…,n. A similar algorithm is constructed for computing the weight of a linear code over ${\mathbb F}_p$. Applications include counting weighted perfect matchings in hypergraphs, counting weighted graph homomorphisms, computing weight enumerators of linear codes with sparse code generating matrices, and computing the partition functions of the ferromagnetic Potts model at low temperatures and of the hard-core model at high fugacity on biregular bipartite graphs.

We prove that if $M$ is a $\text{JBW}^{\ast }$-triple and not a Cartan factor of rank two, then $M$ satisfies the Mazur–Ulam property, that is, every surjective isometry from the unit sphere of $M$ onto the unit sphere of another real Banach space $Y$ extends to a surjective real linear isometry from $M$ onto $Y$.

An (improper) graph colouring has defect d if each monochromatic subgraph has maximum degree at most d, and has clustering c if each monochromatic component has at most c vertices. This paper studies defective and clustered list-colourings for graphs with given maximum average degree. We prove that every graph with maximum average degree less than (2d+2)/(d+2)k is k-choosable with defect d. This improves upon a similar result by Havet and Sereni (J. Graph Theory, 2006). For clustered choosability of graphs with maximum average degree m, no (1-ɛ)m bound on the number of colours was previously known. The above result with d=1 solves this problem. It implies that every graph with maximum average degree m is $\lfloor{\frac{3}{4}m+1}\rfloor$-choosable with clustering 2. This extends a result of Kopreski and Yu (Discrete Math., 2017) to the setting of choosability. We then prove two results about clustered choosability that explore the trade-off between the number of colours and the clustering. In particular, we prove that every graph with maximum average degree m is $\lfloor{\frac{7}{10}m+1}\rfloor$-choosable with clustering 9, and is $\lfloor{\frac{2}{3}m+1}\rfloor$-choosable with clustering O(m). As an example, the later result implies that every biplanar graph is 8-choosable with bounded clustering. This is the best known result for the clustered version of the earth–moon problem. The results extend to the setting where we only consider the maximum average degree of subgraphs with at least some number of vertices. Several applications are presented.

We show that the Galois cohomology groups of $p$-adic representations of a direct power of $\operatorname{Gal}(\overline{\mathbb{Q}_{p}}/\mathbb{Q}_{p})$ can be computed via the generalization of Herr’s complex to multivariable $(\unicode[STIX]{x1D711},\unicode[STIX]{x1D6E4})$-modules. Using Tate duality and a pairing for multivariable $(\unicode[STIX]{x1D711},\unicode[STIX]{x1D6E4})$-modules we extend this to analogues of the Iwasawa cohomology. We show that all $p$-adic representations of a direct power of $\operatorname{Gal}(\overline{\mathbb{Q}_{p}}/\mathbb{Q}_{p})$ are overconvergent and, moreover, passing to overconvergent multivariable $(\unicode[STIX]{x1D711},\unicode[STIX]{x1D6E4})$-modules is an equivalence of categories. Finally, we prove that the overconvergent Herr complex also computes the Galois cohomology groups.

For any central simple algebra over a field F which contains a maximal subfield M with non-trivial automorphism group G = AutF(M), G is solvable if and only if the algebra contains a finite chain of subalgebras which are generalized cyclic algebras over their centers (field extensions of F) satisfying certain conditions. These subalgebras are related to a normal subseries of G. A crossed product algebra F is hence solvable if and only if it can be constructed out of such a finite chain of subalgebras. This result was stated for division crossed product algebras by Petit and overlaps with a similar result by Albert which, however, was not explicitly stated in these terms. In particular, every solvable crossed product division algebra is a generalized cyclic algebra over F.