Search

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

We congratulate the authors Bertsimas, Pauphilet and van Parys (hereafter BPvP) and Hastie, Tibshirani and Tibshirani (hereafter HTT) for providing fresh and insightful views on the problem of variable selection and prediction in linear models. Their contributions at the fundamental level provide guidance for more complex models and procedures.

Inspired by the article “Anomalous relaxation model based on the fractional derivative with a Prabhakar-like kernel” (Z. Angew. Math. Phys. (2019) 70:42) whose authors Zhao and Sun studied the integro-differential equation with the kernel given by the Prabhakar function $$e^{-\gamma }_{\alpha , \beta }(t, \lambda )$$ , we provide the solution to this equation which is complementary to that obtained up to now. Our solution is valid for effective relaxation times whose admissible range extends the limits given in Zhao and Sun (Z Angew Math Phys 70:42, 2019, Theorem 3.1) to all positive values. For special choices of parameters entering the equation itself and/or characterizing the kernel, the solution comprises to known phenomenological relaxation patterns, e.g., to the Cole–Cole model (if $$\gamma = 1, \beta =1-\alpha $$ ) or to the standard Debye relaxation.

The aim of this paper is to discuss the main result in the paper by D.Y. Gao and X. Lu [On the extrema of a nonconvex functional with double-well potential in 1D, Z. Angew. Math. Phys. (2016) 67:62]. More precisely we provide a detailed study of the problem considered in that paper, pointing out the importance of the norm on the space $C^{1}[a,b]$; because no norm (topology) is mentioned on $C^{1}[a,b]$ we look at it as being a subspace of $W^{1,p}(a,b)$ for $p\in [1,\infty]$ endowed with its usual norm. We show that the objective function has not local extrema with the mentioned constraints for $p\in [1,4)$, and has (up to an additive constant) only a local maximizer for $p=\infty$, unlike the conclusion of the main result of the discussed paper where it is mentioned that there are (up to additive constants) two local minimizers and a local maximizer. We also show that the same conclusions are valid for the similar problem treated in the preprint by X. Lu and D.Y. Gao [On the extrema of a nonconvex functional with double-well potential in higher dimensions, arXiv:1607.03995]., 12 pages; in this version we added the forgotten condition $F(x) \ne 0$ for $x\in (a,b)$ on page 3

We show that a relative entropy condition recently shown by Leger and Vasseur to imply uniqueness and stable $L^2$ dependence on initial data of Lax 1- or $n$-shock solutions of an $n\times n$ system of hyperbolic conservation laws with convex entropy implies Lopatinski stability in the sense of Majda. This means in particular that Leger and Vasseur's relative entropy condition represents a considerable improvement over the standard entropy condition of decreasing shock strength and increasing entropy along forward Hugoniot curves, which, in a recent example exhibited by Barker, Freist\"uhler and Zumbrun, was shown to fail to imply Lopatinski stability, even for systems with convex entropy. This observation bears also on the parallel question of existence, at least for small $BV$ or $H^s$ perturbations, Comment: to appear in Proceedings of the AMS

In this paper, we discuss the validity of the result of Khuangsatung and Kangtunyakarn [Existence and convergence theorem for fixed point problem of various nonlinear mappings and variational inequality problems without some assumptions, Filomat 32(1) (2018) 305–309].

The preeminent target of present study is to reveal the speed characteristic of ongoing outbreak COVID-19 due to novel coronavirus. On January 2020, the novel coronavirus infection (COVID-19) detected in India, and the total statistic of cases continuously increased to 7 128 268 cases including 109 285 deceases to October 2020, where 860 601 cases are active in India. In this study, we use the Hermite wavelets basis in order to solve the COVID-19 model with time- arbitrary Caputo derivative. The discussed framework is based upon Hermite wavelets. The operational matrix incorporated with the collocation scheme is used in order to transform arbitrary-order problem into algebraic equations. The corrector scheme is also used for solving the COVID-19 model for distinct value of arbitrary order. Also, authors have investigated the various behaviors of the arbitrary-order COVID-19 system and procured developments are matched with exiting developments by various techniques. The various illustrations of susceptible, exposed, infected, and recovered individuals are given for its behaviors at the various value of fractional order. In addition, the proposed model has been also supported by some numerical simulations and wavelet-based results.

