We describe a family of compactifications of the space of Bridgeland stability conditions of a triangulated category, following earlier work by Bapat, Deopurkar and Licata. We particularly consider the case of the 2-Calabi–Yau category of the $A_2$ quiver. The compactification is the closure of an embedding (depending on q) of the stability space into an infinite-dimensional projective space. In the $A_2$ case, the three-strand braid group $B_3$ acts on this closure. We describe two distinguished braid group orbits in the boundary, points of which can be identified with certain rational functions in q. Points in one of the orbits are exactly the q-deformed rational numbers recently introduced by Morier-Genoud and Ovsienko, while the other orbit gives a new q-deformation of the rational numbers. Specialising q to a positive real number, we obtain a complete description of the boundary of the compactification.

The total energy of an eigenstate in a composite quantum system tends to be distributed equally among its constituents. We identify the quantum fluctuation around this equipartition principle in the simplest disordered quantum system consisting of linear combinations of Wigner matrices. As our main ingredient, we prove the Eigenstate Thermalisation Hypothesis and Gaussian fluctuation for general quadratic forms of the bulk eigenvectors of Wigner matrices with an arbitrary deformation.

Toeplitz conjectured that any simple planar loop inscribes a square. Here we prove variants of Toeplitz’s square peg problem. We prove Hadwiger’s 1971 conjecture that any simple loop in $3$-space inscribes a parallelogram. We show that any simple planar loop inscribes sufficiently many rectangles that their vertices are dense in the loop. If the loop is rectifiable, there is a rectangle that cuts the loop into four pieces which can be rearranged to form two loops of equal length. (The previous two results are independently due to Schwartz.) A rectifiable loop in $d$-space can be cut into $(r-1)(d+1)+1$ pieces that can be rearranged by translations to form $r$ loops of equal length. We relate our results to fair divisions of necklaces in the sense of Alon and to Tverberg-type results. This provides a new approach and a common framework to obtain inscribability results for the class of all continuous curves.

We establish vortex dynamics for the time-dependent Ginzburg–Landau equation for asymptotically large numbers of vortices for the problem without a gauge field and either Dirichlet or Neumann boundary conditions. As our main tool, we establish quantitative bounds on several fundamental quantities, including the kinetic energy, that lead to explicit convergence rates. For dilute vortex liquids, we prove that sequences of solutions converge to the hydrodynamic limit.

Let $\mathbb {S}^{d-1}$ denote the unit sphere in Euclidean space $\mathbb {R}^d$, $d\geq 2$, equipped with surface measure $\sigma _{d-1}$. An instance of our main result concerns the regularity of solutions of the convolution equation

$$\begin{align*}a\cdot(f\sigma_{d-1})^{\ast {(q-1)}}\big\vert_{\mathbb{S}^{d-1}}=f,\text{ a.e. on }\mathbb{S}^{d-1}, \end{align*}$$

$a\in C^\infty (\mathbb {S}^{d-1})$

$q\geq 2(d+1)/(d-1)$

$f\in L^2(\mathbb {S}^{d-1})$

$C^\infty (\mathbb {S}^{d-1})$

$\mathbb {S}^{d-1}$

$C^\infty $

Remixed Eulerian numbers are a polynomial q-deformation of Postnikov’s mixed Eulerian numbers. They arose naturally in previous work by the authors concerning the permutahedral variety and subsume well-known families of polynomials such as q-binomial coefficients and Garsia–Remmel’s q-hit numbers. We study their combinatorics in more depth. As polynomials in q, they are shown to be symmetric and unimodal. By interpreting them as computing success probabilities in a simple probabilistic process we arrive at a combinatorial interpretation involving weighted trees. By decomposing the permutahedron into certain combinatorial cubes, we obtain a second combinatorial interpretation. At $q=1$, the former recovers Postnikov’s interpretation whereas the latter recovers Liu’s interpretation, both of which were obtained via methods different from ours.

A recent paper of Balogh, Li and Treglown [3] initiated the study of Dirac-type problems for ordered graphs. In this paper, we prove a number of results in this area. In particular, we determine asymptotically the minimum degree threshold for forcing

1. (i) a perfect H-tiling in an ordered graph, for any fixed ordered graph H of interval chromatic number at least $3$ ;

2. (ii) an H-tiling in an ordered graph G covering a fixed proportion of the vertices of G (for any fixed ordered graph H);

3. (iii) an H-cover in an ordered graph (for any fixed ordered graph H).

