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.
In this paper, we prove some reverse discrete inequalities with weights of Muckenhoupt and Gehring types and use them to prove some higher summability theorems on a higher weighted space $l_{w}^{p}({\open N})$ form summability on the weighted space $l_{w}^{q}({\open N})$ when p>q. The proofs are obtained by employing new discrete weighted Hardy's type inequalities and their converses for non-increasing sequences, which, for completeness, we prove in our special setting. To the best of the authors' knowledge, these higher summability results have not been considered before. Some numerical results will be given for illustration.
This paper focuses on the role of a government of a large population of interacting agents as a meanfield optimal control problem derived from deterministic finite agent dynamics. The control problems are constrained by a Partial Differential Equation of continuity-type without diffusion, governing the dynamics of the probability distribution of the agent population. We derive existence of optimal controls in a measure-theoretical setting as natural limits of finite agent optimal controls without any assumption on the regularity of control competitors. In particular, we prove the consistency of mean-field optimal controls with corresponding underlying finite agent ones. The results follow from a Γ -convergence argument constructed over the mean-field limit, which stems from leveraging the superposition principle.
A tree functional is called additive if it satisfies a recursion of the form $F(T) = \sum_{j=1}^k F(B_j) + f(T)$, where B1, …, Bk are the branches of the tree T and f (T) is a toll function. We prove a general central limit theorem for additive functionals of d-ary increasing trees under suitable assumptions on the toll function. The same method also applies to generalized plane-oriented increasing trees (GPORTs). One of our main applications is a log-normal law that we prove for the size of the automorphism group of d-ary increasing trees, but other examples (old and new) are covered as well.
We define a Grothendieck ring of varieties with actions of finite groups and show that the orbifold Euler characteristic and the Euler characteristics of higher orders can be defined as homomorphisms from this ring to the ring of integers. We describe two natural λ-structures on the ring and the corresponding power structures over it and show that one of these power structures is effective. We define a Grothendieck ring of varieties with equivariant vector bundles and show that the generalized (‘motivic’) Euler characteristics of higher orders can be defined as homomorphisms from this ring to the Grothendieck ring of varieties extended by powers of the class of the complex affine line. We give an analogue of the Macdonald type formula for the generating series of the generalized higher-order Euler characteristics of wreath products.
The purpose of this work is to investigate the properties of spreading speeds for the monotone semiflows. According to the fundamental work of Liang and Zhao [(2007) Comm. Pure Appl. Math.60, 1–40], the spreading speeds of the monotone semiflows can be derived via the principal eigenvalue of linear operators relating to the semiflows. In this paper, we establish a general method to analyse the sign and the continuity of the spreading speeds. Then we consider a limiting case that admits no spreading phenomenon. The results can be applied to the model of cellular neural networks (CNNs). In this model, we find the rule which determines the propagating phenomenon by parameters.
Image feature points are detected as pixels which locally maximise a detector function, two commonly used examples of which are the (Euclidean) image gradient and the Harris–Stephens corner detector. A major limitation of these feature detectors is that they are only Euclidean-invariant. In this work, we demonstrate the application of a 2D equi-affine-invariant image feature point detector based on differential invariants as derived through the equivariant method of moving frames. The fundamental equi-affine differential invariants for 3D image volumes are also computed.
In this paper, Berger spheres are regarded as geodesic spheres with sufficiently big radii in a complex projective space. We characterize such real hypersurfaces by investigating their geodesics and contact structures from the viewpoint of submanifold theory.
We adapt the classical notion of building models by games to the setting of continuous model theory. As an application, we study to what extent canonical operator algebras are enforceable models. For example, we show that the hyperfinite II1 factor is an enforceable II1 factor if and only if the Connes Embedding Problem has a positive solution. We also show that the set of continuous functions on the pseudoarc is an enforceable model of the theory of unital, projectionless, abelian $\text{C}^{\ast }$-algebras and use this to show that it is the prime model of its theory.
For an edge-coloured graph G, the minimum colour degree of G means the minimum number of colours on edges which are incident to each vertex of G. We prove that if G is an edge-coloured graph with minimum colour degree at least 5, then V(G) can be partitioned into two parts such that each part induces a subgraph with minimum colour degree at least 2. We show this theorem by proving amuch stronger form. Moreover, we point out an important relationship between our theorem and Bermond and Thomassen’s conjecture in digraphs.