Funder: John Simon Guggenheim Memorial Foundation; doi: https://doi.org/10.13039/100005851, Funder: Einstein Visiting Fellow Program, The Rayleigh–Bénard system with stress-free boundary conditions is shown to have a global attractor in each affine space where velocity has fixed spatial average. The physical problem is shown to be equivalent to one with periodic boundary conditions and certain symmetries. This enables a Gronwall estimate on enstrophy. That estimate is then used to bound the L 2 norm of the temperature gradient on the global attractor, which, in turn, is used to find a bounding region for the attractor in the enstrophy–palinstrophy plane. All final bounds are algebraic in the viscosity and thermal diffusivity, a significant improvement over previously established estimates. The sharpness of the bounds are tested with numerical simulations.

The abstract results and applications presented in “Controllability of fractional neutral stochastic functional differential systems, Z. Angew. Math. Phys. 65 (2014), no. 5, 941–959, are not correct. Moreover, the class of differential control problems studied in [1] is not H-controllable.

Congruences mod p for a prime p and partial products of the numbers 1,…, p − 1 are obtained. Bibliography: 2 titles.

In this paper we develop new tensor methods for unconstrained convex optimization, which solve at each iteration an auxiliary problem of minimizing convex multivariate polynomial. We analyze the simplest scheme, based on minimization of a regularized local model of the objective function, and its accelerated version obtained in the framework of estimating sequences. Their rates of convergence are compared with the worst-case lower complexity bounds for corresponding problem classes. Finally, for the third-order methods, we suggest an efficient technique for solving the auxiliary problem, which is based on the recently developed relative smoothness condition (Bauschke et al. in Math Oper Res 42:330–348, 2017; Lu et al. in SIOPT 28(1):333–354, 2018). With this elaboration, the third-order methods become implementable and very fast. The rate of convergence in terms of the function value for the accelerated third-order scheme reaches the level $$O\left( {1 \over k^4}\right) $$ O 1 k 4 , where k is the number of iterations. This is very close to the lower bound of the order $$O\left( {1 \over k^5}\right) $$ O 1 k 5 , which is also justified in this paper. At the same time, in many important cases the computational cost of one iteration of this method remains on the level typical for the second-order methods.

The purpose of this short paper is to present a new form of the so called early exercise premium for the American type derivatives. The decomposition we derived consists of the corresponding European derivative and a derivative with a stochastic maturity. In different particular cases we reach to the well known form for the American put option where the underlying asset is driven by a Brownian motion or a Levy process.

The first symptomatic infected individuals of coronavirus (Covid-19) was confirmed in December 2020 in the city of Wuhan, China. In India, the first reported case of Covid-19 was confirmed on 30 January 2020. Today, coronavirus has been spread out all over the world. In this manuscript, we studied the coronavirus epidemic model with a true data of India by using Predictor-Corrector scheme. For the proposed model of Covid-19, the numerical and graphical simulations are performed in a framework of the new generalised Caputo sense non-integer order derivative. We analysed the existence and uniqueness of solution of the given fractional model by the definition of Chebyshev norm, Banach space, Schauder's second fixed point theorem, Arzel's-Ascoli theorem, uniform boundedness, equicontinuity and Weissinger's fixed point theorem. A new analysis of the given model with the true data is given to analyse the dynamics of the model in fractional sense. Graphical simulations show the structure of the given classes of the non-linear model with respect to the time variable. We investigated that the mentioned method is copiously strong and smooth to implement on the systems of non-linear fractional differential equation systems. The stability results for the projected algorithm is also performed with the applications of some important lemmas. The present study gives the applicability of this new generalised version of Caputo type non-integer operator in mathematical epidemiology. We compared that the fractional order results are more credible to the integer order results.

We investigate the asymptotic properties of the trajectories generated by a second-order dynamical system with Hessian driven damping and a Tikhonov regularization term in connection with the minimization of a smooth convex function in Hilbert spaces. We obtain fast convergence results for the function values along the trajectories. The Tikhonov regularization term enables the derivation of strong convergence results of the trajectory to the minimizer of the objective function of minimum norm.

In this work we introduce the r-Hunter-Saxton equation, a generalisation of the Hunter-Saxton equation arising as extremals of an action principle posed in L_r. We characterise solutions to the Cauchy problem, quantifying the blow-up time and studying various symmetry reductions. We construct piecewise linear functions and show that they are weak solutions to the r-Hunter-Saxton equation., Revised after referee comments

