We give a complete description of quadratic twisted potential algebras on three generators as well as cubic twisted potential algebras on two generators up to graded algebra isomorphisms under the assumption that the ground field is algebraically closed and has characteristic other than 2 or 3.

The curse of dimensionality is commonly encountered in numerical partial differential equations (PDE), especially when uncertainties have to be modelled into the equations as random coefficients. However, very often the variability of physical quantities derived from PDE can be captured by a few features on the space of the coefficient fields. Based on such observation, we propose using neural network to parameterise the physical quantity of interest as a function of input coefficients. The representability of such quantity using a neural network can be justified by viewing the neural network as performing time evolution to find the solutions to the PDE. We further demonstrate the simplicity and accuracy of the approach through notable examples of PDEs in engineering and physics.

A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid for special cases of a property introduced by Schwenk. For the case of cubic (3-regular) graphs, computational results are given which show that the construction generates a large proportion of the cubic graphs, which are cospectral with another cubic graph.

Given graphs H1, H2, a graph G is (H1, H2) -Ramsey if, for every colouring of the edges of G with red and blue, there is a red copy of H1 or a blue copy of H2. In this paper we investigate Ramsey questions in the setting of randomly perturbed graphs. This is a random graph model introduced by Bohman, Frieze and Martin [8] in which one starts with a dense graph and then adds a given number of random edges to it. The study of Ramsey properties of randomly perturbed graphs was initiated by Krivelevich, Sudakov and Tetali [30] in 2006; they determined how many random edges must be added to a dense graph to ensure the resulting graph is with high probability (K3, Kt) -Ramsey (for t ≽ 3). They also raised the question of generalizing this result to pairs of graphs other than (K3, Kt). We make significant progress on this question, giving a precise solution in the case when H1 = Ks and H2 = Kt where s, t ≽ 5. Although we again show that one requires polynomially fewer edges than in the purely random graph, our result shows that the problem in this case is quite different to the (K3, Kt) -Ramsey question. Moreover, we give bounds for the corresponding (K4, Kt) -Ramsey question; together with a construction of Powierski [37] this resolves the (K4, K4) -Ramsey problem.

We also give a precise solution to the analogous question in the case when both H1 = Cs and H2 = Ct are cycles. Additionally we consider the corresponding multicolour problem. Our final result gives another generalization of the Krivelevich, Sudakov and Tetali [30] result. Specifically, we determine how many random edges must be added to a dense graph to ensure the resulting graph is with high probability (Cs, Kt) -Ramsey (for odd s ≽ 5 and t ≽ 4).

To prove our results we combine a mixture of approaches, employing the container method, the regularity method as well as dependent random choice, and apply robust extensions of recent asymmetric random Ramsey results.

A diregular bipartite tournament is a balanced complete bipartite graph whose edges are oriented so that every vertex has the same in- and out-degree. In 1981 Jackson showed that a diregular bipartite tournament contains a Hamilton cycle, and conjectured that in fact its edge set can be partitioned into Hamilton cycles. We prove an approximate version of this conjecture: for every ε > 0 there exists n0 such that every diregular bipartite tournament on 2n ≥ n0 vertices contains a collection of (1/2–ε)n cycles of length at least (2–ε)n. Increasing the degree by a small proportion allows us to prove the existence of many Hamilton cycles: for every c > 1/2 and ε > 0 there exists n0 such that every cn-regular bipartite digraph on 2n ≥ n0 vertices contains (1−ε)cn edge-disjoint Hamilton cycles.

We prove Bogolyubov–Ruzsa-type results for finite subsets of groups with small tripling, |A3| ≤ O(|A|), or small alternation, |AA−1A| ≤ O(|A|). As applications, we obtain a qualitative analogue of Bogolyubov’s lemma for dense sets in arbitrary finite groups, as well as a quantitative arithmetic regularity lemma for sets of bounded VC-dimension in finite groups of bounded exponent. The latter result generalizes the abelian case, due to Alon, Fox and Zhao, and gives a quantitative version of previous work of the author, Pillay and Terry.

We investigate the Fano resonance in grating structures using coupled resonators. The grating consists of a perfectly conducting slab with periodically arranged subwavelength slit holes, where inside each period, a pair of slits sit very close to each other. The slit holes act as resonators and are strongly coupled. It is shown rigorously that there exist two groups of resonances corresponding to poles of the scattering problem. One sequence of resonances has imaginary part in the order of ε, where ε is the size of the slit aperture, while the other sequence has imaginary part in the order of ε2. When coupled with the incident wave at resonant frequencies, the narrow-band resonant scattering induced by the latter will interfere with the broader background resonant radiation induced by the former. The interference of these two resonances generates the Fano-type transmission anomaly, which persists in the whole radiation continuum of the grating structure as long as the slit aperture size is small compared to the incident wavelength.

Monotonic surfaces spanning finite regions of ℤd arise in many contexts, including DNA-based self-assembly, card-shuffling and lozenge tilings. One method that has been used to uniformly generate these surfaces is a Markov chain that iteratively adds or removes a single cube below the surface during a step. We consider a biased version of the chain, where we are more likely to add a cube than to remove it, thereby favouring surfaces that are ‘higher’ or have more cubes below it. We prove that the chain is rapidly mixing for any uniform bias in ℤ2 and for bias λ > d in ℤd when d > 2. In ℤ2 we match the optimal mixing time achieved by Benjamini, Berger, Hoffman and Mossel in the context of biased card shuffling [2], but using much simpler arguments. The proofs use a geometric distance function and a variant of path coupling in order to handle distances that can be exponentially large. We also provide the first results in the case of fluctuating bias, where the bias can vary depending on the location of the tile. We show that the chain continues to be rapidly mixing if the biases are close to uniform, but that the chain can converge exponentially slowly in the general setting.

We consider a Keller–Segel model that describes the cellular chemotactic movement away from repulsive chemical subject to logarithmic sensitivity function over a confined region in ${{\mathbb{R}}^n},\,n \le 2$. This sensitivity function describes the empirically tested Weber–Fecher’s law of living organism’s perception of a physical stimulus. We prove that, regardless of chemotaxis strength and initial data, this repulsive system is globally well-posed and the constant solution is the global and exponential in time attractor. Our results confirm the ‘folklore’ that chemorepulsion inhibits the formation of non-trivial steady states within the logarithmic chemotaxis model, hence preventing cellular aggregation therein.

In this paper, we prove contact Poincaré and Sobolev inequalities in Heisenberg groups $\mathbb{H}^{n}$, where the word ‘contact’ is meant to stress that de Rham’s exterior differential is replaced by the exterior differential of the so-called Rumin complex $(E_{0}^{\bullet },d_{c})$, which recovers the scale invariance under the group dilations associated with the stratification of the Lie algebra of $\mathbb{H}^{n}$. In addition, we construct smoothing operators for differential forms on sub-Riemannian contact manifolds with bounded geometry, which act trivially on cohomology. For instance, this allows us to replace a closed form, up to adding a controlled exact form, with a much more regular differential form.