The detection of the bifurcation set of polynomial mapping ℝn → ℝp , n ⩾ p, in more than two variables remains an unsolved problem. In this note we provide a solution for n = p + 1 ⩾ 3.

We consider the algebra of holomorphic functions on L ∞ that are symmetric, i.e. that are invariant under composition of the variable with any measure-preserving bijection of [0, 1]. Its spectrum is identified with the collection of scalar sequences such that is bounded and turns to be separable. All this follows from our main result that the subalgebra of symmetric polynomials on L ∞ has a natural algebraic basis.

We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(1.5029n ). This improves an earlier bound of O(1.6181n ) established by van Kreveld, Löffler and Pach (2012), and almost matches the current best lower bound of Ω(1.5028n ) due to the same authors. Given a planar straight-line graph G with n vertices, we also show how to compute efficiently the number of convex polygons in G.

We identify the asymptotic probability of a configuration model CMn (d) producing a connected graph within its critical window for connectivity that is identified by the number of vertices of degree 1 and 2, as well as the expected degree. In this window, the probability that the graph is connected converges to a non-trivial value, and the size of the complement of the giant component weakly converges to a finite random variable. Under a finite second moment condition we also derive the asymptotics of the connectivity probability conditioned on simplicity, from which follows the asymptotic number of simple connected graphs with a prescribed degree sequence.

We study an abstract second order inclusion involving two nonlinear single-valued operators and a nonlinear multi-valued term. Our goal is to establish the existence of solutions to the problem by applying numerical scheme based on time discretization. We show that the sequence of approximate solution converges weakly to a solution of the exact problem. We apply our abstract result to a dynamic, second-order-in-time differential inclusion involving a Clarke subdifferential of a locally Lipschitz, possibly non-convex and non-smooth potential. In the two presented examples the Clarke subdifferential appears either in a source term or in a boundary term.

The name of Frank Ramsey is universally known amongst combinatorial mathematicians, but our casual mental picture of him can easily be an unimpressive one – the man who almost stumbled across the theorem that now bears his name, thereby anticipating Erdős and Szekeres, who of course gave the proper proof. Such an idea of Ramsey is entirely false: he was an absolutely brilliant man, who would certainly have become even more famous had he not died so young, and who would surely, it could easily be argued, have made yet further remarkable contributions to philosophy, economics and logic – and to combinatorics.

The numerical solution of large-scale PDEs, such as those occurring in data-driven applications, unavoidably require powerful parallel computers and tailored parallel algorithms to make the best possible use of them. In fact, considerations about the parallelization and scalability of realistic problems are often critical enough to warrant acknowledgement in the modelling phase. The purpose of this paper is to spread awareness of the Probabilistic Domain Decomposition (PDD) method, a fresh approach to the parallelization of PDEs with excellent scalability properties. The idea exploits the stochastic representation of the PDE and its approximation via Monte Carlo in combination with deterministic high-performance PDE solvers. We describe the ingredients of PDD and its applicability in the scope of data science. In particular, we highlight recent advances in stochastic representations for non-linear PDEs using branching diffusions, which have significantly broadened the scope of PDD. We envision this work as a dictionary giving large-scale PDE practitioners references on the very latest algorithms and techniques of a non-standard, yet highly parallelizable, methodology at the interface of deterministic and probabilistic numerical methods. We close this work with an invitation to the fully non-linear case and open research questions.

Let A and B be disjoint sets, of size 2k , of vertices of Qn , the n-dimensional hypercube. In 1997, Bollobás and Leader proved that there must be (n − k)2k edge-disjoint paths between such A and B. They conjectured that when A is a down-set and B is an up-set, these paths may be chosen to be directed (that is, the vertices in the path form a chain). We use a novel type of compression argument to prove stronger versions of these conjectures, namely that the largest number of edge-disjoint paths between a down-set A and an up-set B is the same as the largest number of directed edge-disjoint paths between A and B. Bollobás and Leader made an analogous conjecture for vertex-disjoint paths, and we prove a strengthening of this by similar methods. We also prove similar results for all other sizes of A and B.