We propose a complete-search algorithm for solving a class of non-convex, possibly infinite-dimensional, optimization problems to global optimality. We assume that the optimization variables are in a bounded subset of a Hilbert space, and we determine worst-case run-time bounds for the algorithm under certain regularity conditions of the cost functional and the constraint set. Because these run-time bounds are independent of the number of optimization variables and, in particular, are valid for optimization problems with infinitely many optimization variables, we prove that the algorithm converges to an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}ε-suboptimal global solution within finite run-time for any given termination tolerance \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon > 0$$\end{document}ε>0. Finally, we illustrate these results for a problem of calculus of variations.

In order to solve the Sylvester equations more efficiently, a new four parameters positive and skew-Hermitian splitting (FPPSS) iterative method is proposed in this paper based on the previous research of the positive and skew-Hermitian splitting (PSS) iterative method. We prove that when coefficient matrix A and B satisfy certain conditions, the FPPSS iterative method is convergent in the parameter&rsquo, s value region. The numerical experiment results show that compared with previous iterative method, the FPPSS iterative method is more effective in terms of iteration number IT and runtime.

In 1985, Odoni showed that in characteristic 0 0 the Galois group of the n n -th iterate of the generic polynomial with degree d d is as large as possible. That is, he showed that this Galois group is the n n -th wreath power of the symmetric group S d S_d . We generalize this result to positive characteristic, as well as to the generic rational function. These results can be applied to prove certain density results in number theory, two of which are presented here. This work was partially completed by the late R.W.K. Odoni in an unpublished paper.

Part of the work was done while the authors were visiting the South China University of Science and Technology (SUSTech), Shenzhen, in 2018, and we are grateful (in particular to Professor Cai Heng Li) for the hospitality that we received.The authors would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Groups, representations and applications: new perspectives (supported by EPSRC grant no.EP/R014604/1), where further work on this paper was undertaken. In particular we acknowledge a Simons Fellowship (Cameron) and a Kirk Distinguished Visiting Fellowship (Praeger) during this programme. Schneider thanks the Centre for the Mathematics of Symmetry and Computation of The University of Western Australia and Australian Research Council Discovery Grant DP160102323 for hosting his visit in 2017 and acknowledges the support of the CNPq projects Produtividade em Pesquisa (project no.: 308212/2019-3) and Universal (project no.:421624/2018-3). Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial structures such as affine spaces or Cartesian decompositions, but such structures for diagonal groups have not been studied in general. The main purpose of this paper is to describe and characterise such structures, which we call diagonal semilattices. Unlike the diagonal groups in the O'Nan-Scott theorem, which are defined over finite characteristically simple groups, our construction works over arbitrary groups, finite or infinite. A diagonal semilattice depends on a dimension m and a group T. For m=2, it is a Latin square, the Cayley table of T, though in fact any Latin square satisfies our combinatorial axioms. However, for m≥3, the group T emerges naturally and uniquely from the axioms. (The situation somewhat resembles projective geometry, where projective planes exist in great profusion but higher-dimensional structures are coordinatised by an algebraic object, a division ring.) A diagonal semilattice is contained in the partition lattice on a set Ω, and we provide an introduction to the calculus of partitions. Many of the concepts and constructions come from experimental design in statistics. We also determine when a diagonal group can be primitive, or quasiprimitive (these conditions turn out to be equivalent for diagonal groups). Associated with the diagonal semilattice is a graph, the diagonal graph, which has the same automorphism group as the diagonal semilattice except in four small cases with m

It is pointed out that the proof of the basic result of Rahmanov's paper has a serious gap. It is documented by original sources that a statement he relied on in the proof contains a misprint, and it is shown by a counterexample that this statement (with the misprint) is, in fact, false. A somewhat weaker statement is proved true.

The study of the dynamics of the size of a population via mathematical modelling is a problem of interest and widely studied. Traditionally, continuous deterministic methods based on differential equations have been used to deal with this problem. However discrete versions of some models are also available and sometimes more adequate. In this paper, we randomize the Pielou logistic equation in order to include the inherent uncertainty in modelling. Taking advantage of the method of transformation of random variables, we provide a full probabilistic description to the randomized Pielou logistic model via the computation of the probability density functions of the solution stochastic process, the steady state and the time until a certain level of population is reached. The theoretical results are illustrated by means of two examples, the first one consists of a numerical experiment and the second one shows an application to study the diffusion of a technology using real data.

