Let $K$ be a field of characteristic zero and $A_{2}:=A_{2}(K)$ the 2$nd$–Weyl algebra over $K$. We establish a close connection between the maximal left ideals of $A_{2}$ and the simple derivations of $K[X_{1},X_{2}]$.

MAIN THEOREM. Let$d = \partial_1 + \beta\partial_2$be a simple derivation of$K[X_1, X_2]$with$\beta\in K[X_1, X_2]$. Then, there exists$\gamma\in K[X_1, X_2]$such that$d + \gamma$generates a maximal left ideal of$A_2$. More precisely, the following is true:

1. $\deg_{X_2} (\beta) \geq 2$ or $\deg_{X_2} (\beta) = 1$ and $\deg_{X_1} (\partial_2(\beta)) \geq 1$;

2. $d + gX_2$generates a maximal left ideal of$A_2$if$g \in K[X_1]\\{0\}$is such that

1. (a) $g \in -(\partial^2_2(\beta)/2)\mathbb{N}$when$\deg_{X_2} (\beta) \geq 2$,

2. (b) $\deg_{X_1} (g) < \deg_{X_1} (\partial_2(\beta))$when$\deg_{X_2} (\beta) = 1$.

As applications, we obtain large families of concrete examples of cyclic maximal left ideals of $A_2$; such examples have been rather scarce so far.

A proper submodule $N$ of an $R$-module $M$ is called a weakly prime submodule, if for each submodule $K$ of $M$ and elements $a, b$ of $R$, $abK \subseteq N$, implies that $aK\subseteq N$ or $bK\subseteq N$. In this paper we will study weakly prime submodules and we shall compare weakly prime submodules with prime submodules.

We prove some theorems on locally graded groups and nilpotent-by-Chernikov groups.

We define a subset $\mathcal Z$ of $(1,+\infty)$ with the property that for each $\alpha \in {\mathcal Z}$ there is a nonzero real number $\xi = \xi(\alpha)$ such that the integral parts $[\xi \alpha^n]$ are even for all $n \in \mathbb{N}$. A result of Tijdeman implies that each number greater than or equal to 3 belongs to $\mathcal{Z}$. However, Mahler's question on whether the number 3/2 belongs to $\mathcal{Z}$ or not remains open. We prove that the set ${\mathcal S}:=(1,+\infty) \textbackslash {\mathcal Z}$ is nonempty and find explicitly some numbers in ${\mathcal Z} \cap$ (5/4,3) and in ${\mathcal S} \cap (1,2)$.

The $\ell^{1}$-convolution algebra of a semilattice is known to have trivial cohomology in degrees 1, 2 and 3 whenever the coefficient bimodule is symmetric. We extend this result to all cohomology groups of degree $\geq 1$ with symmetric coefficients. Our techniques prove a stronger splitting result, namely that the splitting can be made natural with respect to the underlying semilattice.

We introduce the concept of left APP-rings which is a generalization of left p.q.-Baer rings and right PP-rings, and investigate its properties. It is shown that the APP property is inherited by polynomial extensions and is a Morita invariant property.

Let $\alpha$ be an irrational number and $\varphi$: $\mathbb{N} \to \mathbb{R^+}$ be a decreasing sequence tending to zero. Consider the set \[E_{\varphi}(\alpha)=\{\beta \in \mathbb{R}: \ \|n \alpha- \beta\|<\varphi(n)\ {\rm {holds\ for\ infinitely\ many}} \ n \in \mathbb{N}\}\], where $\|{\cdot}\|$ denotes the distance to the nearest integer. We show that for general error function $\varphi$, the Hausdorff dimension of $E_{\varphi}(\alpha)$ depends not only on $\varphi$, but also heavily on $\alpha$. However, recall that the Hausdorff dimension of $E_{\varphi}(\alpha)$ is independent of $\alpha$ when $\varphi(n) = n^{-\gamma}$ with $\gamma >1$.

We construct a compactly generated, totally disconnected, locally compact group whose Hecke algebra with respect to any compact open subgroup does not have a $C^*$-enveloping algebra.

We consider expansions with respect to the multi-dimensional Hermite functions and to the multi-dimensional Hermite polynomials. They are respectively eigenfunctions of the Harmonic oscillator $\cal{L}= -\Delta +|x|^2$ and of the Ornstein-Uhlenbeck operator ${\bf L} = -\Delta +2x \cdot \nabla.$ The corresponding heat semigroups and Riesz transforms are considered and results on both aspects (polynomials and functions) are obtained.