The first two of these results resolve questions of Balogh, Li and Treglown, whilst (iii) resolves a question of Falgas-Ravry. Note that (i) combined with a result from [3] completely determines the asymptotic minimum degree threshold for forcing a perfect H-tiling. Additionally, we prove a result that, combined with a theorem of Balogh, Li and Treglown, asymptotically determines the minimum degree threshold for forcing an almost perfect H-tiling in an ordered graph (for any fixed ordered graph H). Our work therefore provides ordered graph analogues of the seminal tiling theorems of Kühn and Osthus [Combinatorica 2009] and of Komlós [Combinatorica 2000]. Each of our results exhibits some curious, and perhaps unexpected, behaviour. Our solution to (i) makes use of a novel absorbing argument.

In this paper, we prove one divisibility of the Iwasawa–Greenberg main conjecture for the Rankin–Selberg product of a weight two cusp form and an ordinary complex multiplication form of higher weight, using congruences between Klingen Eisenstein series and cusp forms on $\mathrm {GU}(3,1)$, generalizing an earlier result of the third-named author to allow nonordinary cusp forms. The main result is a key input in the third-named author’s proof of Kobayashi’s $\pm $-main conjecture for supersingular elliptic curves. The new ingredient here is developing a semiordinary Hida theory along an appropriate smaller weight space and a study of the semiordinary Eisenstein family.

We introduce a path theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher-level generalizations over fields of arbitrary characteristic. Our first main result is a ‘super-strong linkage principle’ which provides degree-wise upper bounds for graded decomposition numbers (this is new even in the case of symmetric groups). Next, we generalize the notion of homomorphisms between Weyl/Specht modules which are ‘generically’ placed (within the associated alcove geometries) to cyclotomic Hecke and diagrammatic Cherednik algebras. Finally, we provide evidence for a higher-level analogue of the classical Lusztig conjecture over fields of sufficiently large characteristic.

A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Komlós, Sárközy, and Szemerédi that applies to almost optimally bounded colourings. A corollary of this is that there exists a rainbow copy of any bounded-degree spanning subgraph H in a quasirandom host graph G, assuming that the edge-colouring of G fulfills a boundedness condition that is asymptotically best possible.

This has many applications beyond rainbow colourings: for example, to graph decompositions, orthogonal double covers, and graph labellings.

Let G be a finite group. Let $H, K$ be subgroups of G and $H \backslash G / K$ the double coset space. If Q is a probability on G which is constant on conjugacy classes ( $Q(s^{-1} t s) = Q(t)$ ), then the random walk driven by Q on G projects to a Markov chain on $H \backslash G /K$ . This allows analysis of the lumped chain using the representation theory of G. Examples include coagulation-fragmentation processes and natural Markov chains on contingency tables. Our main example projects the random transvections walk on $GL_n(q)$ onto a Markov chain on $S_n$ via the Bruhat decomposition. The chain on $S_n$ has a Mallows stationary distribution and interesting mixing time behavior. The projection illuminates the combinatorics of Gaussian elimination. Along the way, we give a representation of the sum of transvections in the Hecke algebra of double cosets, which describes the Markov chain as a mixture of Metropolis chains. Some extensions and examples of double coset Markov chains with G a compact group are discussed.

Since the foundational work of Chenciner and Montgomery in 2000 there has been a great deal of interest in choreographic solutions of the $n$-body problem: periodic motions where the $n$ bodies all follow one another at regular intervals along a closed path. The principal approach combines variational methods with symmetry properties. In this paper, we give a systematic treatment of the symmetry aspect. In the first part, we classify all possible symmetry groups of planar $n$-body collision-free choreographies. These symmetry groups fall into two infinite families and, if $n$ is odd, three exceptional groups. In the second part, we develop the equivariant fundamental group and use it to determine the topology of the space of loops with a given symmetry, which we show is related to certain cosets of the pure braid group in the full braid group, and to centralizers of elements of the corresponding coset. In particular, we refine the symmetry classification by classifying the connected components of the set of loops with any given symmetry. This leads to the existence of many new choreographies in $n$-body systems governed by a strong force potential.