Differential-algebraic equations (DAEs) are widely used for modeling of dynamical systems. In numerical analysis of DAEs, consistent initialization and index reduction are important preprocessing prior to numerical integration. Existing DAE solvers commonly adopt structural preprocessing methods based on combinatorial optimization. Unfortunately, the structural methods fail if the DAE has numerical or symbolic cancellations. For such DAEs, methods have been proposed to modify them to other DAEs to which the structural methods are applicable, based on the combinatorial relaxation technique. Existing modification methods, however, work only for a class of DAEs that are linear or close to linear. This paper presents two new modification methods for nonlinear DAEs: the substitution method and the augmentation method. Both methods are based on the combinatorial relaxation approach and are applicable to a large class of nonlinear DAEs. The substitution method symbolically solves equations for some derivatives based on the implicit function theorem and substitutes the solution back into the system. Instead of solving equations, the augmentation method modifies DAEs by appending new variables and equations. The augmentation method has advantages that the equation solving is not needed and the sparsity of DAEs is retained. It is shown in numerical experiments that both methods, especially the augmentation method, successfully modify high-index DAEs that the DAE solver in MATLAB cannot handle., Comment: A preliminary version of this paper is to appear in Proceedings of the 44th International Symposium on Symbolic and Algebraic Computation (ISSAC 2019), Beijing, China, July 2019

International audience; In this short paper we prove that the almost Schur theorem, introduced by De Lellis and Topping, is true on 4-dimensional Riemannian manifolds of nonnegative scalar curvature and discuss some related problems on other dimensional manifolds.

In a recent paper [JUKIĆ, D.: A necessary and sufficient criterion for the existence of the global minima of a continuous lower bounded function on a noncompact set, J. Comput. Appl. Math. 375 (2020)], a new existence level was introduced and then was used to obtain a necessary and sufficient criterion for the existence of the global minima of a continuous lower bounded function on a noncompact set. In this paper, we determined that existence level for the residual sum of squares of the power-law regression with an unknown location parameter, and so we obtained a necessary and sufficient condition which guarantee the existence of the least squares estimate.

Diffusion equations with Riemann–Liouville fractional derivatives are Volterra integro-partial differential equations with weakly singular kernels and present fundamental challenges for numerical computation. In this paper, we make a convergence analysis of the Schwarz waveform relaxation (SWR) algorithms with Robin transmission conditions (TCs) for these problems. We focus on deriving good choice of the parameter involved in the Robin TCs, at the continuous and fully discretized level. Particularly, at the space-time continuous level, we show that the derived Robin parameter is much better than the one predicted by the well-understood equioscillation principle. At the fully discretized level, the problem of determining a good Robin parameter is studied in the convolution quadrature framework, which permits us to precisely capture the effects of different temporal discretization methods on the convergence rate of the SWR algorithms. The results obtained in this paper will be preliminary preparations for our further study of the SWR algorithms for integro-partial differential equations.

In order to solve the complicated process and low efficiency and low accuracy of solving a class of matrix equations, this paper introduces the linear saturated system model neural network architecture to solve the bisymmetric solution of a class of matrix equations. Firstly, a class of matrix equations is constructed to determine the key problems of solving the equations. Secondly, the linear saturated system model neural network structure is constructed to determine the characteristic parameters in the process of bisymmetric solution. Then, the matrix equations is solved by using backpropagation neural network topology. Finally, the class normalization is realized by using the objective function of bisymmetric solution, and the bisymmetric solution of a class of matrix equations is realized. In order to verify the solving effect of the method in this paper, three indexes (accuracy, correction accuracy, and solving time) are designed in the experiment. The experimental results show that the proposed method can effectively reduce the solving time, can improve the accuracy and correction effect of the bisymmetric solution, and has high practicability.