Let $G$ be a compact $p$-adic analytic group and let $\Lambda_G$ be its completed group algebra with coefficient ring the $p$-adic integers $\mathbb{Z}_p$. We show that the augmentation ideal in $\Lambda_G$ of a closed normal subgroup $H$ of $G$ is localisable if and only if $H$ is finite-by-nilpotent, answering a question of Sujatha. The localisations are shown to be Auslander-regular rings with Krull and global dimensions equal to dim $H$. It is also shown that the minimal prime ideals and the prime radical of the $\mathbb{F}_p$-version $\Omega_G$ of $\Lambda_G$ are controlled by $\Omega_{\Delta^+}$, where $\Delta^+$ is the largest finite normal subgroup of $G$. Finally, we prove a conjecture of Ardakov and Brown [1].

The existence of multiple positive solutions is presented for the singular Dirichlet boundary value problems \[\left\{\begin{array}{@{}ll} x^{\prime\prime}+\Phi(t)\,f(t,x(t),|x'(t)|)=0,\\[3pt] x(0)=0,\ \ x(1)=0, \end{array}\right.\] using the fixed point index; here $f$ may be singular at $x=0$ and $x'=0$.

Motivated generally by potential applications in the liquid crystal display industry [8,35], and specifically by recent experimental, theoretical and numerical work [6,7,13,14,21,25,30,31], we consider a thin film of nematic liquid crystal (NLC), sandwiched between two parallel plates. Under certain simplifying assumptions, laid out in £2, we find that for monostable surfaces (i.e. only a single preferred director anchoring angle at each surface), two optically-distinct, steady, stable (equal energy) configurations of the director are achievable, that is, a bistable device. Moreover, it is found that the stability of both of these steady states may be destroyed by the application of a sufficiently large electric field, and that switching between the two states is possible, via the flexoelectric effect. Such a phenomenon could be used in NLC display devices, to reduce power consumption drastically. Previous theoretical demonstrations of such (switchable) bistable devices have either relied on having bistable bounding surfaces, that is, surfaces at which there are two preferred director orientations at the surface [7,14]; on having special (nonplanar) surface morphology within the cell that allows for two stable states (the zenithal bistable device (ZBD) [4,21], or, in the case of the Nemoptic BiNem technology [11,19], on flow effects and a very carefully applied electric field to effect the switching.

By the complexity of a graph we mean the minimum number of union and intersection operations needed to obtain the whole set of its edges starting from stars. This measure of graphs is related to the circuit complexity of boolean functions.

We prove some lower bounds on the complexity of explicitly given graphs. This yields some new lower bounds for boolean functions, as well as new proofs of some known lower bounds in the graph-theoretic framework. We also formulate several combinatorial problems whose solution would have intriguing consequences in computational complexity.

For an integer $b \geq 1$, the $b$-choice number of a graph $G$ is the minimum integer $k$ such that, for every assignment of a set $S(v)$ of at least $k$ colours to each vertex $v$ of $G$, there is a $b$-set colouring of $G$ that assigns to each vertex $v$ a $b$-set $B(v) \subseteq S(v) \; (|B(v)|=b)$ so that adjacent vertices receive disjoint $b$-sets. This is a generalization of the notions of choice number and chromatic number of a graph. Using probabilistic arguments, we show that, for some positive constant $c > 0$ (independent of $b$), the $b$-choice number of any graph $G$ on $n$ vertices is at most $c (b\chi) (\ln (n/\chi)+1)$ where $\chi = \chi(G)$ denotes the chromatic number of $G$. For any fixed $b$, this bound is tight up to a constant factor for each $n,\chi$. This generalizes and extends a result of Noga Alon [1]wherein a similar bound was obtained for 1-choice numbers of complete $\chi$-partite graphs with each part having size $n/\chi$. We also show that the proof arguments are constructive, leading to polynomial time algorithms for the list colouring problem on certain classes of graphs, provided each vertex is given a list of sufficiently large size.

We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to $m$ uniformly chosen nodes in the complete graph of size $N$ with i.i.d. exponential link weights. We rely on the fact that the full shortest path tree to all destinations (ie, $m=N-1$) is a uniform recursive tree to derive a recursion for the generating function of the number of links of the SPT, and solve this recursion exactly.

The explicit form of the generating function allows us to compute the expectation and variance of the size of the subtree for all $m$. We also obtain exact expressions for the average weight of the subtree.

Let $H$ be a fixed graph on $h$ vertices. We say that a graph $G$ is induced$H$-free if it does not contain any induced copy of $H$. Let $G$ be a graph on $n$ vertices and suppose that at least $\epsilon n^2$ edges have to be added to or removed from it in order to make it induced $H$-free. It was shown in [5] that in this case $G$ contains at least $f(\epsilon,h)n^h$ induced copies of $H$, where $1/f(\epsilon,h)$ is an extremely fast growing function in $1/\epsilon$, that is independent of $n$. As a consequence, it follows that for every $H$, testing induced $H$-freeness with one-sided error has query complexity independent of $n$. A natural question, raised by the first author in [1], is to decide for which graphs $H$ the function $1/f(\epsilon,H)$ can be bounded from above by a polynomial in $1/\epsilon$. An equivalent question is: For which graphs $H$ can one design a one-sided error property tester for testing induced $H$-freeness, whose query complexity is polynomial in $1/\epsilon$? We settle this question almost completely by showing that, quite surprisingly, for any graph other than the paths of lengths 1,2 and 3, the cycle of length 4, and their complements, no such property tester exists. We further show that a similar result also applies to the case of directed graphs, thus answering a question raised by the authors in [9]. We finally show that the same results hold even in the case of two-sided error property testers. The proofs combine combinatorial, graph-theoretic and probabilistic arguments with results from additive number theory.

The theorems of Hindman and van der Waerden belong to the classical theorems of partition Ramsey Theory. The Central Sets Theorem is a strong simultaneous extension of both theorems that applies to general commutative semigroups. We give a common extension of the Central Sets Theorem and Ramsey's theorem.

Every node of an undirected connected graph is coloured white or black. Adjacent nodes can be compared and the outcome of each comparison is either 0 (same colour) or 1 (different colours). The aim is to discover a node of the majority colour, or to conclude that there is the same number of black and white nodes. We consider randomized algorithms for this task and establish upper and lower bounds on their expected running time. Our main contribution are lower bounds showing that some simple and natural algorithms for this problem cannot be improved in general.

We consider the complexity of approximating the partition function of the ferromagnetic Ising model with varying interaction energies and local external magnetic fields. Jerrum and Sinclair provided a fully polynomial randomized approximation scheme for the case in which the system is consistent in the sense that the local external fields all favour the same spin. We characterize the complexity of the general problem by showing that it is equivalent in complexity to the problem of approximately counting independent sets in bipartite graphs, thus it is complete in a logically defined subclass of #P previously studied by Dyer, Goldberg, Greenhill and Jerrum. By contrast, we show that the corresponding computational task for the $q$-state Potts model with local external magnetic fields and $q>2$ is complete for all of #P with respect to approximation-preserving reductions.

Let $P_1, {\ldots}\,,P_k$ be $k$ vertex-disjoint paths in a graph $G$ where the ends of $P_i$ are $x_i$, and $y_i$. Let $H$ be the subgraph induced by the vertex sets of the paths. We find edge bounds $E_1(n)$, $E_2(n)$ such that:

1. if $e(H) \geq E_1(|V(H)|)$, then there exist disjoint paths $P_1', {\ldots}\,,P_k'$ where the ends of $P_i'$ are $x_i$ and $ y_i$ such that $|\bigcup_i V(P_i)| > |\bigcup_i V(P_i')|$;

2. if $e(H) \geq E_2(|V(H)|)$, then there exist disjoint paths $P_1', {\ldots}\,, P_k'$ where the ends of $P_i'$ are $x_i'$ and $y_i'$ such that $|\bigcup_i V(P_i)| > |\bigcup_i V(P_i')|$ and $\{ x_1, {\ldots}\,, x_k \} = \{ x_1' , {\ldots}\, , x_k' \}$ and $\{ y_1, {\ldots}\,, y_k \} = \{ y_1', {\ldots}\,, y_k'\}$.

The bounds are the best possible, in that there exist arbitrarily large graphs $H'$ with $e(H') = E_i (H') - 1$ without the properties stipulated in 1 and 2.