Recently there has been much interest in studying random graph analogues of well-known classical results in extremal graph theory. Here we follow this trend and investigate the structure of triangle-free subgraphs of G(n, p) with high minimum degree. We prove that asymptotically almost surely each triangle-free spanning subgraph of G(n, p) with minimum degree at least (2/5 + o(1))pn is (p −1 n)-close to bipartite, and each spanning triangle-free subgraph of G(n, p) with minimum degree at least (1/3 + ϵ)pn is O(p −1 n)-close to r-partite for some r = r(ϵ). These are random graph analogues of a result by Andrásfai, Erdős and Sós (Discrete Math.8 (1974), 205–218), and a result by Thomassen (Combinatorica22 (2002), 591–596). We also show that our results are best possible up to a constant factor.

We almost completely solve a number of problems related to a concept called majority colouring recently studied by Kreutzer, Oum, Seymour, van der Zypen and Wood. They raised the problem of determining, for a natural number k, the smallest number m = m(k) such that every digraph can be coloured with m colours where each vertex has the same colour as at most a 1/k proportion of its out-neighbours. We show that m(k) ∈ {2k − 1,2k}. We also prove a result supporting the conjecture that m(2) = 3. Moreover, we prove similar results for a more general concept called majority choosability.

This paper deals with the spectral properties of self-adjoint Schrödinger operators with δʹ-type conditions on infinite regular trees. Firstly, we discuss the semi-boundedness and self-adjointness of this kind of Schrödinger operator. Secondly, by using the form approach, we give the necessary and sufficient condition that ensures that the spectra of the self-adjoint Schrödinger operators with δʹ-type conditions are discrete.

We consider the problem of minimizing the number of edges that are contained in triangles, among n-vertex graphs with a given number of edges. For sufficiently large n, we prove an exact formula for this minimum, which partially resolves a conjecture of Füredi and Maleki.

Consider the equation

where are linear positive continuous operators and f : C loc(ℝ;ℝ) → L loc(ℝ;ℝ) is a continuous operator satisfying the local Carathéodory conditions. Efficient conditions guaranteeing the existence of a global solution, which is bounded and non-negative in the neighbourhood of –∞, to the equation considered are established provided that ℓ 0, ℓ 1 and f are Volterra-type operators. The existence of a solution that is positive on the whole real line is discussed as well. Furthermore, the asymptotic properties of such solutions are studied in the neighbourhood of –∞. The results are applied to certain models appearing in the natural sciences.

Harish-Chandra induction and restriction functors play a key role in the representation theory of reductive groups over finite fields. In this paper, extending earlier work of Dat, we introduce and study generalisations of these functors which apply to a wide range of finite and profinite groups, typical examples being compact open subgroups of reductive groups over non-archimedean local fields. We prove that these generalisations are compatible with two of the tools commonly used to study the (smooth, complex) representations of such groups, namely Clifford theory and the orbit method. As a test case, we examine in detail the induction and restriction of representations from and to the Siegel Levi subgroup of the symplectic group $\text{Sp}_{4}$ over a finite local principal ideal ring of length two. We obtain in this case a Mackey-type formula for the composition of these induction and restriction functors which is a perfect analogue of the well-known formula for the composition of Harish-Chandra functors. In a different direction, we study representations of the Iwahori subgroup $I_{n}$ of $\text{GL}_{n}(F)$, where $F$ is a non-archimedean local field. We establish a bijection between the set of irreducible representations of $I_{n}$ and tuples of primitive irreducible representations of smaller Iwahori subgroups, where primitivity is defined by the vanishing of suitable restriction functors.

A closed curve flow on the 2-sphere evolved by a fourth-order nonlinear dispersive partial differential equation on the one-dimensional flat torus is studied. The governing equation arises in the field of physics in relation to the continuum limit of the Heisenberg spin chain systems or three-dimensional motion of the isolated vortex filament. The main result of the paper gives the local existence and uniqueness of a solution to the initial-value problem by overcoming loss of derivatives in the classical energy method and the absence of the local smoothing effect. The proof is based on the delicate analysis of the lower-order terms to find out the loss of derivatives and on the gauged energy method to eliminate the obstruction.

Let [An,k ]n,k ⩾0 be an infinite lower triangular array satisfying the recurrence

for n ⩾ 1 and k ⩾ 0, where A 0,0 = 1, A 0,k = A k,–1 = 0 for k > 0. We present some criteria for the log-concavity of rows and strong q-log-convexity of generating functions of rows. Our results can be applied to many well-known triangular arrays, such as the Pascal triangle, the Stirling triangle of the second kind, the Bell triangle, the large Schröder triangle, the Motzkin triangle, and the Catalan triangles of Aigner and Shapiro, in a unified approach. In addition, we prove that the binomial transformation not only preserves the strong q-log-convexity property, but also preserves the strong q-log-concavity property. Finally, we demonstrate that the strong q-log-convexity property is preserved by the Stirling transformation and Whitney transformation of the second kind, which extends some known results for the strong q-log-convexity property.

Bifurcation of non-radial solutions from radial solutions of a semilinear elliptic equation with negative exponent in expanding annuli of ℝ2 is studied. To obtain the main results, we use a blow-up argument via the Morse index of the regular entire solutions of the equation

The main results of this paper can be seen as applications of the results obtained recently for finite Morse index solutions of the equation

with N ⩾ 2 and p > 0.