PurposeIn this paper, the authors applied the empirical likelihood method, which was originally proposed by Owen, to the copula moment based estimation methods to take advantage of its properties, effectiveness, flexibility and reliability of the nonparametric methods, which have limiting chi-square distributions and may be used to obtain tests or confidence intervals. The authors derive an asymptotically normal estimator of the empirical likelihood based on copula moment estimation methods (ELCM). Finally numerical performance with a simulation experiment of ELCM estimator is studied and compared to the CM estimator, with a good result.Design/methodology/approachIn this paper we applied the empirical likelihood method which originally proposed by Owen, to the copula moment based estimation methods.FindingsWe derive an asymptotically normal estimator of the empirical likelihood based on copula moment estimation methods (ELCM). Finally numerical performance with a simulation experiment of ELCM estimator is studied and compared to the CM estimator, with a good result.Originality/valueIn this paper we applied the empirical likelihood method which originally proposed by Owen 1988, to the copula moment based estimation methods given by Brahimi and Necir 2012. We derive an new estimator of copula parameters and the asymptotic normality of the empirical likelihood based on copula moment estimation methods.

In recent years, the problem of estimating Hankel determinants has attracted the attention of many mathematicians. Their research have been focused mainly on deriving the bounds of H 2 , 2 {H_{2,2}} or H 3 , 1 {H_{3,1}} over different subclasses of 𝒮 {\mathcal{S}} . Only in a few papers third Hankel determinants for non-univalent functions were considered. In this paper, we consider two classes of analytic functions with real coefficients. The first one is the class 𝒯 {\mathcal{T}} of typically real functions. The second object of our interest is 𝒦 ℝ ⁢ ( i ) {\mathcal{K}_{\mathbb{R}}(i)} , the class of functions with real coefficients which are convex in the direction of the imaginary axis. In both classes, we find lower and upper bounds of the third Hankel determinant. The results are sharp.

In the present paper we describe the family of all closed convex plane curves of class $$C^1$$ C 1 which have circles as their isoptics. In the first part of the paper we give a certain characterization of all ellipses based on the notion of isoptic and we give a geometric characterization of curves whose orthoptics are circles. The second part of the paper contains considerations on curves which have circles as their isoptics and we show the form of support functions of all considered curves.

In this paper, we study a problem posed by Furstenberg on intersections between × 2 , × 3 \times 2, \times 3 invariant sets. We present here a direct geometrical counting argument to revisit a theorem of Wu and Shmerkin. This argument can be used to obtain further improvements. For example, we show that if A 2 , A 3 ⊂ [ 0 , 1 ] A_2,A_3\subset [0,1] are closed and × 2 , × 3 \times 2, \times 3 invariant respectively, assuming that dim ⁡ A 2 + dim ⁡ A 3 > 1 \dim A_2+\dim A_3>1 then A 2 ∩ ( u A 3 + v ) A_2\cap (uA_3+v) is sparse (defined in this paper) and has box dimension zero uniformly with respect to the real parameters u , v u,v such that u u and u − 1 u^{-1} are both bounded away from 0 0 .

In this paper, we develop the theory of a class of casual differential equations on a time scale. An existence theorem for casual differential equations on a time scale is given under mixed Lipschitz and compactness conditions by the fixed point theorem in Banach algebra due to Dhage. Some fundamental differential inequalities on a time scale are also presented which are utilized to investigate the existence of extremal solutions. The comparison principle on casual differential equations on a time scale is established. Our results in this paper extend and improve some well-known results.

This paper is a survey of results on countable families with natural degree spectra. These results were obtained by a modification of the methodology proposed by Wechner, who first found a family of sets with the spectrum consisting precisely of nonzero Turing degrees. Based on this method, many researchers obtained examples of families with other natural spectra. In addition, in this paper we extend these results and present new examples of natural spectra. In particular, we construct a family of finite sets with the spectrum consisting of exactly non-K-trivial degrees and also we find new sufficient conditions on $$ {\Delta}_2^0 $$ -degree a, which guarantees that the class {x : x ≰ a} is the degree spectrum of some family. Finally, we give a survey of our recent results on the degree spectra of α-families, where α is an arbitrary computable ordinal.

This paper presents some new formulas and properties of the generalized fractional derivative with non-singular kernel that covers various types of fractional derivatives such as the Caputo–Fabrizio fractional derivative, the Atangana–Baleanu fractional derivative, and the weighted Atangana–Baleanu fractional derivative. These new properties extend many recent results existing in the literature. Furthermore, the paper proposes some interesting inequalities that estimate the generalized fractional derivatives of some specific functions. These inequalities can be used to construct Lyapunov functions with the aim to study the global asymptotic stability of several fractional-order systems arising from diverse fields of science and engineering.

