We define a new class of plane billiards – the “pensive billiard” – in which the billiard ball travels along the boundary for some distance depending on the incidence angle before reflecting, while preserving the billiard rule of equality of the angles of incidence and reflection. This generalizes so-called “puck billiards” proposed by M. Bialy, as well as a “vortex billiard,” that is, the motion of a point vortex dipole in two-dimensional hydrodynamics on domains with boundary. We prove the variational origin and invariance of a symplectic structure for pensive billiards, as well as study their properties including conditions for a twist map, the existence of periodic orbits, etc. We also demonstrate the appearance of both the golden and silver ratios in the corresponding hydrodynamical vortex setting. Finally, we introduce and describe basic properties of pensive outer billiards.

We build on a 1990 paper of Bukovský and Copláková-Hartová. First, we remove the hypothesis of ${\mathsf {CH}}$ from one of their minimality results. Then, using a measurable cardinal, we show that there is a $|\aleph _2^V|=\aleph _1$-minimal extension that is not a $|\aleph _3^V|=\aleph _1$-extension, answering the first of their questions.

In 1967, Klarner proposed a problem concerning the existence of reflecting n-queens configurations. The problem considers the feasibility of placing n mutually nonattacking queens on the reflecting chessboard, an $n\times n$ chessboard with a $1\times n$ “reflecting strip” of squares added along one side of the board. A queen placed on the reflecting chessboard can attack the squares in the same row, column, and diagonal, with the additional feature that its diagonal path can be reflected via the reflecting strip. Klarner noted the equivalence of this problem to a number theory problem proposed by Slater, which asks: for which n is it possible to pair up the integers 1 through n with the integers $n+1$ through $2n$ such that no two of the sums or differences of the n pairs of integers are the same. We prove the existence of reflecting n-queens configurations for all sufficiently large n, thereby resolving both Slater’s and Klarner’s questions for all but a finite number of integers.

Vertically symmetric alternating sign matrices (VSASMs) of order $2n+1$ are known to be equinumerous with lozenge tilings of a hexagon with side lengths $2n+2,2n,2n+2,2n,2n+2,2n$ and a central triangular hole of size $2$ that exhibit a cyclical as well as a vertical symmetry, but finding an explicit bijection proving this belongs to the most difficult problems in bijective combinatorics. Towards constructing such a bijection, we generalize the result by introducing certain natural extensions for both objects along with $n+3$ parameters and show that the multivariate generating functions with respect to these parameters coincide. This is a significant step from a constant number of equidistributed statistics to a linear number of statistics in n. The equinumeracy of VSASMs and the lozenge tilings is then an easy consequence of this result, which is obtained by specializing the generating functions to signed enumerations for both types of objects and then applying certain sign-reversing involutions. Another main result concerns the expansion of the multivariate generating function into symplectic characters as a sum over totally symmetric self-complementary plane partitions, which is in perfect analogy to the situation for ordinary ASMs where the Schur expansion can be written as a sum over totally symmetric plane partitions. This is exciting as it is reminiscent of the well-known Cauchy identity, and the Cauchy identity does have a bijective proof using the Robinson-Schensted-Knuth correspondence, and thus the result raises the question of whether there is a variation of the Robinson–Schensted–Knuth correspondence that does eventually lead to a bijective proof.

We prove new weighted decoupling estimates. As an application, we give an improved sufficient condition for almost everywhere convergence of the Bochner-Riesz means of arbitrary $L^p$ functions for $1<p<2$ in dimensions 2 and 3.

Connections between heaps of modules and (affine) modules over rings are explored. This leads to explicit, often constructive, descriptions of some categorical constructions and properties that are implicit in universal algebra and algebraic theories. In particular, it is shown that the category of groups with a compatible action of a truss T (also called pointed T-modules) is isomorphic to the category of modules over the ring $\mathrm {R}(T)$ universally associated to the truss. This is widely used in the explicit description of free objects. Next, it is proven that the category of heaps of modules over T is isomorphic to the category of affine modules over $\mathrm {R}(T)$ and, in order to make the picture complete, that (in the unital case) these are in turn equivalent to a specific subcategory of the slice category of pointed T-modules over $\mathrm {R}(T)$. These correspondences and properties are then used to describe explicitly various (co)limits and to compare short exact sequences in the Barr-exact category of heaps of T-modules with short exact sequences as defined previously.

