We study singular del Pezzo surfaces that are quasi-smooth and well-formed weighted hypersurfaces. We give an algorithm to classify all of them.

We provide an equivariant extension of the bivariant Cuntz semigroup introduced in previous work for the case of compact group actions over C*-algebras. Its functoriality properties are explored, and some well-known classification results are retrieved. Connections with crossed products are investigated, and a concrete presentation of equivariant Cuntz homology is provided. The theory that is here developed can be used to define the equivariant Cuntz semigroup. We show that the object thus obtained coincides with the one recently proposed by Gardella [‘Regularity properties and Rokhlin dimension for compact group actions’, Houston J. Math. 43(3) (2017), 861–889], and we complement their work by providing an open projection picture of it.

In this paper we consider j-tuple-connected components in random k-uniform hypergraphs (the j-tuple-connectedness relation can be defined by letting two j-sets be connected if they lie in a common edge and considering the transitive closure; the case j = 1 corresponds to the common notion of vertex-connectedness). We show that the existence of a j-tuple-connected component containing Θ(nj) j-sets undergoes a phase transition and show that the threshold occurs at edge probability

$$\frac{(k-j)!}{\binom{k}{j}-1}n^{j-k}.$$

Our main original contribution is a bounded degree lemma, which controls the structure of the component grown in the search process.

The asymptotic phase θ of an initial point x in the stable manifold of a limit cycle (LC) identifies the phase of the point on the LC to which the flow φt(x) converges as t → ∞. The infinitesimal phase response curve (iPRC) quantifies the change in timing due to a small perturbation of a LC trajectory. For a stable LC in a smooth dynamical system, the iPRC is the gradient ∇x(θ) of the phase function, which can be obtained via the adjoint of the variational equation. For systems with discontinuous dynamics, the standard approach to obtaining the iPRC fails. We derive a formula for the iPRCs of LCs occurring in piecewise smooth (Filippov) dynamical systems of arbitrary dimension, subject to a transverse flow condition. Discontinuous jumps in the iPRC can occur at the boundaries separating subdomains, and are captured by a linear matching condition. The matching matrix, M, can be derived from the saltation matrix arising in the associated variational problem. For the special case of linear dynamics away from switching boundaries, we obtain an explicit expression for the iPRC. We present examples from cell biology (Glass networks) and neuroscience (central pattern generator models). We apply the iPRCs obtained to study synchronization and phase-locking in piecewise smooth LC systems in which synchronization arises solely due to the crossing of switching manifolds.

Subconvexity bounds on the critical line are proved for general Epstein zeta-functions of $k$-ary quadratic forms. This is related to sup-norm bounds for unitary Eisenstein series on $\text{GL}(k)$ associated with the maximal parabolic of type $(k-1,1)$, and the exact sup-norm exponent is determined to be $(k-2)/8$ for $k\geqslant 4$. In particular, if $k$ is odd, this exponent is not in $\frac{1}{4}\mathbb{Z}$, which is relevant in the context of Sarnak’s purity conjecture and shows that it can in general not directly be generalized to Eisenstein series.

We investigate self-similar sign-changing solutions to the thin-film equation, ht = −(|h|nhxxx)x, on the semi-infinite domain x ≥ 0 with zero-pressure-type boundary conditions h = hxx = 0 imposed at the origin. In particular, we identify classes of first- and second-kind compactly supported self-similar solutions (with a free-boundary x = s(t) = Ltβ) and consider how these solutions depend on the mobility exponent n; multiple solutions can exist with the same number of sign changes. For n = 0, we also construct first-kind self-similar solutions on the entire half-line x ≥ 0 and show that they act as limiting cases for sequences of compactly supported solutions in the limit of infinitely many sign changes. In addition, at n = 1, we highlight accumulation point-like behaviour of sign-changes local to the moving interface x = s(t). We conclude with a numerical investigation of solutions to the full time-dependent partial differential equation (based on a non-local regularisation of the mobility coefficient) and discuss the computational results in relation to the self-similar solutions.

We prove Hardy-type inequalities for a fractional Dunkl–Hermite operator, which incidentally gives Hardy inequalities for the fractional harmonic oscillator as well. The idea is to use h-harmonic expansions to reduce the problem in the Dunkl–Hermite context to the Laguerre setting. Then, we push forward a technique based on a non-local ground representation, initially developed by Frank et al. [‘Hardy–Lieb–Thirring inequalities for fractional Schrödinger operators, J. Amer. Math. Soc. 21 (2008), 925–950’] in the Euclidean setting, to obtain a Hardy inequality for the fractional-type Laguerre operator. The above-mentioned method is shown to be adaptable to an abstract setting, whenever there is a ‘good’ spectral theorem and an integral representation for the fractional operators involved.

NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proved to be easy. We show the intractability of random instances of a graph colouring problem: this graph problem is hard on average unless all NP problems under all samplable (i.e. generatable in polynomial time) distributions are easy. Worst case reductions use special gadgets and typically map instances into a negligible fraction of possible outputs. Ours must output nearly random graphs and avoid any super-polynomial distortion of probabilities. This poses significant technical difficulties.

It follows from known results that every regular tripartite hypergraph of positive degree, with n vertices in each class, has matching number at least n/2. This bound is best possible, and the extremal configuration is unique. Here we prove a stability version of this statement, establishing that every regular tripartite hypergraph with matching number at most (1 + ϵ)n/2 is close in structure to the extremal configuration, where ‘closeness’ is measured by an explicit function of ϵ.

In this paper we introduce some Christoffel–Darboux type identities for independence polynomials. As an application, we give a new proof of a theorem of Chudnovsky and Seymour, which states that the independence polynomial of a claw-free graph has only real roots. Another application is related to a conjecture of Merrifield and Simmons.

