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 study the heat semigroup maximal operator associated with a well-known orthonormal system in the $d$-dimensional ball. The corresponding heat kernel is shown to satisfy Gaussian bounds. As a consequence, we can prove weighted $L^{p}$ estimates, as well as some weighted inequalities in mixed norm spaces, for this maximal operator.
The motivic Hilbert zeta function of a variety $X$ is the generating function for classes in the Grothendieck ring of varieties of Hilbert schemes of points on $X$. In this paper, the motivic Hilbert zeta function of a reduced curve is shown to be rational.
We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall and Spencer in 2002 [14]. A dyadic tiling of size n is a tiling of the unit square by n non-overlapping dyadic rectangles, each of area 1/n, where a dyadic rectangle is any rectangle that can be written in the form [a2−s, (a + 1)2−s] × [b2−t, (b + 1)2−t] for a, b, s, t ∈ ℤ⩾ 0. The edge-flip Markov chain selects a random edge of the tiling and replaces it with its perpendicular bisector if doing so yields a valid dyadic tiling. Specifically, we show that the relaxation time of the edge-flip Markov chain for dyadic tilings is at most O(n4.09), which implies that the mixing time is at most O(n5.09). We complement this by showing that the relaxation time is at least Ω(n1.38), improving upon the previously best lower bound of Ω(n log n) coming from the diameter of the chain.
The Wasserstein gradient flow structure of the partial differential equation system governing multiphase flows in porous media was recently highlighted in Cancès et al. [Anal. PDE10(8), 1845–1876]. The model can thus be approximated by means of the minimising movement (or JKO after Jordan, Kinderlehrer and Otto [SIAM J. Math. Anal.29(1), 1–17]) scheme that we solve thanks to the ALG2-JKO scheme proposed in Benamou et al. [ESAIM Proc. Surv.57, 1–17]. The numerical results are compared to a classical upstream mobility finite volume scheme, for which strong stability properties can be established.
We study I(T), the number of inversions in a tree T with its vertices labelled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of I(T) have explicit formulas involving the k-total common ancestors of T (an extension of the total path length). Then we consider Xn, the normalized version of I(Tn), for a sequence of trees Tn. For fixed Tn's, we prove a sufficient condition for Xn to converge in distribution. As an application, we identify the limit of Xn for complete b-ary trees. For Tn being split trees [16], we show that Xn converges to the unique solution of a distributional equation. Finally, when Tn's are conditional Galton–Watson trees, we show that Xn converges to a random variable defined in terms of Brownian excursions. By exploiting the connection between inversions and the total path length, we are able to give results that significantly strengthen and broaden previous work by Panholzer and Seitz [46].
Let K be a totally real number field of degree r. Let K∞ denote the cyclotomic -extension of K, and let L∞ be a finite extension of K∞, abelian over K. The goal of this paper is to compare the characteristic ideal of the χ-quotient of the projective limit of the narrow class groups to the χ-quotient of the projective limit of the rth exterior power of totally positive units modulo a subgroup of Rubin–Stark units, for some $\overline{\mathbb{Q}_{2}}$-irreducible characters χ of Gal(L∞/K∞).
It was shown by Gruslys, Leader and Tan that any finite subset of $\mathbb{Z}^{n}$ tiles $\mathbb{Z}^{d}$ for some $d$. The first non-trivial case is the punctured interval, which consists of the interval $\{-k,\ldots ,k\}\subset \mathbb{Z}$ with its middle point removed: they showed that this tiles $\mathbb{Z}^{d}$ for $d=2k^{2}$, and they asked if the dimension needed tends to infinity with $k$. In this note we answer this question: we show that, perhaps surprisingly, every punctured interval tiles $\mathbb{Z}^{4}$.
Consider a uniform random rooted labelled tree on n vertices. We imagine that each node of the tree has space for a single car to park. A number m ≤ n of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path towards the root until it encounters an empty space, in which case it parks there; if there is no empty space, it leaves the tree. Consider m = ⌊α n⌋ and let An,α denote the event that all ⌊α n⌋ cars find spaces in the tree. Lackner and Panholzer proved (via analytic combinatorics methods) that there is a phase transition in this model. Then if α ≤ 1/2, we have $\mathbb{P}({A_{n,\alpha}}) \to {\sqrt{1-2\alpha}}/{(1-\alpha})$, whereas if α > 1/2 we have $\mathbb{P}({A_{n,\alpha}}) \to 0$. We give a probabilistic explanation for this phenomenon, and an alternative proof via the objective method. Along the way, we consider the following variant of the problem: take the tree to be the family tree of a Galton–Watson branching process with Poisson(1) offspring distribution, and let an independent Poisson(α) number of cars arrive at each vertex. Let X be the number of cars which visit the root of the tree. We show that $\mathbb{E}{[X]}$ undergoes a discontinuous phase transition, which turns out to be a generic phenomenon for arbitrary offspring distributions of mean at least 1 for the tree and arbitrary arrival distributions.
We study the derived Hall algebra of the partially wrapped Fukaya category of a surface. We give an explicit description of the Hall algebra for the disk with $m$ marked intervals and we give a conjectural description of the Hall algebras of all surfaces with enough marked intervals. Then we use a functoriality result to show that a graded version of the HOMFLY-PT skein relation holds among certain arcs in the Hall algebras of general surfaces.
Denote by ${\mathcal H}_k$(n, p) the random k-graph in which each k-subset of {1,. . .,n} is present with probability p, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a fixed ε > 0 such that if n = 2k + 1 and p > 1 - ε, then w.h.p. (that is, with probability tending to 1 as k → ∞), ${\mathcal H}_k$(n, p) has the ‘Erdős–Ko–Rado property’. We also mention a similar random version of Sperner's theorem.
We consider a class of optimal control problems for measure-valued nonlinear transport equations describing traffic flow problems on networks. The objective is to minimise/maximise macroscopic quantities, such as traffic volume or average speed, controlling few agents, e.g. smart traffic lights and automated cars. The measure theoretic approach allows to study in a same setting local and non-local drivers interactions and to consider the control variables as additional measures interacting with the drivers distribution. We also propose a gradient descent adjoint-based optimisation method, obtained by deriving first-order optimality conditions for the control problem, and we provide some numerical experiments in the case of smart traffic lights for a 2–1 junction.
In the present paper, an inverse result of approximation, i.e. a saturation theorem for the sampling Kantorovich operators, is derived in the case of uniform approximation for uniformly continuous and bounded functions on the whole real line. In particular, we prove that the best possible order of approximation that can be achieved by the above sampling series is the order one, otherwise the function being approximated turns out to be a constant. The above result is proved by exploiting a suitable representation formula which relates the sampling Kantorovich series with the well-known generalized sampling operators introduced by Butzer. At the end, some other applications of such representation formulas are presented, together with a discussion concerning the kernels of the above operators for which such an inverse result occurs.
Let C be a bounded convex object in ℝd, and let P be a set of n points lying outside C. Further, let cp, cq be two integers with 1 ⩽ cq ⩽ cp ⩽ n - ⌊d/2⌋, such that every cp + ⌊d/2⌋ points of P contain a subset of size cq + ⌊d/2⌋ whose convex hull is disjoint from C. Then our main theorem states the existence of a partition of P into a small number of subsets, each of whose convex hulls are disjoint from C. Our proof is constructive and implies that such a partition can be computed in polynomial time.
In particular, our general theorem implies polynomial bounds for Hadwiger--Debrunner (p, q) numbers for balls in ℝd. For example, it follows from our theorem that when p > q = (1+β)⋅d/2 for β > 0, then any set of balls satisfying the (p, q)-property can be hit by O((1+β)2d2p1+1/β logp) points. This is the first improvement over a nearly 60 year-old exponential bound of roughly O(2d).
Our results also complement the results obtained in a recent work of Keller, Smorodinsky and Tardos where, apart from improvements to the bound on HD(p, q) for convex sets in ℝd for various ranges of p and q, a polynomial bound is obtained for regions with low union complexity in the plane.
Here is an introductory text on metric spaces that is the first to be written for students who are as interested in the applications as in the theory. Knowledge of metric spaces is fundamental to understanding numerical methods (for example for solving differential equations) as well as analysis, yet most books at this level emphasise just the abstraction and theory. Dr Bryant uses applications to provide motivation and to sustain the development and discusses numerical procedures where appropriate. The reader is expected to have had some exposure to elementary analysis, but the author provides examples throughout to refresh the student's memory and to test and extend understanding. In short, this is an introductory textbook that will appeal to students of mathematics and engineering and will give them the required background for more advanced courses in both analysis and numerical analysis.
Professor Itô is one of the most distinguished probability theorists in the world, and in this modern, concise introduction to the subject he explains basic probabilistic concepts rigorously and yet gives at the same time an intuitive understanding of random phenomena. In the first chapter he considers finite situations, but from an advanced standpoint that enables the transition to greater generality to be achieved more easily. Chapter 2 deals with probability measures and includes a discussion of the fundamental concepts of probability theory. These concepts are formulated abstractly but without sacrificing intuition. The last chapter is devoted to infinite sums of independent real random variables. Each chapter is divided into sections that end with a set of problems with hints for solution. This textbook will be particularly valuable to students of mathematics taking courses in probability theory who need a modern introduction to the subject that yet does not allow overemphasis on abstractness to cloud the issues involved.
Let R be a d-dimensional Cohen–Macaulay (CM) local ring of minimal multiplicity. Set S := R/(f), where f := f1,. . .,fc is an R-regular sequence. Suppose M and N are maximal CM S-modules. It is shown that if ExtSi(M, N) = 0 for some (d + c + 1) consecutive values of i ⩾ 2, then ExtSi(M, N) = 0 for all i ⩾ 1. Moreover, if this holds true, then either projdimR(M) or injdimR(N) is finite. In addition, a counterpart of this result for Tor-modules is provided. Furthermore, we give a number of necessary and sufficient conditions for a CM local ring of minimal multiplicity to be regular or Gorenstein. These conditions are based on vanishing of certain Exts or Tors involving homomorphic images of syzygy modules of the residue field.
In this paper, we prove a combination theorem for a complex of relatively hyperbolic groups. It is a generalization of Martin’s (Geom. Topology18 (2014), 31–102) work for combination of hyperbolic groups over a finite MK-simplicial complex, where k ≤ 0.