We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
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.
For any positive integer n, let $\sigma (n)$ be the sum of all positive divisors of n. We prove that for every integer k with $1\leq k\leq 29$ and $(k,30)=1,$
for all $K\in \mathbb {N},$ which gives a positive answer to a problem posed by Pongsriiam [‘Sums of divisors on arithmetic progressions’, Period. Math. Hungar. 88 (2024), 443–460].
Deep neural networks have become an important tool for use in actuarial tasks, due to the significant gains in accuracy provided by these techniques compared to traditional methods, but also due to the close connection of these models to the generalized linear models (GLMs) currently used in industry. Although constraining GLM parameters relating to insurance risk factors to be smooth or exhibit monotonicity is trivial, methods to incorporate such constraints into deep neural networks have not yet been developed. This is a barrier for the adoption of neural networks in insurance practice since actuaries often impose these constraints for commercial or statistical reasons. In this work, we present a novel method for enforcing constraints within deep neural network models, and we show how these models can be trained. Moreover, we provide example applications using real-world datasets. We call our proposed method ICEnet to emphasize the close link of our proposal to the individual conditional expectation model interpretability technique.
In this paper, we consider the following non-linear system involving the fractional Laplacian0.1
\begin{equation} \left\{\begin{array}{@{}ll} (-\Delta)^{s} u (x)= f(u,\,v), \\ (-\Delta)^{s} v (x)= g(u,\,v), \end{array} \right. \end{equation}
in two different types of domains, one is bounded, and the other is an infinite cylinder, where $0< s<1$. We employ the direct sliding method for fractional Laplacian, different from the conventional extension and moving planes methods, to derive the monotonicity of solutions for (0.1) in $x_n$ variable. Meanwhile, we develop a new iteration method for systems in the proofs. Hopefully, the iteration method can also be applied to solve other problems.
It is proven that a conjecture of Tao (2010) holds true for log-concave random variables on the integers: For every $n \geq 1$, if $X_1,\ldots,X_n$ are i.i.d. integer-valued, log-concave random variables, then
as $H(X_1) \to \infty$, where $H(X_1)$ denotes the (discrete) Shannon entropy. The problem is reduced to the continuous setting by showing that if $U_1,\ldots,U_n$ are independent continuous uniforms on $(0,1)$, then
What is generally true about all models of crisis bargaining? Answering a question like this seems daunting because there are infinitely many ways states could negotiate with one another. Fortunately, this chapter introduces a new tool to address the question: mechanism design. We see that types with higher war payoffs will always fight more often than types with lower payoffs, and they will receive better payoffs overall. Meanwhile, it is possible to have negotiations end with guaranteed peace under uncertainty over costs, but no such solution may be possible with uncertainty over power.
where $-\left (\Delta +\lambda \right )^{\frac {\alpha }{2}}$ is a tempered fractional operator with $\alpha \in (0,2)$ and $\lambda $ is a sufficiently small positive constant. We first establish maximum principle principles for problems involving tempered fractional parabolic operators. And then, we develop the direct sliding methods for the tempered fractional parabolic problem, and discuss how they can be used to establish monotonicity results of solutions to the tempered fractional parabolic problem in various domains. We believe that our theory and methods can be conveniently applied to study parabolic problems involving other nonlocal operators.
Let $k\ge 2$ be an integer and let A be a set of nonnegative integers. The representation function $R_{A,k}(n)$ for the set A is the number of representations of a nonnegative integer n as the sum of k terms from A. Let $A(n)$ denote the counting function of A. Bell and Shallit [‘Counterexamples to a conjecture of Dombi in additive number theory’, Acta Math. Hung., to appear] recently gave a counterexample for a conjecture of Dombi and proved that if $A(n)=o(n^{{(k-2)}/{k}-\epsilon })$ for some $\epsilon>0$, then $R_{\mathbb {N}\setminus A,k}(n)$ is eventually strictly increasing. We improve this result to $A(n)=O(n^{{(k-2)}/{(k-1)}})$. We also give an example to show that this bound is best possible.
This paper is focused on spreading dynamics for a discrete Nicholson's blowflies model with time convolution kernel. This problem arises in the invasive activity of blowflies scattered in discrete spatial environment and has distributed maturated age. We found that for a general convolution kernel, the model can exhibit travelling wave phenomena in a discrete spatial habitat. In particular, we determine the minimal wave speed of travelling waves by deriving the non-existence of travelling waves, and we demonstrate that the minimal wave speed can determine the long time behaviour of solutions with compact initial function. Moreover, we prove that all travelling waves are strictly increasing, which implies that the waveforms remain monotone in the propagation process. Some numerical simulations are also presented to confirm the analytical results.
As a weak version of embedding flow, the problem of iterative roots is studied extensively in one dimension, especially in monotone case. There are few results in high dimensions because the constructive method dealing with monotone mappings is unavailable. In this paper, by introducing a kind of partial order, we define the monotonicity for two-dimensional mappings and then present some results on the existence of iterative roots for linear mappings, triangle-type mappings, and co-triangle-type mappings, respectively. Our theorems show that even the property of monotonicity for iterative roots of monotone mappings, which is a trivial result in one dimension, does not hold anymore in high dimensions. At the end of this paper, the problem of iterative roots for two well-known planar mappings, that is, Hénon mappings and coupled logistic mappings, are also discussed.
When faced with the task of solving hyperbolic partial differential equations (PDEs), high order, strong stability-preserving (SSP) time integration methods are often needed to ensure preservation of the nonlinear strong stability properties of spatial discretizations. Among such methods, SSP second derivative time-stepping schemes have been recently introduced and used for evolving hyperbolic PDEs. In previous works, coupling of forward Euler and a second derivative formulation led to sufficient conditions for a second derivative general linear method (SGLM), which preserve the strong stability properties of spatial discretizations. However, for such methods, the types of spatial discretizations that can be used are limited. In this paper, we use a formulation based on forward Euler and Taylor series conditions to extend the SSP SGLM framework. We investigate the construction of SSP second derivative diagonally implicit multistage integration methods (SDIMSIMs) as a subclass of SGLMs with order $p=r=s$ and stage order $q=p,p-1$ up to order eight, where r is the number of external stages and s is the number of internal stages of the method. Proposed methods are examined on some one-dimensional linear and nonlinear systems to verify their theoretical order, and show potential of these schemes in preserving some nonlinear stability properties such as positivity and total variation.
where $s,t\in (0,1)$ and the mass $m>0.$ By using the direct method of moving plane, we prove the strict monotonicity, symmetry and uniqueness for positive solutions to the above system in a bounded domain, unbounded domain, $\mathbb {R}^{N}$, $\mathbb {R}^{N}_{+}$ and a coercive epigraph domain $\Omega$ in $\mathbb {R}^{N}$, respectively.
New computing and communications paradigms will result in traffic loads in information server systems that fluctuate over much broader ranges of time scales than current systems. In addition, these fluctuation time scales may only be indirectly known or even be unknown. However, we should still be able to accurately design and manage such systems. This paper addresses this issue: we consider an M/M/1 queueing system operating in a random environment (denoted M/M/1(R)) that alternates between HIGH and LOW phases, where the load in the HIGH phase is higher than in the LOW phase. Previous work on the performance characteristics of M/M/1(R) systems established fundamental properties of the shape of performance curves. In this paper, we extend monotonicity results to include convexity and concavity properties, provide a partial answer to an open problem on stochastic ordering, develop new computational techniques, and include boundary cases and various degenerate M/M/1(R) systems. The basis of our results are novel representations for the mean number in system and the probability of the system being empty. We then apply these results to analyze practical aspects of system operation and design; in particular, we derive the optimal service rate to minimize mean system cost and provide a bias analysis of the use of customer-level sampling to estimate time-stationary quantities.
By developing a Green's function representation for the solution of the boundary value problem we study existence, uniqueness, and qualitative properties (e.g., positivity or monotonicity) of solutions to these problems. We apply our methods to fractional order differential equations. We also demonstrate an application of our methodology both to convolution equations with nonlocal boundary conditions as well as those with a nonlocal term in the convolution equation itself.
In this introductory chapter we discuss the history and development of fractal geometry and dimension theory as well as introducing some important concepts such as Hausdorff and box dimension.
Morphologically complex forms are related to their bases in two ways: some alteration (perhaps vacuous) of form is correlated with some alteration (also possibly vacuous) of meaning. In a sort of ideal case, this is representable by the addition of a morpheme bearing both phonological and semantic content, comparable to a Saussurean (minimal) sign. Criticism of the claim that this is indeed the general case has focused on formal relations that cannot be seen as strictly additive: ablaut, umlaut, consonant shifts, metathesis, truncation, and other markers that apparently change the shape of the base rather than simply adding material to it. The present paper brings into the discussion the opposite side of this coin: instances in which it is the semantics, rather than the phonology of the base form, that is altered in a non-additive way in a morphologically derived form. Specific cases involve the removal of a component of meaning associated with one argument of the base, correlated with the addition of a component of form. These examples constitute a challenge for morpheme-based views of morphology, comparable to that posed by non-concatenative formal markers, and a challenge to the claim that morphology is always semantically monotonic.
Non-transitivism solves the Sorites Paradox by denying the transitivity of logical consequence. After introducing the non-transitivist solution, the chapter presents the main reasons in its favour: its fit with the intuitive diagnosis of what goes wrong in soritical reasoning, its vindication of the naive theory of vagueness and its preservation of the compelling classical fundamental operational principles. The chapter then examines a rival of non-transitivism – on-contractivism – which might seem equally well supported in those respects, arguing that non-transitivism is variously superior to it. Next, the chapter focuses on a specific family of non-transitive logics – tolerant logics – explaining their basic lattice-theoretic semantics and giving details of one particularly strong logic. Finally, the chapter develops a non-transitivist approach to the Forced-March Paradox, arguing that the ideal behaviour of a non-transitivist’s confidence along the Forced March requires a super-additive and boundedly non-monotonic theory of probability, and showing how, by using the tolerant logic just mentioned, one can go through the Forced March and return a knowledgeable verdict about each case.
We present an example of an isometric subspace of a metric space that has a greater metric dimension. We also show that the metric spaces of vector groups over the integers, defined by the generating set of unit vectors, cannot be resolved by a finite set. Bisectors in the spaces of vector groups, defined by the generating set consisting of unit vectors, are completely determined.
The two-point flux-approximation (TPFA) scheme is robust in the sense that it generally gives a linear system that has a solution regardless of the variations in K and the geometrical and topological complexity of the grid. The resulting solutions will also be monotone, but the scheme is only consistent for certain combinations of grids and permeability tensors K. This implies that a TPFA solution will not necessarily approach the true solution when we increase the grid resolution. It also means that the scheme may produce different solutions depending upon how the grid is oriented relative to the main flow directions. In this chapter, we first explain the lack of consistency for TPFA, before we introduce a few consistent schemes implemented in MRST, including the mimetic finite-difference method and one example of a multipoint flux approximation method (MPFA-O). These can all be written on a general mixed hybrid form, which is motivated by mixed finite-element methods. We explain how you can specify different methods that reduce to known methods on simple grids by adjusting the inner product in the mixed hybrid formulation.
This paper discusses a type of wh-exclamative whose wh-component and degree component do not seem to go hand in hand. These are wh-exclamatives in Catalan whose moved wh-phrase is headed by the determiner quin ‘what, which’, and whose NP contains an optional DegP headed by tan ‘so’ or més ‘more’. By taking a closer look at these wh-exclamatives, we will be able to contribute to the debate on the role of gradability and of the wh-component in the semantics of wh-exclamatives. My claim is that the DegP in these wh-exclamatives leaves behind a degree variable that is ultimately bound by an expressive speech act operator. Following Castroviejo (2006) and building on Rett (2009), I adhere to the claim that wh-exclamatives in Catalan are necessarily scalar as a requirement of the expressive operator. Moreover, as a downward-monotonic operator, I show that it licenses upward-directed inferences, which ensures that wh-exclamatives express unexpectedness toward a high degree.
We consider a second-order elliptic operator L in skew product of an ordinary differential operator L1 on an interval (a, b) and an elliptic operator on a domain D2 of a Riemannian manifold such that the associated heat kernel is intrinsically ultracontractive. We give criteria for criticality and subcriticality of L in terms of a positive solution having minimal growth at η (η = a, b) to an associated ordinary differential equation. In the subcritical case, we explicitly determine the Martin compactification and Martin kernel for L on the basis of [24]; in particular, the Martin boundary over η is either one point or a compactification of D2, which depends on whether an associated integral near η diverges or converges. From this structure theorem we show a monotonicity property that the Martin boundary over η does not become smaller as the potential term of L1 becomes larger near η.