In this paper we use U(2), the group of 2 × 2 unitary matrices, to parametrize the space of all self-adjoint boundary conditions for a fixed Sturm–Liouville equation on the interval [0, 1]. The adjoint action of U(2) on itself naturally leads to a refined classification of self-adjoint boundary conditions – each adjoint orbit is a subclass of these boundary conditions. We give explicit parametrizations of those adjoint orbits of principal type, i.e. orbits diffeomorphic to the 2-sphere S 2, and investigate the behaviour of the nth eigenvalue λn as a function on such orbits.

In this paper we are interested in the microscopic modelling of a two-dimensional two-well problem that arises from the square-to-rectangular transformation in (two-dimensional) shape-memory materials. In this discrete set-up, we focus on the surface energy scaling regime and further analyse the Hamiltonian that was introduced by Kitavtsev et al. in 2015. It turns out that this class of Hamiltonians allows for a direct control of the discrete second-order gradients and for a one-sided comparison with a two-dimensional spin system. Using this and relying on the ideas of Conti and Schweizer, which were developed for a continuous analogue of the model under consideration, we derive a (first-order) continuum limit. This shows the emergence of surface energy in the form of a sharp-interface limiting model as well the explicit structure of the minimizers to the latter.

In this paper we are interested in a sharp result about the global existence and blowup of solutions to a class of pseudo-parabolic equations. First, we represent a unique local weak solution in a new integral form that does not depend on any semigroup. Second, with the help of the Nehari manifold related to the stationary equation, we separate the whole space into two components S + and S – via a new method, then a sufficient and necessary condition under which the weak solution blows up is established, that is, a weak solution blows up at a finite time if and only if the initial data belongs to S –. Furthermore, we study the decay behaviour of both the solution and the energy functional, and the decay ratios are given specifically.

We show that for any commutative Noetherian regular ring $R$ containing $\mathbb{Q}$, the map $K_{1}(R)\rightarrow K_{1}\left(\frac{R[x_{1},\ldots ,x_{4}]}{(x_{1}x_{2}-x_{3}x_{4})}\right)$ is an isomorphism. This answers a question of Gubeladze. We also compute the higher $K$-theory of this monoid algebra. In particular, we show that the above isomorphism does not extend to all higher $K$-groups. We give applications to a question of Lindel on the Serre dimension of monoid algebras.

A sequence S is called anagram-free if it contains no consecutive symbols r1r2. . .rkrk+1. . .r2k such that rk+1. . .r2k is a permutation of the block r1r2. . .rk. Answering a question of Erdős and Brown, Keränen constructed an infinite anagram-free sequence on four symbols. Motivated by the work of Alon, Grytczuk, Hałuszczak and Riordan [2], we consider a natural generalization of anagram-free sequences for graph colourings. A colouring of the vertices of a given graph G is called anagram-free if the sequence of colours on any path in G is anagram-free. We call the minimal number of colours needed for such a colouring the anagram-chromatic number of G.

In this paper we study the anagram-chromatic number of several classes of graphs like trees, minor-free graphs and bounded-degree graphs. Surprisingly, we show that there are bounded-degree graphs (such as random regular graphs) in which anagrams cannot be avoided unless we essentially give each vertex a separate colour.

In the framework of Berthelot’s theory of arithmetic ${\mathcal{D}}$-modules, we prove the $p$-adic analogue of Betti number estimates and we give some standard applications.

We consider the complete graph 𝜅n on n vertices with exponential mean n edge lengths. Writing Cij for the weight of the smallest-weight path between vertices i, j ∈ [n], Janson [18] showed that maxi,j∈[n]C ij/logn converges in probability to 3. We extend these results by showing that maxi,j∈[n]Cij − 3 logn converges in distribution to some limiting random variable that can be identified via a maximization procedure on a limiting infinite random structure. Interestingly, this limiting random variable has also appeared as the weak limit of the re-centred graph diameter of the barely supercritical Erdős–Rényi random graph in [22].

Given hypergraphs F and H, an F-factor in H is a set of vertex-disjoint copies of F which cover all the vertices in H. Let K − 4 denote the 3-uniform hypergraph with four vertices and three edges. We show that for sufficiently large n ∈ 4ℕ, every 3-uniform hypergraph H on n vertices with minimum codegree at least n/2−1 contains a K − 4-factor. Our bound on the minimum codegree here is best possible. It resolves a conjecture of Lo and Markström [15] for large hypergraphs, who earlier proved an asymptotically exact version of this result. Our proof makes use of the absorbing method as well as a result of Keevash and Mycroft [11] concerning almost perfect matchings in hypergraphs.

Let $E_{\unicode[STIX]{x1D706}}$ be the Legendre family of elliptic curves. Given $n$ points $P_{1},\ldots ,P_{n}\in E_{\unicode[STIX]{x1D706}}(\overline{\mathbb{Q}(\unicode[STIX]{x1D706})})$, linearly independent over $\mathbb{Z}$, we prove that there are at most finitely many complex numbers $\unicode[STIX]{x1D706}_{0}$ such that $E_{\unicode[STIX]{x1D706}_{0}}$ has complex multiplication and $P_{1}(\unicode[STIX]{x1D706}_{0}),\ldots ,P_{n}(\unicode[STIX]{x1D706}_{0})$ are linearly dependent over End$(E_{\unicode[STIX]{x1D706}_{0}})$. This implies a positive answer to a question of Bertrand and, combined with a previous work in collaboration with Capuano, proves the Zilber–Pink conjecture for a curve in a fibered power of an elliptic scheme when everything is defined over $\overline{\mathbb{Q}}$.