We provide a second-order energy expansion for a gas of N bosonic particles with three-body interactions in the Gross-Pitaevskii regime. We especially confirm a conjecture by Nam, Ricaud, and Triay in [25], where they predict the subleading term in the asymptotic expansion of the ground state energy to be of the order $\sqrt {N}$. In addition, we show that low-energy states satisfy Bose-Einstein condensation with a rate of the order $N^{-\frac {3}{4}}$.

Tao (2018) showed that in order to prove the Lonely Runner Conjecture (LRC) up to $n+1$ runners it suffices to consider positive integer velocities in the order of $n^{O(n^2)}$. Using the zonotopal reinterpretation of the conjecture due to the first and third authors (2017) we here drastically improve this result, showing that velocities up to $\binom {n+1}{2}^{n-1} \le n^{2n}$ are enough.

We prove the same finite-checking result, with the same bound, for the more general shifted Lonely Runner Conjecture (sLRC), except in this case our result depends on the solution of a question, that we dub the Lonely Vector Problem (LVP), about sumsets of n rational vectors in dimension two. We also prove the same finite-checking bound for a further generalization of sLRC that concerns cosimple zonotopes with n generators, a class of lattice zonotopes that we introduce.

In the last sections we look at dimensions two and three. In dimension two we prove our generalized version of sLRC (hence we reprove the sLRC for four runners), and in dimension three we show that to prove sLRC for five runners it suffices to look at velocities adding up to $195$.

The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least $-\lambda $ can be defined by a finite set of forbidden induced subgraphs if and only if $\lambda < \lambda ^*$, where $\lambda ^* = \rho ^{1/2} + \rho ^{-1/2} \approx 2.01980$, and $\rho $ is the unique real root of $x^3 = x + 1$. This resolves a question raised by Bussemaker and Neumaier. As a byproduct, we find all the limit points of smallest eigenvalues of graphs, supplementing Hoffman’s work on those limit points in $[-2, \infty )$.

We also prove that the same conclusion about forbidden subgraph characterization holds for signed graphs. Our impetus for the study of signed graphs is to determine the maximum cardinality of a spherical two-distance set with two fixed angles (one acute and one obtuse) in high dimensions. Denote by $N_{\alpha , \beta }(d)$ the maximum number of unit vectors in $\mathbb {R}^d$ where all pairwise inner products lie in $\{\alpha , \beta \}$ with $-1 \le \beta < 0 \le \alpha < 1$. Very recently Jiang, Tidor, Yao, Zhang, and Zhao determined the limit of $N_{\alpha , \beta }(d)/d$ as $d\to \infty $ when $\alpha + 2\beta < 0$ or $(1-\alpha )/(\alpha -\beta ) \in \{1,\sqrt 2,\sqrt 3\}$, and they proposed a conjecture on the limit in terms of eigenvalue multiplicities of signed graphs. We establish their conjecture whenever $(1-\alpha )/(\alpha - \beta ) < \lambda ^*$.

Schubert Vanishing is a problem of deciding whether Schubert coefficients are zero. Until this work it was open whether this problem is in the polynomial hierarchy ${{\mathsf {PH}}}$. We prove this problem is in ${{\mathsf {AM}}} \cap {{\mathsf {coAM}}}$ assuming the Generalized Riemann Hypothesis ($\mathrm{GRH}$), that is, relatively low in ${{\mathsf {PH}}}$. Our approach uses Purbhoo’s criterion [57] to construct explicit polynomial systems for the problem. The result follows from a reduction to Parametric Hilbert’s Nullstellensatz, recently analyzed in [2]. We extend our results to all classical types.