We revisit the well-known chemostat model, considering that bacteria can be attached together in aggregates or flocs. We distinguish explicitly free and attached compartments in the model and give sufficient conditions for coexistence of these two forms. We then study the case of fast attachment and detachment and show how it is related to density-dependent growth functions. Finally, we give some insights concerning the cases of multi-specific flocs and different removal rates.

We consider distance colourings in graphs of maximum degree at most d and how excluding one fixed cycle of length ℓ affects the number of colours required as d → ∞. For vertex-colouring and t ⩾ 1, if any two distinct vertices connected by a path of at most t edges are required to be coloured differently, then a reduction by a logarithmic (in d) factor against the trivial bound O(dt) can be obtained by excluding an odd cycle length ℓ ⩾ 3t if t is odd or by excluding an even cycle length ℓ ⩾ 2t + 2. For edge-colouring and t ⩾ 2, if any two distinct edges connected by a path of fewer than t edges are required to be coloured differently, then excluding an even cycle length ℓ ⩾ 2t is sufficient for a logarithmic factor reduction. For t ⩾ 2, neither of the above statements are possible for other parity combinations of ℓ and t. These results can be considered extensions of results due to Johansson (1996) and Mahdian (2000), and are related to open problems of Alon and Mohar (2002) and Kaiser and Kang (2014).

Keller and Kindler recently established a quantitative version of the famousBenjamini–Kalai–Schramm theorem on the noise sensitivity of Boolean functions.Their result was extended to the continuous Gaussian setting by Keller, Mosseland Sen by means of a Central Limit Theorem argument. In this work we present aunified approach to these results, in both discrete and continuous settings. Theproof relies on semigroup decompositions together with a suitable cut-offargument, allowing for the efficient use of the classical hypercontractivitytool behind these results. It extends to further models of interest such asfamilies of log-concave measures and Cayley and Schreier graphs. In particularwe obtain a quantitative version of the Benjamini–Kalai–Schramm theorem for theslices of the Boolean cube.

Two graphs G1 and G2 on n vertices are said to pack if there exist injective mappings of their vertex sets into [n] such that the images of their edge sets are disjoint. A longstanding conjecture due to Bollobás and Eldridge and, independently, Catlin, asserts that if (Δ(G1) + 1)(Δ(G2) + 1) ⩽ n + 1, then G1 and G2 pack. We consider the validity of this assertion under the additional assumption that G1 or G2 has bounded codegree. In particular, we prove for all t ⩾ 2 that if G1 contains no copy of the complete bipartite graph K2,t and Δ(G1) > 17t · Δ(G2), then (Δ(G1) + 1)(Δ(G2) + 1) ⩽ n + 1 implies that G1 and G2 pack. We also provide a mild improvement if moreover G2 contains no copy of the complete tripartite graph K1,1,s, s ⩾ 1.

It is known that w.h.p. the hitting time τ2σ for the random graph process to have minimum degree 2σ coincides with the hitting time for σ edge-disjoint Hamilton cycles [4, 9, 13]. In this paper we prove an online version of this property. We show that, for a fixed integer σ ⩾ 2, if random edges of Kn are presented one by one then w.h.p. it is possible to colour the edges online with σ colours so that at time τ2σ each colour class is Hamiltonian.

We construct minor-closed addable families of graphs that are subcritical and contain all planar graphs. This contradicts (one direction of) a well-known conjecture of Noy.

We extend T. Y. Thomas’s approach to projective structures, over the complex analytic category, by involving the $\unicode[STIX]{x1D70C}$-connections. This way, a better control of projective flatness is obtained and, consequently, we have, for example, the following application: if the twistor space of a quaternionic manifold $P$ is endowed with a complex projective structure then $P$ can be locally identified, through quaternionic diffeomorphisms, with the quaternionic projective space.

Let $G$ be a semisimple Lie group with associated symmetric space $D$, and let $\unicode[STIX]{x1D6E4}\subset G$ be a cocompact arithmetic group. Let $\mathscr{L}$ be a lattice inside a $\mathbb{Z}\unicode[STIX]{x1D6E4}$-module arising from a rational finite-dimensional complex representation of $G$. Bergeron and Venkatesh recently gave a precise conjecture about the growth of the order of the torsion subgroup $H_{i}(\unicode[STIX]{x1D6E4}_{k};\mathscr{L})_{\operatorname{tors}}$ as $\unicode[STIX]{x1D6E4}_{k}$ ranges over a tower of congruence subgroups of $\unicode[STIX]{x1D6E4}$. In particular, they conjectured that the ratio $\log |H_{i}(\unicode[STIX]{x1D6E4}_{k};\mathscr{L})_{\operatorname{tors}}|/[\unicode[STIX]{x1D6E4}:\unicode[STIX]{x1D6E4}_{k}]$ should tend to a nonzero limit if and only if $i=(\dim (D)-1)/2$ and $G$ is a group of deficiency $1$. Furthermore, they gave a precise expression for the limit. In this paper, we investigate computationally the cohomology of several (non-cocompact) arithmetic groups, including $\operatorname{GL}_{n}(\mathbb{Z})$ for $n=3,4,5$ and $\operatorname{GL}_{2}(\mathscr{O})$ for various rings of integers, and observe its growth as a function of level. In all cases where our dataset is sufficiently large, we observe excellent agreement with the same limit as in the predictions of Bergeron–Venkatesh. Our data also prompts us to make two new conjectures on the growth of torsion not covered by the Bergeron–Venkatesh conjecture.

We prove the existence of positive radial solutions to a class of semipositone p-Laplacian problems on the exterior of a ball subject to Dirichlet and nonlinear boundary conditions. Using variational methods we prove the existence of a solution, and then use a priori estimates to prove the positivity of the solution.