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 extend a classical model of continuous opinion formation to explicitly include an age-structured population. We begin by considering a stochastic differential equation model which incorporates ageing dynamics and birth/death processes, in a bounded confidence type opinion formation model. We then derive and analyse the corresponding mean field partial differential equation and compare the complex dynamics on the microscopic and macroscopic levels using numerical simulations. We rigorously prove the existence of stationary states in the mean field model, but also demonstrate that these stationary states are not necessarily unique. Finally, we establish connections between this and other existing models in various scenarios.
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \mathcal{H}$ and the conflicts to be avoided, a conflict-free almost-perfect matching can be extended to one covering all vertices in a particular subset of $ V(\mathcal{H})$, by using an additional set of edges; in particular, we ensure that our matching avoids all additional conflicts, which may consist of both old and new edges. This setup is useful for various applications in design theory and Ramsey theory. For example, our main result provides a crucial tool in the recent proof of the high-girth existence conjecture due to Delcourt and Postle. It also provides a black box which encapsulates many long and tedious calculations, greatly simplifying the proofs of results in generalised Ramsey theory.
In this paper, we prove the integrality conjecture for quotient stacks arising from weakly symmetric representations of reductive groups. Our main result is a decomposition of the cohomology of the stack into finite-dimensional components indexed by some equivalence classes of cocharacters of a maximal torus. This decomposition enables the definition of new enumerative invariants associated with the stack, which we begin to explore.
In this work, we conclude our study of fibred $\infty $-bicategories by providing a Grothendieck construction in this setting. Given a scaled simplicial set S (which need not be fibrant) we construct a 2-categorical version of Lurie’s straightening-unstraightening adjunction, thereby furnishing an equivalence between the $\infty $-bicategory of 2-Cartesian fibrations over S and the $\infty $-bicategory of contravariant functors with values in the $\infty $-bicategory of $\infty $-bicategories. We provide a relative nerve construction in the case where the base is a 2-category, and use this to prove a comparison to existing bicategorical Grothendieck constructions.
The primary aim of this paper is to give topological obstructions to Cantor sets in $\mathbb{R}^3$ being Julia sets of uniformly quasiregular mappings. Our main tool is the genus of a Cantor set. We give a new construction of a genus g Cantor set, the first for which the local genus is g at every point, and then show that this Cantor set can be realized as the Julia set of a uniformly quasiregular mapping. These are the first such Cantor Julia sets constructed for $g\geq 3$. We then turn to our dynamical applications and show that every Cantor Julia set of a hyperbolic uniformly quasiregular map has a finite genus g; that a given local genus in a Cantor Julia set must occur on a dense subset of the Julia set; and that there do exist Cantor Julia sets where the local genus is non-constant.
Given $p\in[1,\infty)$ and a bounded open set $\Omega\subset\mathbb{R}^d$ with Lipschitz boundary, we study the $\Gamma$-convergence of the weighted fractional seminorm
as $s\to1^-$ for $u\in L^p(\Omega)$, where $\tilde u=u$ on $\Omega$ and $\tilde u=0$ on $\mathbb{R}^d\setminus\Omega$. Assuming that $(f_s)_{s\in(0,1)}\subset L^\infty(\mathbb{R}^d;[0,\infty))$ and $f\in\mathrm{Lip}_b(\mathbb{R}^d;(0,\infty))$ are such that $f_s\to f$ in $L^\infty(\mathbb{R}^d)$ as $s\to1^-$, we show that $(1-s)[u]_{s,p,f_s}^p$$\Gamma$-converges to the Dirichlet $p$-energy weighted by $f^2$. In the case $p=2$, we also prove the convergence of the corresponding gradient flows.
The homology of the free and the based loop space of a compact globally symmetric space can be studied through explicit cycles. We use cycles constructed by Bott and Samelson and by Ziller to study the string topology coproduct and the Chas-Sullivan product on compact symmetric spaces. We show that the Chas-Sullivan product for compact symmetric spaces is highly non-trivial for any rank and we prove that there are many non-nilpotent classes whose powers correspond to the iteration of closed geodesics. Moreover, we show that the based string topology coproduct is trivial for compact symmetric spaces of higher rank and we study the implications of this result for the string topology coproduct on the free loop space.
In 1976, Cameron, Goethals, Seidel, and Shult classified all the graphs whose smallest eigenvalue is at least $-2$ by relating such graphs to root systems that appear in the classification of semisimple Lie algebras. In this paper, extending their beautiful theorem, we give a complete classification of all connected graphs whose smallest eigenvalue lies in $(\! -\lambda ^*, -2)$, where $\lambda ^* = ho ^{1/2} + ho ^{-1/2} \approx 2.01980$, and $ho$ is the unique real root of $x^3 = x + 1$. Our result is the first classification of infinitely many connected graphs with their smallest eigenvalue in $(\! -\lambda , -2)$ for any constant $\lambda \gt 2$.
Due to the widespread availability of effective antiretroviral therapy regimens, average lifespans of persons with HIV (PWH) in the United States have increased significantly in recent decades. In turn, the demographic profile of PWH has shifted. Older persons comprise an ever-increasing percentage of PWH, with this percentage expected to further increase in the coming years. This has profound implications for HIV treatment and care, as significant resources are required not only to manage HIV itself, but also associated age-related comorbidities and health conditions that occur in ageing PWH. Effective management of these challenges in the coming years requires accurate modelling of the PWH age structure. In the present work, we introduce several novel mathematical approaches related to this problem. We present a workflow combining a PDE model for the PWH population age structure, where publicly available HIV surveillance data are assimilated using the Ensemble Kalman Inversion algorithm. This procedure allows us to rigorously reconstruct the age-dependent mortality trends for PWH over the last several decades. To project future trends, we introduce and analyse a novel variant of the dynamic mode decomposition (DMD), nonnegative DMD. We show that nonnegative DMD provides physically consistent projections of mortality and HIV diagnosis while remaining purely data-driven, and not requiring additional assumptions. We then combine these elements to provide forecasts for future trends in PWDH mortality and demographic evolution in the coming years.
It is well known that almost all graphs are canonizable by a simple combinatorial routine known as colour refinement, also referred to as the 1-dimensional Weisfeiler–Leman algorithm. With high probability, this method assigns a unique label to each vertex of a random input graph and, hence, it is applicable only to asymmetric graphs. The strength of combinatorial refinement techniques becomes a subtle issue if the input graphs are highly symmetric. We prove that the combination of colour refinement and vertex individualization yields a canonical labelling for almost all circulant digraphs (i.e., Cayley digraphs of a cyclic group). This result provides first evidence of good average-case performance of combinatorial refinement within the class of vertex-transitive graphs. Remarkably, we do not even need the full power of the colour refinement algorithm. We show that the canonical label of a vertex $v$ can be obtained just by counting walks of each length from $v$ to an individualized vertex. Our analysis also implies that almost all circulant graphs are compact in the sense of Tinhofer, that is, their polytops of fractional automorphisms are integral. Finally, we show that a canonical Cayley representation can be constructed for almost all circulant graphs by the more powerful 2-dimensional Weisfeiler–Leman algorithm.
This paper is concerned with Liouville-type theorems of positive weak solutions to elliptic $m$-Laplace equation and inequality with the logarithmic nonlinearity $u^q(\log u)^p (q,p\geqslant0)$. Using a direct Bernstein method we obtain a first range of values of $m,q,p$ in which all positive weak solutions of equation are constants, this holds in the following cases: (i) $1 \lt m \lt 2$, $m-1 \lt q \lt 1$, $0 \lt p \lt q$; (ii) $m \gt 1$, $q\geqslant1$, $0 \lt p \lt 1$. When $q=1$, the positive weak solutions are required to be bounded. Based on transformation of inequality and the utilization of suitable cut-off functions, we establish a Liouville-type theorem for positive weak solutions of inequality; this result also remains valid on complete noncompact Riemannian manifold.
Let $\Bbbk$ be a field, $H$ a Hopf algebra over $\Bbbk$, and $R = (_iM_j)_{1 \leq i,j \leq n}$ a generalized matrix algebra. In this work, we establish necessary and sufficient conditions for $H$ to act partially on $R$. To achieve this, we introduce the concept of an opposite covariant pair and demonstrate that it satisfies a universal property. In the special case where $H = \Bbbk G$ is the group algebra of a group $G$, we recover the conditions given in [7] for the existence of a unital partial action of $G$ on $R$.
Let $G = X \wr H$ be the wreath product of a nontrivial finite group X with k conjugacy classes and a transitive permutation group H of degree n acting on the set of n direct factors of Xn. If H is semiprimitive, then $k(G) \leq k^n$ for every sufficiently large n or k. This result solves a case of the non-coprime k(GV) problem and provides an affirmative answer to a question of Garzoni and Gill for semiprimitive permutation groups. The proof does not require the classification of finite simple groups.
In recent years, there has been significant interest in the effect of different types of adversarial perturbations in data classification problems. Many of these models incorporate the adversarial power, which is an important parameter with an associated trade-off between accuracy and robustness. This work considers a general framework for adversarially perturbed classification problems, in a large data or population-level limit. In such a regime, we demonstrate that as adversarial strength goes to zero that optimal classifiers converge to the Bayes classifier in the Hausdorff distance. This significantly strengthens previous results, which generally focus on $L^1$-type convergence. The main argument relies upon direct geometric comparisons and is inspired by techniques from geometric measure theory.
We enumerate the low-dimensional cells in the Voronoi cell complexes attached to the modular groups $\mathit {SL}_N(\mathbb{Z} )$ and $\mathit {GL}_N(\mathbb{Z} )$ for $N=8,9,10,11$, using quotient sublattice techniques for $N=8,9$ and linear programming methods for higher dimensions. These enumerations allow us to compute some cohomology of these groups and prove that $K_8(\mathbb{Z} ) = 0$. We deduce from it new knowledge on the Kummer-Vandiver conjecture.
Considérons un espace de Berkovich sur un bon anneau de Banach et la droite projective relative sur celui-ci. (C’est un espace dont les fibres sont des droites projectives sur différents corps valués complets.) Pour tout endomorphisme polarisé de cette droite, nous montrons que la famille des mesures d’équilibre associées aux restrictions de l’endomorphisme aux fibres est continue. Le résultat vaut, par exemple, lorsque l’anneau de Banach est un corps valué complet, un corps hybride, un anneau de valuation discrète complet ou un anneau d’entiers de corps de nombres.
This paper investigates sharp stability estimates for the fractional Hardy–Sobolev inequality:
\begin{align*}\ \ \ \ \ \ \ \ \ \mu_{s,t}\left(\mathbb{R}^N\right) \left(\int_{\mathbb{R}^N} \frac{|u|^{2^*_s(t)}}{|x|^t} \,\mathrm{d}x \right)^{\frac{2}{2^*_s(t)}} \leq \int_{\mathbb{R}^N} \left|(-\Delta)^{\frac{s}{2}} u \right|^2 \,\mathrm{d}x, \quad \text{for all } u \in \dot{H}^s\left(\mathbb{R}^N\right)\end{align*}
where $s \in (0,1)$, $0 \lt t \lt 2s$, $N \gt 2s$ is an integer, and $2^*_s(t) = \frac{2(N-t)}{N-2s}$. Here, $\mu_{s,t}\left(\mathbb{R}^N\right)$ represents the best constant in the inequality. The primary focus is on the quantitative stability results of the above inequality and the corresponding Euler–Lagrange equation near a positive ground-state solution. Additionally, a qualitative stability result is established for the Euler–Lagrange equation, offering a thorough characterization of the Palais–Smale sequences for the associated energy functional. These results generalize the sharp quantitative stability results for the classical Sobolev inequality in $\mathbb{R}^N$, originally obtained by Bianchi and Egnell [J. Funct. Anal. 1991] as well as the corresponding critical exponent problem in $\mathbb{R}^N$, explored by Ciraolo, Figalli, and Maggi [Int. Math. Res. Not. 2017] in the framework of fractional calculus.
In this paper, we study partitions of totally positive integral elements $ \alpha $ in a real quadratic field $ K $. We prove that for a fixed integer $ m \geq 1 $, an element with $ m $ partition exists in almost all $ K $. We also obtain an upper bound for the norm of $\alpha$ that can be represented as a sum of indecomposables in at most $m$ ways, completely characterize the $\alpha$’s represented in exactly $2$ ways, and subsequently apply this result to complete the search for fields containing an element with $ m $ partitions for $ 1 \leq m \leq 7 $.
We construct large Salem sets avoiding patterns, complementing previous constructions of pattern avoiding sets with large Hausdorff dimension. For a (possibly uncountable) family of uniformly Lipschitz functions $\{f_i:(\mathbb{T}^d)^{n-2} \to \mathbb{T}^d \}$, we obtain a Salem subset of $\mathbb{T}^d$ with dimension $d/(n-1)$ avoiding nontrivial solutions to the equation $x_n-x_{n-1} = f_i(x_1,...,x_{n-2})$. For a countable family of smooth functions $\{f_i: (\mathbb{T}^d)^{n-1} \to \mathbb{T}^d \}$ satisfying a modest geometric condition, we obtain a Salem subset of $\mathbb{T}^d$ with dimension $d/(n-3/4)$ avoiding nontrivial solutions to the equation $x_n= f(x_1,...,x_{n-1})$. For a set $Z \subset \mathbb{T}^{dn}$ which is the countable union of a family of sets, each with lower Minkowski dimension $s$, we obtain a Salem subset of $\mathbb{T}^d$ of dimension $(dn-s)/(n-1/2)$ whose Cartesian product does not intersect $Z$ except at points with non-distinct coordinates.