An intersection graph of curves in the plane is called a string graph. Matoušek almost completely settled a conjecture of the authors by showing that every string graph with m edges admits a vertex separator of size $O(\sqrt{m}\log m)$. In the present note, this bound is combined with a result of the authors, according to which every dense string graph contains a large complete balanced bipartite graph. Three applications are given concerning string graphs G with n vertices: (i) if Kt ⊈ G for some t, then the chromatic number of G is at most (log n)O(log t); (ii) if Kt,t ⊈ G, then G has at most t(log t)O(1)n edges,; and (iii) a lopsided Ramsey-type result, which shows that the Erdős–Hajnal conjecture almost holds for string graphs.

We propose a counting dimension for subsets of $\mathbb{Z}$ and prove that, under certain conditions on E,F ⊂ $\mathbb{Z}$, for Lebesgue almost every λ ∈ $\mathbb{R}$ the counting dimension of E + ⌊λF⌋ is at least the minimum between 1 and the sum of the counting dimensions of E and F. Furthermore, if the sum of the counting dimensions of E and F is larger than 1, then E + ⌊λF⌋ has positive upper Banach density for Lebesgue almost every λ ∈ $\mathbb{R}$. The result has direct consequences when E,F are arithmetic sets, e.g., the integer values of a polynomial with integer coefficients.

For any c ≥ 2, a c-strong colouring of the hypergraph G is an assignment of colours to the vertices of G such that, for every edge e of G, the vertices of e are coloured by at least min{c,|e|} distinct colours. The hypergraph G is t-intersecting if every two edges of G have at least t vertices in common.

A natural variant of a question of Erdős and Lovász is: For fixed c ≥ 2 and t ≥ 1, what is the minimum number of colours that is sufficient to c-strong colour any t-intersecting hypergraphs? The purpose of this note is to describe some open problems related to this question.

Given an edge colouring of a graph with a set of m colours, we say that the graph is exactly m-coloured if each of the colours is used. We consider edge colourings of the complete graph on $\mathbb{N}$ with infinitely many colours and show that either one can find an exactly m-coloured complete subgraph for every natural number m or there exists an infinite subset X ⊂ $\mathbb{N}$ coloured in one of two canonical ways: either the colouring is injective on X or there exists a distinguished vertex v in X such that X\{v} is 1-coloured and each edge between v and X\{v} has a distinct colour (all different to the colour used on X\{v}). This answers a question posed by Stacey and Weidl in 1999. The techniques that we develop also enable us to resolve some further questions about finding exactly m-coloured complete subgraphs in colourings with finitely many colours.

In this work, we describe a method to construct the generic braid monodromy of the preimage of a curve by a Kummer cover. This method is interesting since it combines two techniques, namely, the construction of a highly non-generic braid monodromy and a systematic method to go from a non-generic to a generic braid monodromy. The latter process, called generification, is independent from Kummer covers, and it can be applied in more general circumstances since non-generic braid monodromies appear more naturally and are oftentimes much easier to compute. Explicit examples are computed using these techniques.

Systematic asymptotic methods are used to formulate a model for the extensional flow of a thin sheet of nematic liquid crystal. With no external body forces applied, the model is found to be equivalent to the so-called Trouton model for Newtonian sheets (and fibres), albeit with a modified ‘Trouton ratio’. However, with a symmetry-breaking electric field gradient applied, behaviour deviates from the Newtonian case, and the sheet can undergo finite-time breakup if a suitable destabilizing field is applied. Some simple exact solutions are presented to illustrate the results in certain idealized limits, as well as sample numerical results to the full model equations.

The behaviour of two-dimensional finite blobs of conducting viscous fluid in a Hele-Shaw cell subject to an electric field is considered. The time-dependent free boundary problem is studied both analytically using the Schwarz function of the free boundary and numerically using a boundary integral method. Various problems are considered, including (i) the behaviour of an initially circular blob of conducting fluid subject to an electric point charge located arbitrarily within the blob, (ii) the delay in cusp formation on the free boundary in sink-driven flow due to a strategically placed electric charge and (iii) the stability of exact steady solutions having both hydrodynamic and electric forcing.

The present paper represents a continuation of Sofonea and Matei's paper (Sofonea, M. and Matei, A. (2011) History-dependent quasivariational inequalities arising in contact mechanics. Eur. J. Appl. Math. 22, 471–491). There a new class of variational inequalities involving history-dependent operators was considered, an abstract existence and uniqueness result was proved and it was completed with a regularity result. Moreover, these results were used in the analysis of various frictional and frictionless models of contact. In this current paper we present a penalization method in the study of such inequalities. We start with an example which motivates our study; it concerns a mathematical model which describes the quasistatic contact between a viscoelastic body and a foundation; the material's behaviour is modelled with a constitutive law with long memory, the contact is frictionless and is modelled with a multivalued normal compliance condition and unilateral constraint. Then we introduce the abstract variational inequalities together with their penalizations. We prove the unique solvability of the penalized problems and the convergence of their solutions to the solution of the original problem, as the penalization parameter converges to zero. Finally, we turn back to our contact model, apply our abstract results in the study of this problem and provide their mechanical interpretation.

We deal with the incompressible Navier–Stokes equations with vortex patches as initial data. Such data describe an initial configuration for which the vorticity is discontinuous across a hypersurface. We give an asymptotic expansion of the solutions in the vanishing viscosity limit which exhibits an internal layer where the fluid vorticity has a sharp variation. This layer moves with the flow of the Euler equations.