We consider the adjoint representation of a Hopf algebra $H$ focusing on the locally finite part, $H_{{\textrm ad\,fin}}$, defined as the sum of all finite-dimensional subrepresentations. For virtually cocommutative $H$ (i.e., $H$ is finitely generated as module over a cocommutative Hopf subalgebra), we show that $H_{{\textrm ad\,fin}}$ is a Hopf subalgebra of $H$. This is a consequence of the fact, proved here, that locally finite parts yield a tensor functor on the module category of any virtually pointed Hopf algebra. For general Hopf algebras, $H_{{\textrm ad\,fin}}$ is shown to be a left coideal subalgebra. We also prove a version of Dietzmann's Lemma from group theory for Hopf algebras.

In this paper, for a positive integer n ≥ 1, we look at the size and prime factors of the iterates of the Ramanujan τ function applied to n.

The Erdős–Simonovits stability theorem states that for all ε > 0 there exists α > 0 such that if G is a Kr+1-free graph on n vertices with e(G) > ex(n, Kr+1)– α n2, then one can remove εn2 edges from G to obtain an r-partite graph. Füredi gave a short proof that one can choose α = ε. We give a bound for the relationship of α and ε which is asymptotically sharp as ε → 0.

This paper deals with the following non-linear equation with a fractional Laplacian operator and almost critical exponents:

\[ (-\Delta)^{s} u=K(|y'|,y'')u^{({N+2s})/(N-2s)\pm\epsilon},\quad u > 0,\quad u\in D^{1,s}(\mathbb{R}^{N}), \]

$\epsilon ^{-(({N-2s-2})/({(N-2s)^2})}$

Can smoothing a single crossing in a diagram for a knot convert it into a diagram of the knot's mirror image? Zeković found such a smoothing for the torus knot T(2, 5), and Moore–Vazquez proved that such smoothings do not exist for other torus knots T(2, m) with m odd and square free. The existence of such a smoothing implies that K # K bounds a Mobius band in B4. We use Casson–Gordon theory to provide new obstructions to the existence of such chiral smoothings. In particular, we remove the constraint that m be square free in the Moore–Vazquez theorem, with the exception of m = 9, which remains an open case. Heegaard Floer theory provides further obstructions; these do not give new information in the case of torus knots of the form T(2, m), but they do provide strong constraints for other families of torus knots. A more general question asks, for each pair of knots K and J, what is the minimum number of smoothings that are required to convert a diagram of K into one for J. The methods presented here can be applied to provide lower bounds on this number.

Non-amenability of ${\mathcal {B}}(E)$ has been surprisingly difficult to prove for the classical Banach spaces, but is now known for E = ℓp and E = Lp for all 1 ⩽ p < ∞. However, the arguments are rather indirect: the proof for L1 goes via non-amenability of $\ell ^\infty ({\mathcal {K}}(\ell _1))$ and a transference principle developed by Daws and Runde (Studia Math., 2010).

In this note, we provide a short proof that ${\mathcal {B}}(L_1)$ and some of its subalgebras are non-amenable, which completely bypasses all of this machinery. Our approach is based on classical properties of the ideal of representable operators on L1, and shows that ${\mathcal {B}}(L_1)$ is not even approximately amenable.

Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing, etc. The vast majority of existing drift theorems yield bounds on the expected value of the hitting time for a target state, for example the set of optimal solutions, without making additional statements on the distribution of this time. We address this lack by providing a general drift theorem that includes bounds on the upper and lower tail of the hitting time distribution. The new tail bounds are applied to prove very precise sharp-concentration results on the running time of a simple EA on standard benchmark problems, including the class of general linear functions. On all these problems, the probability of deviating by an r-factor in lower-order terms of the expected time decreases exponentially with r. The usefulness of the theorem outside the theory of RSHs is demonstrated by deriving tail bounds on the number of cycles in random permutations. All these results handle a position-dependent (variable) drift that was not covered by previous drift theorems with tail bounds. Finally, user-friendly specializations of the general drift theorem are given.

The Jones polynomial is a famous link invariant that can be defined diagrammatically via a skein relation. Khovanov homology is a richer link invariant that categorifies the Jones polynomial. Using spectral sequences, we obtain a skein-type relation satisfied by the Khovanov homology. Thanks to this relation, we are able to generalize the Khovanov homology in order to obtain a categorification of the θ-invariant, which is itself a generalization of the Jones polynomial.

We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph in a uniformly random graph with degree sequence(d1, …, dn) as n→ ∞. We also determine the expected number of spanning trees in this model. The range of degrees covered includes dj= λn + O(n1/2+ε) for some λ bounded away from 0 and 1.

In this paper, we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. These groups have recently been investigated in terms of their abstract structure, in a similar way to the O'Nan–Scott Theorem for primitive groups. Our goal here is to explore aspects of such groups which may be useful in place of precise structural information. We give bounds on the order, base size, minimal degree, fixed point ratio, and chief length of an arbitrary finite semiprimitive group in terms of its degree. To establish these bounds, we study the structure of a finite semiprimitive group that induces the alternating or symmetric group on the set of orbits of an intransitive minimal normal subgroup.

Let p be prime. We prove that, for n odd, the p-torsion part of πq(Sn) has cardinality at most $p^{2^{{1}/({p-1})(q-n+3-2p)}}$ and hence has rank at most 21/(p−1)(q−n+3−2p). for p = 2, these results also hold for n even. The best bounds proven in the existing literature are $p^{2^{q-n+1}}$ and 2q−n+1, respectively, both due to Hans–Werner Henn. The main point of our result is therefore that the bound grows more slowly for larger primes. As a corollary of work of Henn, we obtain a similar result for the homotopy groups of a broader class of spaces.

This paper is concerned with the asymptotic behaviour of solutions to a class of non-autonomous stochastic nonlinear wave equations with dispersive and viscosity dissipative terms driven by operator-type noise defined on the entire space $\mathbb {R}^n$. The existence, uniqueness, time-semi-uniform compactness and asymptotically autonomous robustness of pullback random attractors are proved in $H^1(\mathbb {R}^n)\times H^1(\mathbb {R}^n)$ when the growth rate of the nonlinearity has a subcritical range, the density of the noise is suitably controllable, and the time-dependent force converges to a time-independent function in some sense. The main difficulty to establish the time-semi-uniform pullback asymptotic compactness of the solutions in $H^1(\mathbb {R}^n)\times H^1(\mathbb {R}^n)$ is caused by the lack of compact Sobolev embeddings on $\mathbb {R}^n$, as well as the weak dissipativeness of the equations is surmounted at light of the idea of uniform tail-estimates and a spectral decomposition approach. The measurability of random attractors is proved by using an argument which considers two attracting universes developed by Wang and Li (Phys. D 382: 46–57, 2018).

In this paper, we show that the numbers of t-stack sortable n-permutations with k − 1 descents satisfy central and local limit theorems for t = 1, 2, n − 1 and n − 2. This result, in particular, gives an affirmative answer to Shapiro's question about the asymptotic normality of the Narayana numbers.

The disjointness graph G = G(𝒮) of a set of segments 𝒮 in ${\mathbb{R}^d}$, $$d \ge 2$$, is a graph whose vertex set is 𝒮 and two vertices are connected by an edge if and only if the corresponding segments are disjoint. We prove that the chromatic number of G satisfies $\chi (G) \le {(\omega (G))^4} + {(\omega (G))^3}$, where ω(G) denotes the clique number of G. It follows that 𝒮 has Ω(n1/5) pairwise intersecting or pairwise disjoint elements. Stronger bounds are established for lines in space, instead of segments.

We show that computing ω(G) and χ(G) for disjointness graphs of lines in space are NP-hard tasks. However, we can design efficient algorithms to compute proper colourings of G in which the number of colours satisfies the above upper bounds. One cannot expect similar results for sets of continuous arcs, instead of segments, even in the plane. We construct families of arcs whose disjointness graphs are triangle-free (ω(G) = 2), but whose chromatic numbers are arbitrarily large.

We say a group G satisfies properties (M) and (NM) if every nontrivial finite subgroup of G is contained in a unique maximal finite subgroup, and every nontrivial finite maximal subgroup is self-normalizing. We prove that the Bredon cohomological dimension and the virtual cohomological dimension coincide for groups that admit a cocompact model for EG and satisfy properties (M) and (NM). Among the examples of groups satisfying these hypothesis are cocompact and arithmetic Fuchsian groups, one-relator groups, the Hilbert modular group, and 3-manifold groups.

Let Λ be an artin algebra and $0=I_{0}\subseteq I_{1} \subseteq I_{2}\subseteq\cdots \subseteq I_{n}$ a chain of ideals of Λ such that $(I_{i+1}/I_{i})\rad(\Lambda/I_{i})=0$ for any $0\leq i\leq n-1$ and $\Lambda/I_{n}$ is semisimple. If either none or the direct sum of exactly two consecutive ideals has infinite projective dimension, then the finitistic dimension conjecture holds for Λ. As a consequence, we have that if either none or the direct sum of exactly two consecutive terms in the radical series of Λ has infinite projective dimension, then the finitistic dimension conjecture holds for Λ. Some known results are obtained as corollaries.

A perfect Kr-tiling in a graph G is a collection of vertex-disjoint copies of the clique Kr in G covering every vertex of G. The famous Hajnal–Szemerédi theorem determines the minimum degree threshold for forcing a perfect Kr-tiling in a graph G. The notion of discrepancy appears in many branches of mathematics. In the graph setting, one assigns the edges of a graph G labels from {‒1, 1}, and one seeks substructures F of G that have ‘high’ discrepancy (i.e. the sum of the labels of the edges in F is far from 0). In this paper we determine the minimum degree threshold for a graph to contain a perfect Kr-tiling of high discrepancy.