To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We complete the classification of the pointed Hopf algebras with finite Gelfand-Kirillov dimension that are liftings of the Jordan plane over a nilpotent-by-finite group, correcting the statement in [N. Andruskiewitsch, I. Angiono and I. Heckenberger, Liftings of Jordan and super Jordan planes, Proc. Edinb. Math. Soc., II. Ser. 61(3) (2018), 661–672.].
We propose two systems of “intrinsic” weights for counting such curves. In both cases the result acquires an exceptionally strong invariance property: it does not depend on the choice of a surface. One of our counts includes all divisor classes of canonical degree 2 and gives in total 30. The other one excludes the class $-2K$, but adds up the results of counting for a pair of real structures that differ by Bertini involution. This count gives 96.
We prove that many, but not all, injective factors arise as crossed products by nonsingular Bernoulli actions of the group $\mathbb {Z}$. We obtain this result by proving a completely general result on the ergodicity, type and Krieger’s associated flow for Bernoulli shifts with arbitrary base spaces. We prove that the associated flow must satisfy a structural property of infinite divisibility. Conversely, we prove that all almost periodic flows, as well as many other ergodic flows, do arise as associated flow of a weakly mixing Bernoulli action of any infinite amenable group. As a byproduct, we prove that all injective factors with almost periodic flow of weights are infinite tensor products of $2 \times 2$ matrices. Finally, we construct Poisson suspension actions with prescribed associated flow for any locally compact second countable group that does not have property (T).
Let $\Gamma $ be a finite set, and $X\ni x$ a fixed kawamata log terminal germ. For any lc germ $(X\ni x,B:=\sum _{i} b_iB_i)$, such that $b_i\in \Gamma $, Nakamura’s conjecture, which is equivalent to the ascending chain condition conjecture for minimal log discrepancies for fixed germs, predicts that there always exists a prime divisor E over $X\ni x$, such that $a(E,X,B)=\mathrm {mld}(X\ni x,B)$, and $a(E,X,0)$ is bounded from above. We extend Nakamura’s conjecture to the setting that $X\ni x$ is not necessarily fixed and $\Gamma $ satisfies the descending chain condition, and show it holds for surfaces. We also find some sufficient conditions for the boundedness of $a(E,X,0)$ for any such E.
In 1975 Bollobás, Erdős, and Szemerédi asked the following question: given positive integers $n, t, r$ with $2\le t\le r-1$, what is the largest minimum degree $\delta (G)$ among all $r$-partite graphs $G$ with parts of size $n$ and which do not contain a copy of $K_{t+1}$? The $r=t+1$ case has attracted a lot of attention and was fully resolved by Haxell and Szabó, and Szabó and Tardos in 2006. In this article, we investigate the $r\gt t+1$ case of the problem, which has remained dormant for over 40 years. We resolve the problem exactly in the case when $r \equiv -1 \pmod{t}$, and up to an additive constant for many other cases, including when $r \geq (3t-1)(t-1)$. Our approach utilizes a connection to the related problem of determining the maximum of the minimum degrees among the family of balanced $r$-partite $rn$-vertex graphs of chromatic number at most $t$.
We show via $\ell^2$-homology that the rational homological dimension of a lattice in a product of simple simply connected Chevalley groups over global function fields is equal to the rational cohomological dimension and to the dimension of the associated Bruhat–Tits building.
When $p$ is an odd prime, Delbourgo observed that any Kubota–Leopoldt $p$-adic $L$-function, when multiplied by an auxiliary Euler factor, can be written as an infinite sum. We shall establish such expressions without restriction on $p$, and without the Euler factor when the character is non-trivial, by computing the periods of appropriate measures. As an application, we will reprove the Ferrero–Greenberg formula for the derivative $L_p'(0,\chi )$. We will also discuss the convergence of sum expressions in terms of elementary $p$-adic analysis, as well as their relation to Stickelberger elements; such discussions in turn give alternative proofs of the validity of sum expressions.
A hypergraph $\mathcal{F}$ is non-trivial intersecting if every pair of edges in it have a nonempty intersection, but no vertex is contained in all edges of $\mathcal{F}$. Mubayi and Verstraëte showed that for every $k \ge d+1 \ge 3$ and $n \ge (d+1)k/d$ every $k$-graph $\mathcal{H}$ on $n$ vertices without a non-trivial intersecting subgraph of size $d+1$ contains at most $\binom{n-1}{k-1}$ edges. They conjectured that the same conclusion holds for all $d \ge k \ge 4$ and sufficiently large $n$. We confirm their conjecture by proving a stronger statement.
They also conjectured that for $m \ge 4$ and sufficiently large $n$ the maximum size of a $3$-graph on $n$ vertices without a non-trivial intersecting subgraph of size $3m+1$ is achieved by certain Steiner triple systems. We give a construction with more edges showing that their conjecture is not true in general.
The automorphism group $\operatorname {Aut}(F_n)$ of the free group $F_n$ acts on a space $A_d(n)$ of Jacobi diagrams of degree d on n oriented arcs. We study the $\operatorname {Aut}(F_n)$-module structure of $A_d(n)$ by using two actions on the associated graded vector space of $A_d(n)$: an action of the general linear group $\operatorname {GL}(n,\mathbb {Z})$ and an action of the graded Lie algebra $\mathrm {gr}(\operatorname {IA}(n))$ of the IA-automorphism group $\operatorname {IA}(n)$ of $F_n$ associated with its lower central series. We extend the action of $\mathrm {gr}(\operatorname {IA}(n))$ to an action of the associated graded Lie algebra of the Andreadakis filtration of the endomorphism monoid of $F_n$. By using this action, we study the $\operatorname {Aut}(F_n)$-module structure of $A_d(n)$. We obtain an indecomposable decomposition of $A_d(n)$ as $\operatorname {Aut}(F_n)$-modules for $n\geq 2d$. Moreover, we obtain the radical filtration of $A_d(n)$ for $n\geq 2d$ and the socle of $A_3(n)$.
We study several parameters of a random Bienaymé–Galton–Watson tree $T_n$ of size $n$ defined in terms of an offspring distribution $\xi$ with mean $1$ and nonzero finite variance $\sigma ^2$. Let $f(s)=\mathbb{E}\{s^\xi \}$ be the generating function of the random variable $\xi$. We show that the independence number is in probability asymptotic to $qn$, where $q$ is the unique solution to $q = f(1-q)$. One of the many algorithms for finding the largest independent set of nodes uses a notion of repeated peeling away of all leaves and their parents. The number of rounds of peeling is shown to be in probability asymptotic to $\log n/\log (1/f'(1-q))$. Finally, we study a related parameter which we call the leaf-height. Also sometimes called the protection number, this is the maximal shortest path length between any node and a leaf in its subtree. If $p_1 = \mathbb{P}\{\xi =1\}\gt 0$, then we show that the maximum leaf-height over all nodes in $T_n$ is in probability asymptotic to $\log n/\log (1/p_1)$. If $p_1 = 0$ and $\kappa$ is the first integer $i\gt 1$ with $\mathbb{P}\{\xi =i\}\gt 0$, then the leaf-height is in probability asymptotic to $\log _\kappa \log n$.
From any two median spaces $X$ and $Y$, we construct a new median space $X \circledast Y$, referred to as the diadem product of $X$ and $Y$, and we show that this construction is compatible with wreath products in the following sense: given two finitely generated groups $G,\,H$ and two (equivariant) coarse embeddings into median spaces $X,\,Y$, there exist a(n equivariant) coarse embedding $G\wr H \to X \circledast Y$. The construction offers a unified point of view on various questions related to the Hilbertian geometry of wreath products of groups.
In this paper, we consider an initial-boundary value problem of Hsieh's equation with conservative nonlinearity. The global unique solvability in the framework of Sobolev is established. In particular, one of our main motivations is to investigate the boundary layer (BL) effect and the convergence rates as the diffusion parameter $\beta$ goes zero. It is shown that the BL-thickness is of the order $O(\beta ^{\gamma })$ with $0<\gamma <\frac {1}{2}$. We need to point out that, different from the previous work on nonconservative form of Hsieh's equations, the conservative nonlinearity $(\psi ^{\beta }\theta ^{\beta })_x$ implies that new nonlinear term $\psi _x^{\beta }\theta ^{\beta }$ needs to be handled. It is important that more regularities on the solution to the limit problem are required to obtain the convergence rates and BL-thickness. It is more difficult for initial-boundary problem due to the lack of boundary conditions (especially, higher-order derivatives) prevents us from applying the integration by part to derive the energy estimates directly. Thus it is more complicated than the case of nonconservative form. Consequently more subtle mathematical analysis needs to be introduced to overcome the difficulties.
A conjecture of Alon, Krivelevich and Sudakov states that, for any graph $F$, there is a constant $c_F \gt 0$ such that if $G$ is an $F$-free graph of maximum degree $\Delta$, then $\chi\!(G) \leqslant c_F \Delta/ \log\!\Delta$. Alon, Krivelevich and Sudakov verified this conjecture for a class of graphs $F$ that includes all bipartite graphs. Moreover, it follows from recent work by Davies, Kang, Pirot and Sereni that if $G$ is $K_{t,t}$-free, then $\chi\!(G) \leqslant (t + o(1)) \Delta/ \log\!\Delta$ as $\Delta \to \infty$. We improve this bound to $(1+o(1)) \Delta/\log\!\Delta$, making the constant factor independent of $t$. We further extend our result to the DP-colouring setting (also known as correspondence colouring), introduced by Dvořák and Postle.
Let M be an irreducible $3$-manifold M with empty or toroidal boundary which has at least one hyperbolic piece in its geometric decomposition, and let A be a finite abelian group. Generalizing work of Sun [20] and of Friedl–Herrmann [7], we prove that there exists a finite cover $M' \to M$ so that A is a direct factor in $H_1(M',{\mathbb Z})$.
The systematic development of coarse-grained (CG) models via the Mori–Zwanzig projector operator formalism requires the explicit description of a deterministic drift term, a dissipative memory term and a random fluctuation term. The memory and fluctuating terms are related by the fluctuation–dissipation relation and are more challenging to sample and describe than the drift term due to complex dependence on space and time. This work proposes a rational basis for a Markovian data-driven approach to approximating the memory and fluctuating terms. We assumed a functional form for the memory kernel and under broad regularity hypothesis, we derived bounds for the error committed in replacing the original term with an approximation obtained by its asymptotic expansions. These error bounds depend on the characteristic time scale of the atomistic model, representing the decay of the autocorrelation function of the fluctuating force; and the characteristic time scale of the CG model, representing the decay of the autocorrelation function of the momenta of the beads. Using appropriate parameters to describe these time scales, we provide a quantitative meaning to the observation that the Markovian approximation improves as they separate. We then proceed to show how the leading-order term of such expansion can be identified with the Markovian approximation usually considered in the CG theory. We also show that, while the error of the approximation involving time can be controlled, the Markovian term usually considered in CG simulations may exhibit significant spatial variation. It follows that assuming a spatially constant memory term is an uncontrolled approximation which should be carefully checked. We complement our analysis with an application to the estimation of the memory in the CG model of a one-dimensional Lennard–Jones chain with different masses and interactions, showing that even for such a simple case, a non-negligible spatial dependence for the memory term exists.
Let G be a complex semisimple Lie group and H a complex closed connected subgroup. Let and be their Lie algebras. We prove that the regular representation of G in $L^2(G/H)$ is tempered if and only if the orthogonal of in contains regular elements by showing simultaneously the equivalence to other striking conditions, such as has a solvable limit algebra.
Let ${\mathbb{G}(n_1,n_2,m)}$ be a uniformly random m-edge subgraph of the complete bipartite graph ${K_{n_1,n_2}}$ with bipartition $(V_1, V_2)$, where $n_i = |V_i|$, $i=1,2$. Given a real number $p \in [0,1]$ such that $d_1 \,{:\!=}\, pn_2$ and $d_2 \,{:\!=}\, pn_1$ are integers, let $\mathbb{R}(n_1,n_2,p)$ be a random subgraph of ${K_{n_1,n_2}}$ with every vertex $v \in V_i$ of degree $d_i$, $i = 1, 2$. In this paper we determine sufficient conditions on $n_1,n_2,p$ and m under which one can embed ${\mathbb{G}(n_1,n_2,m)}$ into $\mathbb{R}(n_1,n_2,p)$ and vice versa with probability tending to 1. In particular, in the balanced case $n_1=n_2$, we show that if $p\gg\log n/n$ and $1 - p \gg \left(\log n/n \right)^{1/4}$, then for some $m\sim pn^2$, asymptotically almost surely one can embed ${\mathbb{G}(n_1,n_2,m)}$ into $\mathbb{R}(n_1,n_2,p)$, while for $p\gg\left(\log^{3} n/n\right)^{1/4}$ and $1-p\gg\log n/n$ the opposite embedding holds. As an extension, we confirm the Kim–Vu Sandwich Conjecture for degrees growing faster than $(n \log n)^{3/4}$.
Using degeneration and Schubert calculus, we consider the problem of computing the number of linear series of given degree d and dimension r on a general curve of genus g satisfying prescribed incidence conditions at n points. We determine these numbers completely for linear series of arbitrary dimension when d is sufficiently large, and for all d when either $r=1$ or $n=r+2$. Our formulas generalise and give new proofs of recent results of Tevelev and of Cela, Pandharipande and Schmitt.
We characterize when a set of simple closed curves in an orientable surface forms a bouquet, in terms of relations between the corresponding Dehn twists.
is considered along with no-flux boundary conditions for $u$ and with prescribed constant positive Dirichlet boundary data for $v$. It is shown that if $D\in C^{3}([0,\infty ))$ is such that $0< D(\xi ) \le {K_D} (\xi +1)^{-\alpha }$ for all $\xi >0$ with some ${K_D}>0$ and $\alpha >0$, then for all initial data from a considerably large set of radial functions on $\Omega$, the corresponding initial-boundary value problem admits a solution blowing up in finite time.