The paper focuses on the analysis of the Euler projection Galerkin finite element method (FEM) for the dynamics of magnetization in ferromagnetic materials, described by the Landau–Lifshitz equation with the point-wise constraint $|{\textbf{m}}|=1$. The method is based on a simple sphere projection that projects the numerical solution onto a unit sphere at each time step, and the method has been used in many areas in the past several decades. However, error analysis for the commonly used method has not been done since the classical energy approach cannot be applied directly. In this paper we present an optimal $\textbf{L}^2$ error analysis of the backward Euler sphere projection method by using quadratic or higher order finite elements under a time step condition $\tau =O(\epsilon _0 h)$ with some small $\epsilon _0>0$. The analysis is based on more precise estimates of the extra error caused by the sphere projection in both $\textbf{L}^2$ and $\textbf{H}^1$ norms, and the classical estimate of dual norm. Numerical experiment is provided to confirm our theoretical analysis.

The objective of this paper is two-fold. The first objective is to complete the former work of Bensoussan and Frehse [2] . One big limitation of this paper was the fact that they are systems of PDE. on a bounded domain. One can expect solutions to be bounded, since one looks for smooth solutions. This is a very important property for the development of the method. It is true also that solutions which exist in a bounded domain may fail to exist on R n , because of the lack of bounds. We give conditions so that the results of [2] can be extended to R n . The second objective is to consider the BSDE (Backward stochastic differential equations) version of the system of PDE. This is the objective of a more recent work of Xing and Zitkovic [8] . They consider systems of BSDE with quadratic growth, which is a well-known open problem in the BSDE literature. Since the BSDE are Markovian, the problem is equivalent to the analytic one. However, because of this motivation the analytic problem is in R n and not on a bounded domain. Xing and Zitkovic developed a probabilistic approach. The connection between the analytic problem and the BSDE is not apparent. Our objective is to show that the analytic approach can be completely translated into a probabilistic one. Nevertheless probabilistic concepts are also useful, after their conversion into the analytic framework. This is in particular true for the uniqueness result.

In this paper, we establish the global existence and uniqueness of the solution of the Cauchy problem of a one-dimensional compressible isentropic Euler system for a Chaplygin gas with large initial data in the space L loc 1 . The hypotheses on the initial data may be the least requirement to ensure the existence of a weak solution in the Lebesgue measurable sense. The novelty and also the essence of the difficulty of the problem lie in the fact that we have neither the requirement on the local boundedness of the density nor that which is bounded away from vacuum. We develop the previous results on this degenerate system. The method used is Lagrangian representation, the essence of which is characteristic analysis. The key point is to prove the existence of the Lagrangian representation and the absolute continuity of the potentials constructed with respect to the space and the time variables. We achieve this by finding a property of the fundamental theorem of calculus for Lebesgue integration, which is a sufficient and necessary condition for judging whether a monotone continuous function is absolutely continuous. The assumptions on the initial data in this paper are believed to also be necessary for ruling out the formation of Dirac singularity of density. The ideas and techniques developed here may be useful for other nonlinear problems involving similar difficulties.

The paper is devoted to discretization of integral norms of functions from a given finite dimensional subspace. Even though this problem is extremely important in applications, its systematic study has begun only recently. In this paper we obtain a conditional theorem for all integral norms $$L_q$$ , $$1\le q

Full-waveform inversion (FWI) is today a standard process for the inverse problem of seismic imaging. PDE-constrained optimization is used to determine unknown parameters in a wave equation that represent geophysical properties. The objective function measures the misfit between the observed data and the calculated synthetic data, and it has traditionally been the least-squares norm. In a sequence of papers, we introduced the Wasserstein metric from optimal transport as an alternative misfit function for mitigating the so-called cycle skipping, which is the trapping of the optimization process in local minima. In this paper, we first give a sharper theorem regarding the convexity of the Wasserstein metric as the objective function. We then focus on two new issues. One is the necessary normalization of turning seismic signals into probability measures such that the theory of optimal transport applies. The other, which is beyond cycle skipping, is the inversion for parameters below reflecting interfaces. For the first, we propose a class of normalizations and prove several favorable properties for this class. For the latter, we demonstrate that FWI using optimal transport can recover geophysical properties from domains where no seismic waves travel through. We finally illustrate these properties by the realistic application of imaging salt inclusions, which has been a significant challenge in exploration geophysics.