For each discriminant $D>1$, McMullen constructed the Prym–Teichmüller curves $W_{D}(4)$ and $W_{D}(6)$ in ${\mathcal{M}}_{3}$ and ${\mathcal{M}}_{4}$, which constitute one of the few known infinite families of geometrically primitive Teichmüller curves. In the present paper, we determine for each $D$ the number and type of orbifold points on $W_{D}(6)$. These results, together with a previous result of the two authors in the genus $3$ case and with results of Lanneau–Nguyen and Möller, complete the topological characterisation of all Prym–Teichmüller curves and determine their genus. The study of orbifold points relies on the analysis of intersections of $W_{D}(6)$ with certain families of genus $4$ curves with extra automorphisms. As a side product of this study, we give an explicit construction of such families and describe their Prym–Torelli images, which turn out to be isomorphic to certain products of elliptic curves. We also give a geometric description of the flat surfaces associated to these families and describe the asymptotics of the genus of $W_{D}(6)$ for large $D$.

This paper is concerned with the invisibility cloaking in acoustic wave scattering from a new perspective. We are especially interested in achieving the invisibility cloaking by completely regular and isotropic mediums. It is shown that an interior transmission eigenvalue problem arises in our study, which is the one considered theoretically in Cakoni et al. (Transmission eigenvalues for inhomogeneous media containing obstacles, Inverse Problems and Imaging, 6 (2012), 373–398). Based on such an observation, we propose a cloaking scheme that takes a three-layer structure including a cloaked region, a lossy layer and a cloaking shell. The target medium in the cloaked region can be arbitrary but regular, whereas the mediums in the lossy layer and the cloaking shell are both regular and isotropic. We establish that if a certain non-transparency condition is satisfied, then there exists an infinite set of incident waves such that the cloaking device is nearly invisible under the corresponding wave interrogation. The set of waves is generated from the Herglotz approximation of the associated interior transmission eigenfunctions. We provide both theoretical and numerical justifications.

We introduce the notion of regularity for a relative holonomic ${\mathcal{D}}$-module in the sense of Monteiro Fernandes and Sabbah [Internat. Math. Res. Not. (21) (2013), 4961–4984]. We prove that the solution functor from the bounded derived category of regular relative holonomic modules to that of relative constructible complexes is essentially surjective by constructing a right quasi-inverse functor. When restricted to relative ${\mathcal{D}}$-modules underlying a regular mixed twistor ${\mathcal{D}}$-module, this functor satisfies the left quasi-inverse property.

We show that, in the two-dimensional case, every objective, isotropic and isochoric energy function that is rank-one convex on GL+(2) is already polyconvex on GL+(2). Thus, we answer in the negative Morrey's conjecture in the subclass of isochoric nonlinear energies, since polyconvexity implies quasi-convexity. Our methods are based on different representation formulae for objective and isotropic functions in general, as well as for isochoric functions in particular. We also state criteria for these convexity conditions in terms of the deviatoric part of the logarithmic strain tensor.

We establish a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to as mixing, or pseudo-randomness). Recently, an analogue of this lemma was proved for simplicial complexes of arbitrary dimension, provided that the skeleton of the complex is complete. More precisely, it was shown that a concentrated spectrum of the simplicial Hodge Laplacian implies a similar type of pseudo-randomness as in graphs. In this paper we remove the assumption of a complete skeleton, showing that simultaneous concentration of the Laplace spectra in all dimensions implies pseudo-randomness in any complex. We discuss various applications and present some open questions.

A class of graphs is called bridge-addable if, for each graph in the class and each pair u and v of vertices in different components, the graph obtained by adding an edge joining u and v must also be in the class. The concept was introduced in 2005 by McDiarmid, Steger and Welsh, who showed that, for a random graph sampled uniformly from such a class, the probability that it is connected is at least 1/e.

We generalize this and related results to bridge-addable classes with edge-weights which have an edge-expansion property. Here, a graph is sampled with probability proportional to the product of its edge-weights. We obtain for example lower bounds for the probability of connectedness of a graph sampled uniformly from a relatively bridge-addable class of graphs, where some but not necessarily all of the possible bridges are allowed to be introduced. Furthermore, we investigate whether these bounds are tight, and in particular give detailed results about random forests in complete balanced multipartite graphs.

Making use of Gruson–Raynaud’s technique of ‘platification par éclatement’, Kerz and Strunk proved that the negative homotopy $K$-theory groups of a Noetherian scheme $X$ of Krull dimension $d$ vanish below $-d$. In this article, making use of noncommutative algebraic geometry, we improve this result in the case of quotient singularities by proving that the negative homotopy $K$-theory groups vanish below $-1$. Furthermore, in the case of cyclic quotient singularities, we provide an explicit ‘upper bound’ for the first negative homotopy $K$-theory group.

We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of independent sets, among other combinatorial quantities. Our methods involve inequalities for determinants, for traces of functions of operators, and for entropy.