We gather evidence on a new local-global conjecture of Moretó and Rizo on values of irreducible characters of finite groups. For this we study subnormalisers and picky elements in finite groups of Lie type and determine them in many cases, for unipotent elements as well as for semisimple elements of prime power order. We also discuss subnormalisers of unipotent and semisimple elements in connected as well as in disconnected reductive linear algebraic groups.

Rigid meromorphic cocycles are defined in the setting of orthogonal groups of arbitrary real signature and constructed in some instances via a p-adic analogue of Borcherds’ singular theta lift. The values of rigid meromorphic cocycles at special points of an associated p-adic symmetric space are then conjectured to belong to class fields of suitable global reflex fields, suggesting an eventual framework for explicit class field theory beyond the setting of CM fields explored in the treatise of Shimura and Taniyama.

Motivated by classical Alexander invariants of affine hypersurface complements, we endow certain finite dimensional quotients of the homology of abelian covers of complex algebraic varieties with a canonical and functorial mixed Hodge structure (MHS). More precisely, we focus on covers which arise algebraically in the following way: if U is a smooth connected complex algebraic variety and G is a complex semiabelian variety, the pullback of the exponential map by an algebraic morphism $f:U\to G$ yields a covering space $\pi :U^f\to U$ whose group of deck transformations is $\pi _1(G)$. The new MHSs are compatible with Deligne’s MHS on the homology of U through the covering map $\pi $ and satisfy a direct sum decomposition as MHSs into generalized eigenspaces by the action of deck transformations. This provides a vast generalization of the previous results regarding univariable Alexander modules by Geske, Maxim, Wang and the authors in [16, 17]. Lastly, we reduce the problem of whether the first Betti number of the Milnor fiber of a central hyperplane arrangement complement is combinatorial to a question about the Hodge filtration of certain MHSs defined in this paper, providing evidence that the new structures contain interesting information.

For a klt singularity, C. Xu and Z. Zhuang [33] proved the associated graded algebra of a minimizing valuation of the normalized volume function is finitely generated, finishing the proof of the stable degeneration conjecture proposed by C. Li and C. Xu. We prove a family version of the stable degeneration: for a locally stable family of klt singularities with constant local volume, the ideal sequences of the minimizing valuations for the normalized volume function form families of ideals with flat cosupport, which induce a degeneration to a locally stable family of K-semistable log Fano cone singularities. In the proof, we give a method to construct families of Kollár models, which are a crucial tool introduced by Xu–Zhuang to prove finite generation for valuations of higher rational rank.

The aim of this paper is to illustrate both analytically and numerically the interplay of two fundamentally distinct non-Hermitian mechanisms in the deep subwavelength regime. Considering a parity-time symmetric system of one-dimensional subwavelength resonators equipped with two kinds of non-Hermiticity – an imaginary gauge potential and on-site gain and loss – we prove that all but two eigenmodes of the system pass through exceptional points and decouple. By tuning the gain-to-loss ratio, the system changes from a phase with unbroken parity-time symmetry to a phase with broken parity-time symmetry. At the macroscopic level, this is observed as a transition from symmetrical eigenmodes to condensated eigenmodes at one edge of the structure. Mathematically, it arises from a topological state change. The results of this paper open the door to the justification of a variety of phenomena arising from the interplay between non-Hermitian reciprocal and nonreciprocal mechanisms not only in subwavelength wave physics but also in quantum mechanics, where the tight-binding model coupled with the nearest neighbour approximation can be analysed with the same tools as those developed here.

We establish several new results on the existence of probability distributions on the independent sets in triangle-free graphs where each vertex is present with a given probability. This setting was introduced and studied under the name of “fractional coloring with local demands” by Kelly and Postle and is closely related to the well-studied fractional chromatic number of graphs.

Our first main result strengthens Shearer’s classic bound on independence number, proving that for every triangle-free graph G there exists a distribution over independent sets where each vertex v appears with probability $(1-o(1))\frac {\ln d_G(v)}{d_G(v)}$, resolving a conjecture by Kelly and Postle. This in turn implies new upper bounds on the fractional chromatic number of triangle-free graphs with a prescribed number of vertices or edges, which resolves a conjecture by Cames van Batenburg et al. and addresses yet another one by the same authors.