The classical theorem of Vizing states that every graph of maximum degree $d$ admits an edge coloring with at most $d+1$ colors. Furthermore, as it was earlier shown by Kőnig, $d$ colors suffice if the graph is bipartite. We investigate the existence of measurable edge colorings for graphings (or measure-preserving graphs). A graphing is an analytic generalization of a bounded-degree graph that appears in various areas, such as sparse graph limits, orbit equivalence and measurable group theory. We show that every graphing of maximum degree $d$ admits a measurable edge coloring with $d+O(\sqrt{d})$ colors; furthermore, if the graphing has no odd cycles, then $d+1$ colors suffice. In fact, if a certain conjecture about finite graphs that strengthens Vizing’s theorem is true, then our method will show that $d+1$ colors are always enough.

We prove an explicit inverse Chevalley formula in the equivariant K-theory of semi-infinite flag manifolds of simply laced type. By an ‘inverse Chevalley formula’ we mean a formula for the product of an equivariant scalar with a Schubert class, expressed as a $\mathbb {Z}\left [q^{\pm 1}\right ]$ -linear combination of Schubert classes twisted by equivariant line bundles. Our formula applies to arbitrary Schubert classes in semi-infinite flag manifolds of simply laced type and equivariant scalars $e^{\lambda }$ , where $\lambda $ is an arbitrary minuscule weight. By a result of Stembridge, our formula completely determines the inverse Chevalley formula for arbitrary weights in simply laced type except for type $E_8$ . The combinatorics of our formula is governed by the quantum Bruhat graph, and the proof is based on a limit from the double affine Hecke algebra. Thus our formula also provides an explicit determination of all nonsymmetric q-Toda operators for minuscule weights in ADE type.

We study solutions of difference equations in the rings of sequences and, more generally, solutions of equations with a monoid action in the ring of sequences indexed by the monoid. This framework includes, for example, difference equations on grids (for example, standard difference schemes) and difference equations in functions on words. On the universality side, we prove a version of strong Nullstellensatz for such difference equations under the assumption that the cardinality of the ground field is greater than the cardinality of the monoid and construct an example showing that this assumption cannot be omitted. On the undecidability side, we show that the following problems are undecidable:

We compute the spaces of sections of powers of the determinant line bundle on the spherical Schubert subvarieties of the Beilinson–Drinfeld affine Grassmannians. The answer is given in terms of global Demazure modules over the current Lie algebra.

In this article, we establish an explicit correspondence between kissing reflection groups and critically fixed anti-rational maps. The correspondence, which is expressed using simple planar graphs, has several dynamical consequences. As an application of this correspondence, we give complete answers to geometric mating problems for critically fixed anti-rational maps.

Many natural real-valued functions of closed curves are known to extend continuously to the larger space of geodesic currents. For instance, the extension of length with respect to a fixed hyperbolic metric was a motivating example for the development of geodesic currents. We give a simple criterion on a curve function that guarantees a continuous extension to geodesic currents. The main condition of our criterion is the smoothing property, which has played a role in the study of systoles of translation lengths for Anosov representations. It is easy to see that our criterion is satisfied for almost all known examples of continuous functions on geodesic currents, such as nonpositively curved lengths or stable lengths for surface groups, while also applying to new examples like extremal length. We use this extension to obtain a new curve counting result for extremal length.

We give applications of integral canonical models of orthogonal Shimura varieties and the Kuga-Satake morphism to the arithmetic of $K3$ surfaces over finite fields. We prove that every $K3$ surface of finite height over a finite field admits a characteristic $0$ lifting whose generic fibre is a $K3$ surface with complex multiplication. Combined with the results of Mukai and Buskin, we prove the Tate conjecture for the square of a $K3$ surface over a finite field. To obtain these results, we construct an analogue of Kisin’s algebraic group for a $K3$ surface of finite height and construct characteristic $0$ liftings of the $K3$ surface preserving the action of tori in the algebraic group. We obtain these results for $K3$ surfaces over finite fields of any characteristics, including those of characteristic $2$ or $3$.

The bandwidth theorem of Böttcher, Schacht, and Taraz [Proof of the bandwidth conjecture of Bollobás andKomlós, Mathematische Annalen, 2009] gives a condition on the minimum degree of an n-vertex graph G that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth $o(n)$ , thereby proving a conjecture of Bollobás and Komlós [The Blow-up Lemma, Combinatorics, Probability, and Computing, 1999]. In this paper, we prove a version of the bandwidth theorem for locally dense graphs. Indeed, we prove that every locally dense n-vertex graph G with $\delta (G)> (1/2+o(1))n$ contains as a subgraph any given (spanning) H with bounded maximum degree and sublinear bandwidth.