In this paper, the global exponential stability and periodicity are investigated for delayed neural network models with continuous coefficients and piecewise constant delay of generalized type. The sufficient condition for the existence and uniqueness of periodic solutions of the model is established by applying Banach’s fixed point theorem and the successive approximations method. By constructing suitable differential inequalities with generalized piecewise constant delay, some sufficient conditions for the global exponential stability of the model are obtained. Typical numerical examples with simulations are utilized to illustrate the validity and improvement in less conservatism of the theoretical results. This paper ends with a brief conclusion.

In this paper, we study flows of hypersurfaces in hyperbolic space, and apply them to prove geometric inequalities. In the first part of the paper, we consider volume preserving flows by a family of curvature functions including positive powers of $k$-th mean curvatures with $k=1,\cdots,n$, and positive powers of $p$-th power sums $S_p$ with $p>0$. We prove that if the initial hypersurface $M_0$ is smooth and closed and has positive sectional curvatures, then the solution $M_t$ of the flow has positive sectional curvature for any time $t>0$, exists for all time and converges to a geodesic sphere exponentially in the smooth topology. The convergence result can be used to show that certain Alexandrov-Fenchel quermassintegral inequalities, known previously for horospherically convex hypersurfaces, also hold under the weaker condition of positive sectional curvature. In the second part of this paper, we study curvature flows for strictly horospherically convex hypersurfaces in hyperbolic space with speed given by a smooth, symmetric, increasing and homogeneous degree one function $f$ of the shifted principal curvatures $\lambda_i=\kappa_i-1$, plus a global term chosen to impose a constraint on the quermassintegrals of the enclosed domain, where $f$ is assumed to satisfy a certain condition on the second derivatives. We prove that if the initial hypersurface is smooth, closed and strictly horospherically convex, then the solution of the flow exists for all time and converges to a geodesic sphere exponentially in the smooth topology. As applications of the convergence result, we prove a new rigidity theorem on smooth closed Weingarten hypersurfaces in hyperbolic space, and a new class of Alexandrov-Fenchel type inequalities for smooth horospherically convex hypersurfaces in hyperbolic space.

In this paper, we consider boundary-value problems for a new class of hybrid systems of differential equations whose coefficients contain the Dirac delta-function. Hybrid systems are systems that contain both ordinary and partial differential equations; such systems appear, for example, when equations of motion of mechanical systems of rigid bodies attached to a beam by elastic bonds are derived from the Hamilton–Ostrogradsky variational principle. We present examples that lead to such systems and introduce the notions of generalized solutions and eigenvalues of a boundary-value problem. We also compare results of numerical simulations based on methods proposed in this paper with results obtained by previously known methods and show that our approach is reliable and universal.

This is the first of a series of two papers dealing with local limit theorems in relatively hyperbolic groups. In this first paper, we prove rough estimates for the Green function. Along the way, we introduce the notion of relative automaticity which will be useful in both papers and we show that relatively hyperbolic groups are relatively automatic. We also define the notion of spectral positive recurrence for random walks on relatively hyperbolic groups. We then use our estimates for the Green function to prove that $p_n\asymp R^{-n}n^{-3/2}$ for spectrally positive-recurrent random walks, where $p_n$ is the probability of going back to the origin at time n and where R is the inverse of the spectral radius of the random walk.

Non-monotonicity height is an important index to describe the complexity of dynamics for piecewise monotone functions. Although it is used extensively in the theory of iterative roots, its calculation is still difficult especially in the infinite case. In this paper, by introducing the concept of spanning interval, we first present a sufficient condition for piecewise monotone functions to have height infinity and then an algorithm for finding the spanning intervals is given. We further investigate the density of all piecewise monotone functions with infinite and finite height, respectively, and the results indicate the instability of height. At the end of this paper, the variance of height under composition, especially for functions of height 1 and infinity, are also discussed.