Our second main result resolves Harris’ conjecture on triangle-free d-degenerate graphs, showing that such graphs have fractional chromatic number at most $(4+o(1))\frac {d}{\ln d}$. As previously observed by various authors, this in turn has several interesting consequences. A notable example is that every triangle-free graph with minimum degree d contains a bipartite induced subgraph of minimum degree $\Omega (\log d)$. This settles a conjecture by Esperet, Kang, and Thomassé.

The main technique employed to obtain our results is the analysis of carefully designed random processes on vertex-weighted triangle-free graphs that preserve weights in expectation. The analysis of these processes yields weighted generalizations of the aforementioned results that may be of independent interest.

We consider a new family $(\mathcal {T}_n)_{n\geq 1}$ of aperiodic sets of Wang tiles and we describe the dynamical properties of the set $\Omega _n$ of valid configurations $\mathbb {Z}^2\to \mathcal {T}_n$. The tiles can be defined as the different instances of a square-shaped computer chip whose inputs and outputs are 3-dimensional integer vectors. The family include the Ammann aperiodic set of 16 Wang tiles and gathers the hallmarks of other small aperiodic sets of Wang tiles. Notably, the tiles satisfy additive versions of equations verified by the Kari–Culik aperiodic sets of 14 and 13 Wang tiles. Also configurations in $\Omega _n$ are the codings of a $\mathbb {Z}^2$-action on a 2-dimensional torus like the Jeandel–Rao aperiodic set of 11 Wang tiles. The family broadens the relation between quadratic integers and aperiodic tilings beyond the omnipresent golden ratio as the dynamics of $\Omega _n$ involves the positive root $\beta $ of the polynomial $x^2-nx-1$, also known as the n-th metallic mean. We show the existence of an almost one-to-one factor map $\Omega _n\to \mathbb {T}^2$ which commutes the shift action on $\Omega _n$ with horizontal and vertical translations by $\beta $ on $\mathbb {T}^2$. The factor map can be explicitly defined by the average of the top labels from the same row of tiles as in Kari and Culik examples. The proofs are based on the minimality of $\Omega _n$ (proved in a previous article) and a polygonal partition of $\mathbb {T}^2$ which we show is a Markov partition for the toral $\mathbb {Z}^2$-action. The partition and the sets of Wang tiles are symmetric which makes them, like Penrose tilings, worthy of investigation.

For a family $\mathcal {F}$ of graphs, let ${\mathrm {ex}}(n,\mathcal {F})$ denote the maximum number of edges in an n-vertex graph which contains none of the members of $\mathcal {F}$ as a subgraph. A longstanding problem in extremal graph theory asks to determine the function ${\mathrm {ex}}(n,\{C_3,C_4\})$. Here we give a new construction for dense graphs of girth at least five with arbitrary number of vertices, providing the first improvement on the lower bound of ${\mathrm {ex}}(n,\{C_3,C_4\})$ since 1976. As a corollary, this yields a negative answer to a problem in Chung-Graham [3].

We sharpen and generalize the dimension growth bounds for the number of points of bounded height lying on an irreducible algebraic variety of degree d, over any global field. In particular, we focus on the affine hypersurface situation by relaxing the condition on the top degree homogeneous part of the polynomial describing the affine hypersurface, while sharpening the dependence on the degree in the bounds compared to previous results. We formulate a conjecture about plane curves which provides a conjectural approach to the uniform degree $3$ case (the only remaining open case). For induction on dimension, we develop a higher-dimensional effective version of Hilbert’s irreducibility theorem, which is of independent interest.

We present bounds on the maximal gain of adaptive and randomized algorithms over nonadaptive, deterministic ones for approximating linear operators on convex sets. If the sets are additionally symmetric, then our results are optimal. For nonsymmetric sets, we unify some notions of n-widths and s-numbers, and show their connection to minimal errors. We also discuss extensions to nonlinear widths and approximation based on function values, and conclude with a list of open problems.