PurposeIn this paper, Picard–S hybrid iterative process is defined, which is a hybrid of Picard and S-iterative process. This new iteration converges faster than all of Picard, Krasnoselskii, Mann, Ishikawa, S-iteration, Picard–Mann hybrid, Picard–Krasnoselskii hybrid and Picard–Ishikawa hybrid iterative processes for contraction mappings and to find the solution of delay differential equation, using this hybrid iteration also proved some results for Picard–S hybrid iterative process for nonexpansive mappings.Design/methodology/approachThis new iteration converges faster than all of Picard, Krasnoselskii, Mann, Ishikawa, S-iteration, Picard–Mann hybrid, Picard–Krasnoselskii hybrid, Picard–Ishikawa hybrid iterative processes for contraction mappings.FindingsShowed the fastest convergence of this new iteration and then other iteration defined in this paper. The author finds the solution of delay differential equation using this hybrid iteration. For new iteration, the author also proved a theorem for nonexpansive mapping.Originality/valueThis new iteration converges faster than all of Picard, Krasnoselskii, Mann, Ishikawa, S-iteration, Picard–Mann hybrid, Picard–Krasnoselskii hybrid, Picard–Ishikawa hybrid iterative processes for contraction mappings and to find the solution of delay differential equation, using this hybrid iteration also proved some results for Picard–S hybrid iterative process for nonexpansive mappings.

In this short note we show that non-negative Ricci curvature is not preserved under Ricci flow for closed manifolds of dimensions four and above, strengthening a previous result of Knopf in \cite{K} for complete non-compact manifolds of bounded curvature. This brings down to four dimensions a similar result B\"ohm and Wilking have for dimensions twelve and above, \cite{BW}. Moreover, the manifolds constructed here are \Kahler manifolds and relate to a question raised by Xiuxiong Chen in \cite{XC}, \cite{XCL}., Comment: New version with added references and corrected typos

This is the first of two papers in which we investigate the properties of the displacement functions of automorphisms of free groups (more generally, free products) on Culler-Vogtmann Outer space and its simplicial bordification - the free splitting complex - with respect to the Lipschitz metric. The theory for irreducible automorphisms being well-developed, we concentrate on the reducible case. Since we deal with the bordification, we develop all the needed tools in the more general setting of deformation spaces, and their associated free splitting complexes. In the present paper we study the local properties of the displacement function. In particular, we study its convexity properties and the behaviour at bordification points, by geometrically characterising its continuity-points. We prove that the global-simplex-displacement spectrum of $Aut(F_n)$ is a well-ordered subset of $\mathbb R$, this being helpful for algorithmic purposes. We introduce a weaker notion of train tracks, which we call {\em partial train tracks} (which coincides with the usual one for irreducible automorphisms) and we prove that, for any automorphism, points of minimal displacement - minpoints - coincide with the marked metric graphs that support partial train tracks. We show that any automorphism, reducible or not, has a partial train track (hence a minpoint) either in the outer space or its bordification. We show that, given an automorphism, any of its invariant free factors is seen in a partial train track map. In a subsequent paper we will prove that level sets of the displacement functions are connected, and we will apply that result to solve certain decision problems., 50 pages. Originally part of arXiv:1703.09945 . We decided to split that paper following the recommendations of a referee. Updated subsequent to acceptance by Transactions of the American Mathematical Society

The classical result of L. Székelyhidi states that (under some assumptions) every solution of a general linear equation must be a polynomial function. It is known that Székelyhidi’s result may be generalized to equations where some occurrences of the unknown functions are multiplied by a linear combination of the variables. In this paper we study the equations where two such combinations appear. The simplest nontrivial example of such a case is given by the equation$$\begin{aligned} F(x + y) - F(x) - F(y) = yf(x) + xf(y) \end{aligned}$$F(x+y)-F(x)-F(y)=yf(x)+xf(y)considered by Fechner and Gselmann (Publ Math Debrecen 80(1–2):143–154, 2012). In the present paper we prove several results concerning the systematic approach to the generalizations of this equation.

In this paper we compute the rates of convergence of power series statistical convergence of sequences of positive linear operators. We also investigate some Korovkin type approximation properties of the $$q$$ -Meyer–Konig and Zeller operators and Durrmeyer variant of the $$q$$ -Meyer–Konig and Zeller operators via power series statistical convergence. We show that the approximation results obtained in this paper expand some previous approximation results of the corresponding operators.