ALBERT

Description: Recently, non-standard Lagrangians have gained a growing importance in theoretical physics and in the theory of non-linear differential equations. However, their formulations and implications in general relativity are still in their infancies despite some advances in contemporary cosmology. The main aim of this paper is to fill the gap. Though non-standard Lagrangians may be defined by a multitude form, in this paper, we considered the exponential type. One basic feature of exponential non-standard Lagrangians concerns the modified Euler-Lagrange equation obtained from the standard variational analysis. Accordingly, when applied to spacetime geometries, one unsurprisingly expects modified geodesic equations. However, when taking into account the time-like paths parameterization constraint, remarkably, it was observed that mutually discrete gravity and discrete spacetime emerge in the theory. Two different independent cases were obtained: A geometrical manifold with new spacetime coordinates augmented by a metric signature change and a geometrical manifold characterized by a discretized spacetime metric. Both cases give raise to Einstein’s field equations yet the gravity is discretized and originated from “spacetime discreteness”. A number of mathematical and physical implications of these results were discussed though this paper and perspectives are given accordingly.

Description: By recourse to tempered ultradistributions, we show here that the effect of a q-Fourier transform (qFT) is to map equivalence classes of functions into other classes in a one-to-one fashion. This suggests that Tsallis’ q-statistics may revolve around equivalence classes of distributions and not individual ones, as orthodox statistics does. We solve here the qFT’s non-invertibility issue, but discover a problem that remains open.

Description: We develop isometry and inversion formulas for the Segal–Bargmann transform on odd-dimensional hyperbolic spaces that are as parallel as possible to the dual case of odd-dimensional spheres.

Description: Using torus gauge fixing, Hahn in 2008 wrote down an expression for a Chern-Simons path integral to compute the Wilson Loop observable, using the Chern-Simons action \(S_{CS}^\kappa\), \(\kappa\) is some parameter. Instead of making sense of the path integral over the space of \(\mathfrak{g}\)-valued smooth 1-forms on \(S^2 \times S^1\), we use the Segal Bargmann transform to define the path integral over \(B_i\), the space of \(\mathfrak{g}\)-valued holomorphic functions over \(\mathbb{C}^2 \times \mathbb{C}^{i-1}\). This approach was first used by us in 2011. The main tool used is Abstract Wiener measure and applying analytic continuation to the Wiener integral. Using the above approach, we will show that the Chern-Simons path integral can be written as a linear functional defined on \(C(B_1^{\times^4} \times B_2^{\times^2}, \mathbb{C})\) and this linear functional is similar to the Chern-Simons linear functional defined by us in 2011, for the Chern-Simons path integral in the case of \(\mathbb{R}^3\). We will define the Wilson Loop observable using this linear functional and explicitly compute it, and the expression is dependent on the parameter \(\kappa\). The second half of the article concentrates on taking \(\kappa\) goes to infinity for the Wilson Loop observable, to obtain link invariants. As an application, we will compute the Wilson Loop observable in the case of \(SU(N)\) and \(SO(N)\). In these cases, the Wilson Loop observable reduces to a state model. We will show that the state models satisfy a Jones type skein relation in the case of \(SU(N)\) and a Conway type skein relation in the case of \(SO(N)\). By imposing quantization condition on the charge of the link \(L\), we will show that the state models are invariant under the Reidemeister Moves and hence the Wilson Loop observables indeed define a framed link invariant. This approach follows that used in an article written by us in 2012, for the case of \(\mathbb{R}^3\).

Description: We discuss a new approach to represent fractional operators by Sinc approximation using convolution integrals. A spin off of the convolution representation is an effective inverse Laplace transform. Several examples demonstrate the application of the method to different practical problems.

Description: Given a hyperbolic quadric of PG(5, 2), there are 28 points off this quadric and 56 lines skew to it. It is shown that the (286; 563)-configuration formed by these points and lines is isomorphic to the combinatorial Grassmannian of type G2(8). It is also pointed out that a set of seven points of G2(8) whose labels share a mark corresponds to a Conwell heptad of PG(5, 2). Gradual removal of Conwell heptads from the (286; 563)-configuration yields a nested sequence of binomial configurations identical with part of that found to be associated with Cayley-Dickson algebras (arXiv:1405.6888).

Description: Applications of fractional time derivatives in physics and engineering require the existence of nontranslational time automorphisms on the appropriate algebra of observables. The existence of time automorphisms on commutative and noncommutative C*-algebras for interacting many-body systems is investigated in this article. A mathematical framework is given to discuss local stationarity in time and the global existence of fractional and nonfractional time automorphisms. The results challenge the concept of time flow as a translation along the orbits and support a more general concept of time flow as a convolution along orbits. Implications for the distinction of reversible and irreversible dynamics are discussed. The generalized concept of time as a convolution reduces to the traditional concept of time translation in a special limit.

Description: We find a Selberg zeta function expression of certain one-loop spin partition functions on three-dimensional thermal anti-de Sitter space. Of particular interest is the partition function of higher spin fermionic particles. We also set up, in the presence of spin, a Patterson-type formula involving the logarithmic derivative of zeta.

Description: This article is devoted to the study of the ASARCO demolition seismic data. Two different classes of modeling techniques are explored: First, mathematical interpolation methods and second statistical smoothing approaches for curve fitting. We estimate the characteristic parameters of the propagation medium for seismic waves with multiple mathematical and statistical techniques, and provide the relative advantages of each approach to address fitting of such data. We conclude that mathematical interpolation techniques and statistical curve fitting techniques complement each other and can add value to the study of one dimensional time series seismographic data: they can be use to add more data to the system in case the data set is not large enough to perform standard statistical tests.

Description: Root-operator factorization à la Dirac provides an effective tool to deal with equations, which are not of evolution type, or are ruled by fractional differential operators, thus eventually yielding evolution-like equations although for a multicomponent vector. We will review the method along with its extension to root operators of degree higher than two. Also, we will show the results obtained by the Dirac-method as well as results from other methods, specifically in connection with evolution-like equations ruled by square-root operators, that we will address to as relativistic evolution equations.

Description: Phys and Math are two colleagues at the University of Saçenbon (Crefan Kingdom), dialoguing about the remarkable efficiency of mathematics for physics. They talk about the notches on the Ishango bone and the various uses of psi in maths and physics; they arrive at dessins d’enfants, moonshine concepts, Rademacher sums and their significance in the quantum world. You should not miss their eccentric proposal of relating Bell’s theorem to the Baby Monster group. Their hyperbolic polygons show a considerable singularity/cusp structure that our modern age of computers is able to capture. Henri Poincaré would have been happy to see it.

Description: The isomorphism of Karoubi-Villamayor K-groups with smooth K-groups for monoid algebras over quasi stable locally convex algebras is established. We prove that the Quillen K-groups are isomorphic to smooth K-groups for monoid algebras over quasi-stable Frechet algebras having a properly uniformly bounded approximate unit and not necessarily m-convex. Based on these results the K-regularity property for quasi-stable Frechet algebras having a properly uniformly bounded approximate unit is established.

Description: We investigate various scenarios for ending the San Francisco MSM (men having sex with men) HIV/AIDS epidemic (1978–1984). We use our previously developed model and explore changes due to prevention strategies such as testing, treatment and reduction of the number of contacts. Here we consider a “what-if” scenario, by comparing different treatment strategies, to determine which factor has the greatest impact on reducing the HIV/AIDS epidemic. The factor determining the future of the epidemic is the reproduction number R0; if R0 〈 1, the epidemic is stopped. We show that treatment significantly reduces the total number of infected people. We also investigate the effect a reduction in the number of contacts after seven years, when the HIV/AIDS threat became known, would have had in the population. Both reduction of contacts and treatment alone, however, would not have been enough to bring R0 below one; but when combined, we show that the effective R0 becomes less than one, and therefore the epidemic would have been eradicated.

Description: This paper proposes an approach for the space-fractional diffusion equation in one dimension. Since fractional differential operators are non-local, two main difficulties arise after discretization and solving using Gaussian elimination: how to handle the memory requirement of O(N2) for storing the dense or even full matrices that arise from application of numerical methods and how to manage the significant computational work count of O(N3) per time step, where N is the number of spatial grid points. In this paper, a fast iterative finite difference method is developed, which has a memory requirement of O(N) and a computational cost of O(N logN) per iteration. Finally, some numerical results are shown to verify the accuracy and efficiency of the new method.

Description: Extending Eilenberg–Mac Lane’s cohomology of abelian groups, a cohomology theory is introduced for commutative monoids. The cohomology groups in this theory agree with the pre-existing ones by Grillet in low dimensions, but they differ beyond dimension two. A natural interpretation is given for the three-cohomology classes in terms of braided monoidal groupoids.

Description: The Aharonov-Vaidman gauge additively transforms the mean energy of a quantum mechanical system into a weak valued system energy. In this paper, the equation of motion of this weak valued energy is used to provide a mathematical statement of an extended 1st Law of Thermodynamics that is applicable to the mean energy of a closed quantum system when the mean energy is expressed in the Aharonov-Vaidman gauge, i.e., when the system’s energy is weak valued. This is achieved by identifying the generalized heat and work exchange terms that appear in the equation of motion for weak valued energy. The complex valued contributions of the additive gauge term to these generalized exchange terms are discussed and this extended 1st Law is shown to subsume the usual 1st Law that is applicable for the mean energy of a closed quantum system. It is found that the gauge transformation introduces an additional energy uncertainty exchange term that—while it is neither a heat nor a work exchange term—is necessary for the conservation of weak valued energy. A spin-1/2 particle in a uniform magnetic field is used to illustrate aspects of the theory. It is demonstrated for this case that the extended 1st Law implies the existence of a gauge potential ω and that it generates a non-vanishing gauge field F. It is also shown for this case that the energy uncertainty exchange accumulated during the evolution of the system along a closed evolutionary cycle C in an associated parameter space is a geometric phase. This phase is equal to both the path integral of ω along C and the integral of the flux of F through the area enclosed by C.

Description: The fractional order differential equation \(u'(t)=Au(t)+\gamma D_t^{\alpha} Au(t)+f(t), \ t>0\), \(u(0)=a\in X\) is studied, where \(A\) is an operator generating a strongly continuous one-parameter semigroup on a Banach space \(X\), \(D_t^{\alpha}\) is the Riemann–Liouville fractional derivative of order \(\alpha \in (0,1)\), \(\gamma>0\) and \(f\) is an \(X\)-valued function. Equations of this type appear in the modeling of unidirectional viscoelastic flows. Well-posedness is proven, and a subordination identity is obtained relating the solution operator of the considered problem and the \(C_{0}\)-semigroup, generated by the operator \(A\). As an example, the Rayleigh–Stokes problem for a generalized second-grade fluid is considered.

Description: This paper is a follow-up of a previous paper of the author published in Mathematics journal in 2015, which treats the so-called continuous fractional orthogonal derivative. In this paper, we treat the discrete case using the fractional orthogonal difference. The theory is illustrated with an application of a fractional differentiating filter. In particular, graphs are presented of the absolutel value of the modulus of the frequency response. These make clear that for a good insight into the behavior of a fractional differentiating filter, one has to look for the modulus of its frequency response in a log-log plot, rather than for plots in the time domain.

Description: We address the recently posed question as to whether the nonlocality of a single member of an entangled pair of spin 1 / 2 particles can be shared among multiple observers on the other wing who act sequentially and independently of each other. We first show that the optimality condition for the trade-off between information gain and disturbance in the context of weak or non-ideal measurements emerges naturally when one employs a one-parameter class of positive operator valued measures (POVMs). Using this formalism we then prove analytically that it is impossible to obtain violation of the Clauser-Horne-Shimony-Holt (CHSH) inequality by more than two Bobs in one of the two wings using unbiased input settings with an Alice in the other wing.

Description: A smooth function of the second moments of N continuous variables gives rise to an uncertainty relation if it is bounded from below. We present a method to systematically derive such bounds by generalizing an approach applied previously to a single continuous variable. New uncertainty relations are obtained for multi-partite systems that allow one to distinguish entangled from separable states. We also investigate the geometry of the “uncertainty region” in the N ( 2 N + 1 ) -dimensional space of moments. It is shown to be a convex set, and the points on its boundary are found to be in one-to-one correspondence with pure Gaussian states of minimal uncertainty. For a single degree of freedom, the boundary can be visualized as one sheet of a “Lorentz-invariant” hyperboloid in the three-dimensional space of second moments.

Description: This study deals with the control of chaotic dynamics of tumor cells, healthy host cells, and effector immune cells in a chaotic Three Dimensional Cancer Model (TDCM) by State Space Exact Linearization (SSEL) technique based on Lie algebra. A non-linear feedback control law is designed which induces a coordinate transformation thereby changing the original chaotic TDCM system into a controlled one linear system. Numerical simulation has been carried using Mathematica that witness the robustness of the technique implemented on the chosen chaotic system.

Description: In this paper, we consider the time-dependent Schrödinger equation: i ∂ ψ ( x , t ) ∂ t = 1 2 ( − Δ ) α 2 ψ ( x , t ) + V ( x ) ψ ( x , t ) , x ∈ R , t > 0 with the Riesz space-fractional derivative of order 0 〈 α ≤ 2 in the presence of the linear potential V ( x ) = β x . The wave function to the one-dimensional Schrödinger equation in momentum space is given in closed form allowing the determination of other measurable quantities such as the mean square displacement. Analytical solutions are derived for the relevant case of α = 1 , which are useable for studying the propagation of wave packets that undergo spreading and splitting. We furthermore address the two-dimensional space-fractional Schrödinger equation under consideration of the potential V ( ρ ) = F · ρ including the free particle case. The derived equations are illustrated in different ways and verified by comparisons with a recently proposed numerical approach.

Description: The rate of change of any function versus its independent variables was defined as a derivative. The fundamentals of the derivative concept were constructed by Newton and l’Hôpital. The followers of Newton and l’Hôpital defined fractional order derivative concepts. We express the derivative defined by Newton and l’Hôpital as an ordinary derivative, and there are also fractional order derivatives. So, the derivative concept was handled in this paper, and a new definition for derivative based on indefinite limit and l’Hôpital’s rule was expressed. This new approach illustrated that a derivative operator may be non-linear. Based on this idea, the asymptotic behaviors of functions were analyzed and it was observed that the rates of changes of any function attain maximum value at inflection points in the positive direction and minimum value (negative) at inflection points in the negative direction. This case brought out the fact that the derivative operator does not have to be linear; it may be non-linear. Another important result of this paper is the relationships between complex numbers and derivative concepts, since both concepts have directions and magnitudes.

Description: In the paper, the authors find three new identities of the Catalan-Qi numbers and provide alternative proofs of two identities of the Catalan numbers. The three identities of the Catalan-Qi numbers generalize three identities of the Catalan numbers.

Description: We focus on inverse preconditioners based on minimizing F ( X ) = 1 − cos ( X A , I ) , where X A is the preconditioned matrix and A is symmetric and positive definite. We present and analyze gradient-type methods to minimize F ( X ) on a suitable compact set. For this, we use the geometrical properties of the non-polyhedral cone of symmetric and positive definite matrices, and also the special properties of F ( X ) on the feasible set. Preliminary and encouraging numerical results are also presented in which dense and sparse approximations are included.

Description: Coherence of a quantum state intrinsically depends on the choice of the reference basis. A natural question to ask is the following: if we use two or more incompatible reference bases, can there be some trade-off relation between the coherence measures in different reference bases? We show that the quantum coherence of a state as quantified by the relative entropy of coherence in two or more noncommuting reference bases respects uncertainty like relations for a given state of single and bipartite quantum systems. In the case of bipartite systems, we find that the presence of entanglement may tighten the above relation. Further, we find an upper bound on the sum of the relative entropies of coherence of bipartite quantum states in two noncommuting reference bases. Moreover, we provide an upper bound on the absolute value of the difference of the relative entropies of coherence calculated with respect to two incompatible bases.

Description: Although versions of Poisson’s Summation Formula (PSF) have already been studied extensively, there seems to be no theorem that relates discretization to periodization and periodization to discretization in a simple manner. In this study, we show that two complementary formulas, both closely related to the classical Poisson Summation Formula, are needed to form a reciprocal Discretization-Periodization Theorem on generalized functions. We define discretization and periodization on generalized functions and show that the Fourier transform of periodic functions are discrete functions and, vice versa, the Fourier transform of discrete functions are periodic functions.

Description: In this communication we take up the age-old problem of the possibility to incorporate quantum jumps. Unusually, we investigate quantum jumps in an extended quantum setting, but one of rigorous mathematical significance. The general background for this formulation originates in the Balslev-Combes theorem for dilatation analytic Hamiltonians and associated complex symmetric representations. The actual jump is mapped into a Jordan block of order two and a detailed derivation is discussed for the case of the emission of a photon by an atom. The result can be easily reassigned to analogous cases as well as generalized to Segrè characteristics of arbitrary order.

Description: The purpose of this paper is to present a consistent mathematical framework that shows how the EPR (Einstein. Podolsky, Rosen) phenomenon fits into our view of space time. To resolve the differences between the Hilbert space structure of quantum theory and the manifold structure of classical physics, the manifold is taken as a partial representation of the Hilbert space. It is the partial nature of the representation that allows for action at a distance and the failure of the manifold picture.

Description: For many scientific calculations, particularly those involving empirical data, IEEE 32-bit floating-point arithmetic produces results of sufficient accuracy, while for other applications IEEE 64-bit floating-point is more appropriate. But for some very demanding applications, even higher levels of precision are often required. This article discusses the challenge of high-precision computation, in the context of mathematical physics, and highlights what facilities are required to support future computation, in light of emerging developments in computer architecture.

Description: This is a survey paper illuminating the distinguished role of the Mittag-Leffler function and its generalizations in fractional analysis and fractional modeling. The content of the paper is connected to the recently published monograph by Rudolf Gorenflo, Anatoly Kilbas, Francesco Mainardi and Sergei Rogosin.

Description: The connection problem for orthogonal polynomials is, given a polynomial expressed in the basis of one set of orthogonal polynomials, computing the coefficients with respect to a different set of orthogonal polynomials. Expansions in terms of orthogonal polynomials are very common in many applications. While the connection problem may be solved by directly computing the change–of–basis matrix, this approach is computationally expensive. A recent approach to solving the connection problem involves the use of the spectral connection matrix, which is a matrix whose eigenvector matrix is the desired change–of–basis matrix. In Bella and Reis (2014), it is shown that for the connection problem between any two different classical real orthogonal polynomials of the Hermite, Laguerre, and Gegenbauer families, the related spectral connection matrix has quasiseparable structure. This result is limited to the case where both the source and target families are one of the Hermite, Laguerre, or Gegenbauer families, which are each defined by at most a single parameter. In particular, this excludes the large and common class of Jacobi polynomials, defined by two parameters, both as a source and as a target family. In this paper, we continue the study of the spectral connection matrix for connections between real orthogonal polynomial families. In particular, for the connection problem between any two families of the Hermite, Laguerre, or Jacobi type (including Chebyshev, Legendre, and Gegenbauer), we prove that the spectral connection matrix has quasiseparable structure. In addition, our results also show the quasiseparable structure of the spectral connection matrix from the Bessel polynomials, which are orthogonal on the unit circle, to any of the Hermite, Laguerre, and Jacobi types. Additionally, the generators of the spectral connection matrix are provided explicitly for each of these cases, allowing a fast algorithm to be implemented following that in Bella and Reis (2014).

Description: In this paper, we consider generalized space-time fractional cable equation in presence of external source. By using the Fourier-Laplace transform we obtain the Green function in terms of infinite series in H-functions. The fractional moments of the fundamental solution are derived and their asymptotic behavior in the short and long time limit is analyzed. Some previously obtained results are compared with those presented in this paper. By using the Bernstein characterization theorem we find the conditions under which the even moments are non-negative.

Description: In this paper, we have presented a family of fourth order iterative methods, which uses weight functions. This new family requires three function evaluations to get fourth order accuracy. By the Kung–Traub hypothesis this family of methods is optimal and has an efficiency index of 1.587. Furthermore, we have extended one of the methods to sixth and twelfth order methods whose efficiency indices are 1.565 and 1.644, respectively. Some numerical examples are tested to demonstrate the performance of the proposed methods, which verifies the theoretical results. Further, we discuss the extraneous fixed points and basins of attraction for a few existing methods, such as Newton’s method and the proposed family of fourth order methods. An application problem arising from Planck’s radiation law has been verified using our methods.

Description: In this paper, sufficient conditions are given to investigate the existence of mild solutions on a semi-infinite interval for first order semi linear impulsive neutral functional differential evolution inclusions with infinite delay using a recently developed nonlinear alternative for contractive multivalued maps in Frechet spaces due to Frigon combined with semigroup theory. The existence result has been proved without assumption of compactness of the semigroup. We introduced a new phase space for impulsive system with infinite delay and claim that the phase space considered by different authors are not correct.

Description: We consider two principal bundles of embeddings with total space E m b ( M , N ) , with structure groups D i f f ( M ) and D i f f + ( M ) , where D i f f + ( M ) is the groups of orientation preserving diffeomorphisms. The aim of this paper is to describe the structure group of the tangent bundle of the two base manifolds: B ( M , N ) = E m b ( M , N ) / D i f f ( M ) and B + ( M , N ) = E m b ( M , N ) / D i f f + ( M ) from the various properties described, an adequate group seems to be a group of Fourier integral operators, which is carefully studied. It is the main goal of this paper to analyze this group, which is a central extension of a group of diffeomorphisms by a group of pseudo-differential operators which is slightly different from the one developped in the mathematical litterature e.g. by H. Omori and by T. Ratiu. We show that these groups are regular, and develop the necessary properties for applications to the geometry of B ( M , N ) . A case of particular interest is M = S 1 , where connected components of B + ( S 1 , N ) are deeply linked with homotopy classes of oriented knots. In this example, the structure group of the tangent space T B + ( S 1 , N ) is a subgroup of some group G L r e s , following the classical notations of (Pressley, A., 1988). These constructions suggest some approaches in the spirit of one of our previous works on Chern-Weil theory that could lead to knot invariants through a theory of Chern-Weil forms.

Description: We propose a stochastic model to develop a partial integro-differential equation (PIDE) for pricing and pricing expression for fixed type single Barrier options based on the Itô-Lévy calculus with the help of Mellin transform. The stock price is driven by a class of infinite activity Lévy processes leading to the market inherently incomplete, and dynamic hedging is no longer risk free. We first develop a PIDE for fixed type Barrier options, and apply the Mellin transform to derive a pricing expression. Our main contribution is to develop a PIDE with its closed form pricing expression for the contract. The procedure is easy to implement for all class of Lévy processes numerically. Finally, the algorithm for computing numerically is presented with results for a set of Lévy processes.

Description: The representation of the cost of a therapy is a key element in the formulation of the optimal control problem for the treatment of infectious diseases. The cost of the treatment is usually modeled by a function of the price and quantity of drugs administered; this function should be the cost as subjectively perceived by the decision-maker. Nevertheless, in literature, the choice of the cost function is often simply done to make the problem more tractable. A specific problem is also given by very expensive therapies in the presence of a very high number of patients to be treated. Firstly, we investigate the optimal treatment of infectious diseases in the simplest case of a two-class population (susceptible and infectious people) and compare the results coming from five different shapes of cost functions. Finally, a model for the treatment of the HCV virus using the blowing-up cost function is investigated. Some numerical simulations are also given.

Description: In this manuscript, we define generalized Kincses-Totik type contractions within the context of metric space and consider the existence of a fixed point for such operators. Kincses-Totik type contractions extends the renowned Banach contraction mapping principle in different aspects. First, the continuity condition for the considered mapping is not required. Second, the contraction inequality contains all possible geometrical distances. Third, the contraction inequality is formulated for some iteration of the considered operator, instead of the dealing with the given operator. Fourth and last, the iteration number may vary for each point in the domain of the operator for which we look for a fixed point. Consequently, the proved results generalize the acknowledged results in the field, including the well-known theorems of Seghal, Kincses-Totik, and Banach-Caccioppoli. We present two illustrative examples to support our results. As an application, we consider an Ulam-stability of one of our results.

Description: We propose a derivative free one-point method with memory of order 1.84 for solving nonlinear equations. The formula requires only one function evaluation and, therefore, the efficiency index is also 1.84. The methodology is carried out by approximating the derivative in Newton’s iteration using a rational linear function. Unlike the existing methods of a similar nature, the scheme of the new method is easy to remember and can also be implemented for systems of nonlinear equations. The applicability of the method is demonstrated on some practical as well as academic problems of a scalar and multi-dimensional nature. In addition, to check the efficacy of the new technique, a comparison of its performance with the existing techniques of the same order is also provided.

Description: In this short note we give an elementary description of the linear part of the minimal free resolution of a Stanley-Reisner ring of a simplicial complex Δ . Indeed, the differentials in the linear part are simply a compilation of restriction maps in the simplicial cohomology of induced subcomplexes of Δ . Along the way, we also show that if a monomial ideal has at least one generator of degree 2, then the linear strand of its minimal free resolution can be written using only ± 1 coefficients.

Description: In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower bounds to help prune the search space. One is based on the degree of vertices, and the other is based on MaxSAT reasoning. The experiment confirms that our algorithm is faster than previous exact algorithms and can find better results than heuristic algorithms.

Description: We present fixed points results of multivalued Prešić type k-step iterative mappings satisfying generalized weakly contraction conditions in metric spaces. An example is presented to support the main result proved herein. The stability of fixed point sets of multivalued Prešić type weakly contractive mappings are also established. Global attractivity result for the class of matrix difference equations is derived as application of the result presented herein. These results generalize and extend various comparable results in the existing literature.

Description: In the year 2004, Chang and Teng investigated an inventory model for deteriorating items in which the supplier not only provides a cash discount, but also allows a permissible delay in payments. The main purpose of the present investigation is three-fold, as follows. First, it is found herein that Theorem 1 of Chang and Teng (2004) has notable shortcomings in terms of their determination of the optimal solution of the annual total relevant cost Z ( T ) by adopting the Taylor-series approximation method. Theorem 1 in this paper does not make use of the Taylor-series approximation method in order to overcome the shortcomings in Chang and Teng (2004) and alternatively derives all the optimal solutions of the annual total relevant cost Z ( T ) . Secondly, this paper systematically revisits the annual total relevant cost Z ( T ) in Chang and Teng (2004) and presents in detail the mathematically correct ways for the derivations of Z ( T ) . Thirdly, this paper not only shows that Theorem 1 of Chang and Teng (2004) is not necessarily true for finding the optimal solution of the annual total relevant cost Z ( T ) , but it also demonstrates how Theorem 1 in this paper can locate all of the optimal solutions of Z ( T ) . The mathematical analytic investigation presented in this paper is believed to be useful for correct managerial considerations and managerial decisions.

Description: This paper characterizes the retailer’s loss aversion by introducing a loss aversion coefficient and proposes a new loss aversion utility function for the retailer. To hedge against the risk arising from the uncertain market demand, we use the Conditional Value-at-Risk (CVaR) measure to quantify the potential risks and obtain the optimal order quantity for the retailer to maximize the CVaR objective of loss aversion utility. It is shown that that the optimal order quantity for a retailer to maximize the expected loss aversion utility is smaller than expected profit maximizing (EPM) order quantity in the classical newsvendor model, which can help to explain decision bias in the newsvendor model. This study shows that the optimal order quantity with the CVaR objective can decrease in retail price under certain conditions, which has never occurred in the newsvendor literature. With the optimal order quantity under the CVaR objective, it is proved that the retailer’s expected loss aversion utility is decreasing in the confidence level. This confirms the fact that high return means high risk, while low risk comes with low return. Based on the results, several management insights are suggested for the loss-averse newsvendor model.

Description: As an extension of the fuzzy set, the hesitant fuzzy set is used to effectively solve the hesitation of decision-makers in group decision-making and to rigorously express the decision information. In this paper, we first introduce some new hesitant fuzzy Hamacher power-aggregation operators for hesitant fuzzy information based on Hamacher t-norm and t-conorm. Some desirable properties of these operators is shown, and the interrelationships between them are given. Furthermore, the relationships between the proposed aggregation operators and the existing hesitant fuzzy power-aggregation operators are discussed. Based on the proposed aggregation operators, we develop a new approach for multiple-attribute decision-making problems. Finally, a practical example is provided to illustrate the effectiveness of the developed approach, and the advantages of our approach are analyzed by comparison with other existing approaches.

Description: In this work, we consider the general class of difference equations (covered many equations that have been studied by other authors or that have never been studied before), as a means of establishing general theorems, for the asymptotic behavior of its solutions. Namely, we state new necessary and sufficient conditions for local asymptotic stability of these equations. In addition, we study the periodic solution with period two and three. Our results essentially extend and improve the earlier ones.

Description: This study considers an asset-liability optimization model based on constraint robustness with the chance constraint of capital to risk assets ratio in a safety-first framework under the condition that only moment information is known. This paper aims to extend the proposed single-objective capital to risk assets ratio chance constrained optimization model in the literature by considering the multi-objective constraint robustness approach in a modified safety-first framework. To solve the optimization model, we develop a deterministic convex counterpart of the capital to risk assets ratio robust probability constraint. In a consolidated risk measure of variance and safety-first framework, the proposed distributionally-robust capital to risk asset ratio chance-constrained optimization model guarantees banks will meet the capital requirements of Basel III with a likelihood of 95% irrespective of changes in the future market value of assets. Even under the worst-case scenario, i.e., when loans default, our proposed capital to risk asset ratio chance-constrained optimization model meets the minimum total requirements of Basel III. The practical implications of the findings of this study are that the model, when applied, will provide safety against extreme losses while maximizing returns and minimizing risk, which is prudent in this post-financial crisis regime.

Description: In this paper, a mathematical model based on the one-parameter Mittag-Leffler function is proposed to be used for the first time to describe the relation between the unemployment rate and the inflation rate, also known as the Phillips curve. The Phillips curve is in the literature often represented by an exponential-like shape. On the other hand, Phillips in his fundamental paper used a power function in the model definition. Considering that the ordinary as well as generalised Mittag-Leffler function behave between a purely exponential function and a power function it is natural to implement it in the definition of the model used to describe the relation between the data representing the Phillips curve. For the modelling purposes the data of two different European economies, France and Switzerland, were used and an “out-of-sample” forecast was done to compare the performance of the Mittag-Leffler model to the performance of the power-type and exponential-type model. The results demonstrate that the ability of the Mittag-Leffler function to fit data that manifest signs of stretched exponentials, oscillations or even damped oscillations can be of use when describing economic relations and phenomenons, such as the Phillips curve.

Description: By using the Kolmogorov-Arnold-Moser (KAM) theory, we investigate the stability of two elliptic equilibrium points (zero equilibrium and negative equilibrium) of the difference equation t n + 1 = α t n + β t n 2 − t n − 1 , n = 0 , 1 , 2 , … , where are t − 1 , t 0 , α ∈ R , α ≠ 0 , β 〉 0 . By using the symmetries we find the periodic solutions with some periods. Finally, some numerical examples are given to verify our theoretical results.

Description: The mean-shift method is a convenient mode-seeking method. Using a principle of the sample mean over an analysis window, or kernel, in a data space where samples are distributed with bias toward the densest direction of sample from the kernel center, the mean-shift method is an attempt to seek the densest point of samples, or the sample mode, iteratively. A smaller kernel leads to convergence to a local mode that appears because of statistical fluctuation. A larger kernel leads to estimation of a biased mode affected by other clusters, abnormal values, or outliers if they exist other than in the major cluster. Therefore, optimal selection of the kernel size, which is designated as the bandwidth in many reports of the literature, represents an important problem. As described herein, assuming that the major cluster follows a Gaussian probability density distribution, and, assuming that the outliers do not affect the sample mode of the major cluster, and, by adopting a Gaussian kernel, we propose a new mean-shift by which both the mean vector and covariance matrix of the major cluster are estimated in each iteration. Subsequently, the kernel size and shape are updated adaptively. Numerical experiments indicate that the mean vector, covariance matrix, and the number of samples of the major cluster can be estimated stably. Because the kernel shape can be adjusted not only to an isotropic shape but also to an anisotropic shape according to the sample distribution, the proposed method has higher estimation precision than the general mean-shift.

Description: In this paper, we establish generalized Suzuki-simulation-type contractive mapping and prove fixed point theorems on non-Archimedean quasi modular metric spaces. As an application, we acquire graphic-type results.

Description: In this study we introduce several new Ostrowski-type inequalities for both left and right sided fractional integrals of a function g with respect to another function ψ . Our results generalized the ones presented previously by Farid. Furthermore, two illustrative examples are presented to support our results.

Description: Brazil is an important player when it comes to biofuel and agricultural production. The knowledge of the price relationship between these markets has increasing importance. This paper adopts several tools, namely the Bai–Perron test of breakpoints, the Johansen cointegration test and the vector error correction model exploited by the orthogonal impulse response and the forecast error variance decomposition, for investigating the price transmission among the ethanol and the main Brazil’s agricultural commodities (sugar, cotton, arabica coffee, robusta coffee, live cattle, corn and soybean). The data series cover the period from January 2011 up to December 2018. The results suggest a stronger price transmission from the ethanol commodity to the agricultural commodities, rather than the opposite situation.

Description: We formulate a new class of fractional difference and sum operators, study their fundamental properties, and find their discrete Laplace transforms. The method depends on iterating the fractional sum operators corresponding to fractional differences with discrete Mittag–Leffler kernels. The iteration process depends on the binomial theorem. We note in particular the fact that the iterated fractional sums have a certain semigroup property, and hence, the new introduced iterated fractional difference-sum operators have this semigroup property as well.

Description: In this article, we make a detailed study of some mathematical aspects associated with a generalized Lévy process using fractional diffusion equation with Mittag–Leffler kernel in the context of Atangana–Baleanu operator. The Lévy process has several applications in science, with a particular emphasis on statistical physics and biological systems. Using the continuous time random walk, we constructed a fractional diffusion equation that includes two fractional operators, the Riesz operator to Laplacian term and the Atangana–Baleanu in time derivative, i.e., a A B D t α ρ ( x , t ) = K α , μ ∂ x μ ρ ( x , t ) . We present the exact solution to model and discuss how the Mittag–Leffler kernel brings a new point of view to Lévy process. Moreover, we discuss a series of scenarios where the present model can be useful in the description of real systems.

Description: This research paper proposes a derivative-free method for solving systems of nonlinear equations with closed and convex constraints, where the functions under consideration are continuous and monotone. Given an initial iterate, the process first generates a specific direction and then employs a line search strategy along the direction to calculate a new iterate. If the new iterate solves the problem, the process will stop. Otherwise, the projection of the new iterate onto the closed convex set (constraint set) determines the next iterate. In addition, the direction satisfies the sufficient descent condition and the global convergence of the method is established under suitable assumptions. Finally, some numerical experiments were presented to show the performance of the proposed method in solving nonlinear equations and its application in image recovery problems.

Description: The operation of many real-world systems, e.g., servers of data centers, is accompanied by the heating of a server. Correspondingly, certain cooling mechanisms are used. If the server becomes overheated, it interrupts processing of customers and needs to be cooled. A customer is lost when its service is interrupted. To prevent overheating and reduce the customer loss probability, we suggest temporal termination of service of new customers when the temperature of the server reaches the predefined threshold value. Service is resumed after the temperature drops below another threshold value. The problem of optimal choice of the thresholds (with respect to the chosen economical criterion) is numerically solved under quite general assumptions about the parameters of the system (Markovian arrival process, phase-type distribution of service time, and accounting for customers impatience). Numerical examples are presented.

Description: In this paper, we introduce the concept of a n 0 -order weighted pseudo Δ n 0 δ -almost automorphic function under the matched space for time scales and we present some properties. The results are valid for q-difference dynamic equations among others. Moreover, we obtain some sufficient conditions for the existence of weighted pseudo Δ n 0 δ -almost automorphic mild solutions to a class of semilinear dynamic equations under the matched space. Finally, we end the paper with a further discussion and some open problems of this topic.

Description: In this paper, based on the very recent work by Nandal et al. (Nandal, A.; Chugh, R.; Postolache, M. Iteration process for fixed point problems and zeros of maximal monotone operators. Symmetry 2019, 11, 655.), we propose a new generalized viscosity implicit rule for finding a common element of the fixed point sets of a finite family of nonexpansive mappings and the sets of zeros of maximal monotone operators. Utilizing the main result, we first propose and investigate a new general system of generalized equilibrium problems, which includes several equilibrium and variational inequality problems as special cases, and then we derive an implicit iterative method to solve constrained multiple-set split convex feasibility problem. We further combine forward-backward splitting method and generalized viscosity implicit rule for solving monotone inclusion problem. Moreover, we apply the main result to solve convex minimization problem.

Description: The automatic identification of rock type in the field would aid geological surveying, education, and automatic mapping. Deep learning is receiving significant research attention for pattern recognition and machine learning. Its application here has effectively identified rock types from images captured in the field. This paper proposes an accurate approach for identifying rock types in the field based on image analysis using deep convolutional neural networks. The proposed approach can identify six common rock types with an overall classification accuracy of 97.96%, thus outperforming other established deep-learning models and a linear model. The results show that the proposed approach based on deep learning represents an improvement in intelligent rock-type identification and solves several difficulties facing the automated identification of rock types in the field.

Description: In this paper, we establish a new q-integral identity, the result is then used to derive two q-integral inequalities of Simpson-type involving strongly preinvex functions. Some special cases of the obtained results are also considered, it is shown that several new and previously known results can be derived via generalized strongly preinvex functions and quantum integrals.

Description: The aim of this paper is to introduce a modified viscosity iterative method to approximate a solution of the split variational inclusion problem and fixed point problem for a uniformly continuous multivalued total asymptotically strictly pseudocontractive mapping in C A T ( 0 ) spaces. A strong convergence theorem for the above problem is established and several important known results are deduced as corollaries to it. Furthermore, we solve a split Hammerstein integral inclusion problem and fixed point problem as an application to validate our result. It seems that our main result in the split variational inclusion problem is new in the setting of C A T ( 0 ) spaces.

Description: We give some polynomial sequence relations that are generalizations of the Sury-type identities. We provide two proofs, one based on an elementary identity and the other using the method of generating functions.

Description: The Van der Pol oscillator is investigated by the parameter control method. This method only needs to control one parameter of the Van der Pol oscillator by a simple periodic function; then, the Van der Pol oscillator can behave chaotically from the stable limit cycle. Based on the new Van der Pol oscillator with variable parameter (VdPVP), some dynamical characteristics are discussed by numerical simulations, such as the Lyapunov exponents and bifurcation diagrams. The numerical results show that there exists a positive Lyapunov exponent in the VdPVP. Therefore, an encryption algorithm is designed by the pseudo-random sequences generated from the VdPVP. This simple algorithm consists of chaos scrambling and chaos XOR (exclusive-or) operation, and the statistical analyses show that it has good security and encryption effectiveness. Finally, the feasibility and validity are verified by simulation experiments of image encryption.

Description: Radial basis function-based quasi-interpolation performs efficiently in high-dimensional approximation and its applications, which can attain the approximant and its derivatives directly without solving any large-scale linear system. In this paper, the bivariate multi-quadrics (MQ) quasi-interpolation is used to simulate two-dimensional (2-D) Burgers’ equation. Specifically, the spatial derivatives are approximated by using the quasi-interpolation, and the time derivatives are approximated by forward finite difference method. One advantage of the proposed scheme is its simplicity and easy implementation. More importantly, the proposed scheme opens the gate to meshless adaptive moving knots methods for the high-dimensional partial differential equations (PDEs) with shock or soliton waves. The scheme is also applicable to other non-linear high-dimensional PDEs. Two numerical examples of Burgers’ equation (shock wave equation) and one example of the Sine–Gordon equation (soliton wave equation) are presented to verify the high accuracy and efficiency of this method.

Description: Context-aware video recommender systems (CAVRS) seek to improve recommendation performance by incorporating contextual features along with the conventional user-item ratings used by video recommender systems. In addition, the selection of influential and relevant contexts has a significant effect on the performance of CAVRS. However, it is not guaranteed that, under the same contextual scenario, all the items are evaluated by users for providing dense contextual ratings. This problem cause contextual sparsity in CAVRS because the influence of each contextual factor in traditional CAVRS assumes the weights of contexts homogeneously for each of the recommendations. Hence, the selection of influencing contexts with minimal conflicts is identified as a potential research challenge. This study aims at resolving the contextual sparsity problem to leverage user interactions at varying contexts with an item in CAVRS. This problem may be investigated by considering a formal approximation of contextual attributes. For the purpose of improving the accuracy of recommendation process, we have proposed a novel contextual information selection process using Soft-Rough Sets. The proposed model will select a minimal set of influencing contexts using a weights assign process by Soft-Rough sets. Moreover, the proposed algorithm has been extensively evaluated using “LDOS-CoMoDa” dataset, and the outcome signifies the accuracy of our approach in handling contextual sparsity by exploiting relevant contextual factors. The proposed model outperforms existing solutions by identifying relevant contexts efficiently based on certainty, strength, and relevancy for effective recommendations.

Description: If a differentiable function f : [ a , b ] → R and a point η ∈ [ a , b ] satisfy f ( η ) − f ( a ) = f ′ ( η ) ( η − a ) , then the point η is called a Flett’s mean value point of f in [ a , b ] . The concept of Flett’s mean value points can be generalized to the 2-dimensional Flett’s mean value points as follows: For the different points r ^ and s ^ of R × R , let L be the line segment joining r ^ and s ^ . If a partially differentiable function f : R × R → R and an intermediate point ω ^ ∈ L satisfy f ( ω ^ ) − f ( r ^ ) = ω ^ − r ^ , f ′ ( ω ^ ) , then the point ω ^ is called a 2-dimensional Flett’s mean value point of f in L. In this paper, we will prove the Hyers–Ulam stability of 2-dimensional Flett’s mean value points.

Description: The goal of this research is to extend and investigate an improved approach for calculating the weighted Moore–Penrose (WMP) inverses of singular or rectangular matrices. The scheme is constructed based on a hyperpower method of order ten. It is shown that the improved scheme converges with this rate using only six matrix products per cycle. Several tests are conducted to reveal the applicability and efficiency of the discussed method, in contrast with its well-known competitors.

Description: We consider a differential game of fisheries in a fan-like control structure of the type “supervisor—several agents”. The dynamics of the controlled system is described by a non-linear differential equation model which is identified on the Azov Sea data. An averaging by two spatial coordinates is conducted. Different information structures of the game are generated by the control methods of compulsion (supervisor restricts the feasible strategies of agents) and impulsion (she exerts an impact to their payoff functionals). Both Stackerlberg and inverse Stackelberg games are considered. For the numerical investigation we use a discretization of the initial model and the method of qualitatively representative scenarios in simulation modeling.

Description: This paper proposes a model of the dynamics of credit contagion through non-performing loans on financial networks. Credit risk contagion is modeled in the context of the classical SIS (Susceptibles-Infected-Susceptibles) epidemic processes on networks but with a fundamental novelty. In fact, we assume the presence of two different classes of infected agents, and then we differentiate the dynamics of assets subject to idiosyncratic risk from those affected by systemic risk by adopting a SIIS (Susceptible-Infected1-Infected2-Susceptible) model. In the recent literature in this field, the effect of systemic credit risk on the performance of the financial network is a hot topic. We perform numerical simulations intended to explore the roles played by two different network structures on the long-term behavior of assets affected by systemic risk in order to analyze the effect of the topology of the underlying network structure on the spreading of systemic risk on the structure. Random graphs, i.e., the Erdös–Rényi model, are considered “benchmark” network structures while core-periphery structures are often indicated in the literature as idealized structures, although they are able to capture interesting, specific features of real-world financial networks. Moreover, as a matter of comparison, we also perform numerical experiments on small-world networks.

Description: The Firoozbakht, Nicholson, and Farhadian conjectures can be phrased in terms of increasingly powerful conjectured bounds on the prime gaps g n : = p n + 1 - p n . While a general proof of any of these conjectures is far out of reach, I shall show that all three of these conjectures are unconditionally and explicitly verified for all primes below the as yet unknown location of the 81st maximal prime gap, certainly for all primes p 〈 2 64 . For the Firoozbakht conjecture itself this is a rather minor improvement on currently known results, but for the somewhat stronger Nicholson and Farhadian conjectures this may be considerably more interesting. Sequences: A005250 A002386 A005669 A000101 A107578 A246777 A246776.

Description: In the present paper, we study geodesic mappings of special pseudo-Riemannian manifolds called V n ( K ) -spaces. We prove that the set of solutions of the system of equations of geodesic mappings on V n ( K ) -spaces forms a special Jordan algebra and the set of solutions generated by concircular fields is an ideal of this algebra. We show that pseudo-Riemannian manifolds admitting a concircular field of the basic type form the class of manifolds closed with respect to the geodesic mappings.

Description: In this article, we propose a modified self-adaptive conjugate gradient algorithm for handling nonlinear monotone equations with the constraints being convex. Under some nice conditions, the global convergence of the method was established. Numerical examples reported show that the method is promising and efficient for solving monotone nonlinear equations. In addition, we applied the proposed algorithm to solve sparse signal reconstruction problems.

Description: In this manuscript, we propose a solution for Volterra type fractional integral equations by using a hybrid type contraction that unifies both nonlinear and linear type inequalities in the context of metric spaces. Besides this main goal, we also aim to combine and merge several existing fixed point theorems that were formulated by linear and nonlinear contractions.

Description: The present paper investigates the numerical solution of an imprecisely defined nonlinear coupled time-fractional dynamical model of marriage (FDMM). Uncertainties are assumed to exist in the dynamical system parameters, as well as in the initial conditions that are formulated by triangular normalized fuzzy sets. The corresponding fractional dynamical system has first been converted to an interval-based fuzzy nonlinear coupled system with the help of a single-parametric gamma-cut form. Further, the double-parametric form (DPF) of fuzzy numbers has been used to handle the uncertainty. The fractional reduced differential transform method (FRDTM) has been applied to this transformed DPF system for obtaining the approximate solution of the FDMM. Validation of this method was ensured by comparing it with other methods taking the gamma-cut as being equal to one.

Description: In studying the Riccati transformation technique, some mathematical inequalities and comparison results, we establish new oscillation criteria for a non-linear fractional difference equation with damping term. Preliminary details including notations, definitions and essential lemmas on discrete fractional calculus are furnished before proceeding to the main results. The consistency of the proposed results is demonstrated by presenting some numerical examples. We end the paper with a concluding remark.

Description: The aim of this paper was to propose a systematic study of a ( 1 + 1 ) -dimensional higher order nonlinear Schrödinger equation, arising in two different contexts regarding the biological science and the nonlinear optics. We performed a Lie symmetry analysis and here present exact solutions of the equation.

Description: This study focuses on the stochastic differential calculus of Itô, as an effective tool for the analysis of noise in forest growth and yield modeling. Idea of modeling state (tree size) variable in terms of univariate stochastic differential equation is exposed to a multivariate stochastic differential equation. The new developed multivariate probability density function and its marginal univariate, bivariate and trivariate distributions, and conditional univariate, bivariate and trivariate probability density functions can be applied for the modeling of tree size variables and various stand attributes such as the mean diameter, height, crown base height, crown width, volume, basal area, slenderness ratio, increments, and much more. This study introduces generalized multivariate interaction information measures based on the differential entropy to capture multivariate dependencies between state variables. The present study experimentally confirms the effectiveness of using multivariate interaction information measures to reconstruct multivariate relationships of state variables using measurements obtained from a real-world data set.

Description: We have introduced the new notions of R-weakly graph preserving and R-weakly α -admissible pair of multivalued mappings which includes the class of graph preserving mappings, weak graph preserving mappings as well as α -admissible mappings of type S, α * -admissible mappings of type S and α * - orbital admissible mappings of type S respectively. Some generalized contraction and rational contraction classes are also introduced for a pair of multivalued mappings and common fixed point theorems are proved in a b-metric space endowed with a graph. We have also applied our results to obtain common fixed point theorems for R-weakly α -admissible pair of multivalued mappings in a b-metric space which are the proper extension and generalization of many known results. Proper examples are provided in support of our results. Our main results and its consequences improve, generalize and extend many known fixed point results existing in literature.

Description: In this paper, new refinements and improvements of Jordan’s and Kober’s inequalities are presented. We give new polynomial bounds for the s i n c ( x ) and cos ( x ) functions based on the interpolation and approximation method. The results show that our bounds are tighter than the previous methods.

Description: We first shortly review, in part throwing a new light on, basics of ball numbers for balls having a positively homogeneous Minkowski functional and turn over then to a new particular class of ball numbers of balls having a Minkowski functional being homogeneous with respect to multiplication with a specific diagonal matrix. Applications to crystal breeding, temperature expansion and normalizing density generating functions in big data analysis are indicated and a challenging problem from the inhomogeneity program is stated.

Description: In this study, we systematically investigate a road-rail intermodal routing problem the optimization of which is oriented on the customer demands on transportation economy, timeliness and reliability. The road-rail intermodal transportation system is modelled as a hub-and-spoke network that contains time-flexible container truck services and scheduled container train services. The transportation timeliness is optimized by using fuzzy soft time windows associated with the service level of the transportation. Reliability is enhanced by considering multiple sources of time uncertainty, including road travel time and loading/unloading time. Such uncertainty is modelled by using fuzzy set theory. Triangular fuzzy numbers are adopted to represent the uncertain time. Under the above consideration, we first establish a fuzzy mixed integer nonlinear programming model with a weighted objective that includes minimizing the costs and maximizing the service level for accomplishing transportation orders. Then we use the fuzzy expected value model and fuzzy chance-constrained programming separately to realize the defuzzification of the fuzzy objective and use fuzzy chance-constrained programming to deal with the fuzzy constraint. After defuzzification and linearization, an equivalent mixed integer linear programming (MILP) model is generated to enable the problem to be solved by mathematical programming software. Finally, a numerical case modified from our previous study is presented to demonstrate the feasibility of the proposed fuzzy programming approaches. Sensitivity analysis and fuzzy simulation are comprehensively utilized to discuss the effects of the fuzzy soft time windows and time uncertainty on the routing optimization and help decision makers to better design a crisp transportation plan that can effectively make tradeoffs among economy, timeliness and reliability.

Description: We consider a class of linear inhomogeneous equations in a Banach space not solvable with respect to the fractional Caputo derivative. Such equations are called degenerate. We study the case of the existence of a resolving operators family for the respective homogeneous equation, which is an analytic in a sector. The existence of a unique solution of the Cauchy problem and of the Showalter—Sidorov problem to the inhomogeneous degenerate equation is proved. We also derive the form of the solution. The approximate controllability of infinite-dimensional control systems, described by the equations of the considered class, is researched. An approximate controllability criterion for the degenerate fractional order control system is obtained. The criterion is illustrated by the application to a system, which is described by an initial-boundary value problem for a partial differential equation, not solvable with respect to the time-fractional derivative. As a corollary of general results, an approximate controllability criterion is obtained for the degenerate fractional order control system with a finite-dimensional input.

Description: This work is concerned with the delay-dependent criteria for exponential stability analysis of neutral differential equation with a more generally interval-distributed and discrete time-varying delays. By using a novel Lyapunov–Krasovkii functional, descriptor model transformation, utilization of the Newton–Leibniz formula, and the zero equation, the criteria for exponential stability are in the form of linear matrix inequalities (LMIs). Finally, we present the effectiveness of the theoretical results in numerical examples to show less conservative conditions than the others in the literature.

Description: In this paper, we study differential equations arising from the generating function of the ( r , β ) -Bell polynomials. We give explicit identities for the ( r , β ) -Bell polynomials. Finally, we find the zeros of the ( r , β ) -Bell equations with numerical experiments.

Description: Let SR * be the class of starlike functions with real coefficients, i.e., the class of analytic functions f which satisfy the condition f ( 0 ) = 0 = f ′ ( 0 ) − 1 , Re { z f ′ ( z ) / f ( z ) } 〉 0 , for z ∈ D : = { z ∈ C : | z | 〈 1 } and a n : = f ( n ) ( 0 ) / n ! is real for all n ∈ N . In the present paper, it is obtained that the sharp inequalities − 4 / 9 ≤ H 3 , 1 ( f ) ≤ 3 / 9 hold for f ∈ SR * , where H 3 , 1 ( f ) is the third Hankel determinant of order 3 defined by H 3 , 1 ( f ) = a 3 ( a 2 a 4 − a 3 2 ) − a 4 ( a 4 − a 2 a 3 ) + a 5 ( a 3 − a 2 2 ) .

Description: We consider the extreme value problem of the minimum-maximum models for the independent and identically distributed random sequence and stationary random sequence, respectively. By invoking some probability formulas and Taylor’s expansions of the distribution functions, the limiting distributions for these two kinds of sequences are obtained. Moreover, convergence analysis is carried out for those extreme value distributions. Several numerical experiments are conducted to validate our theoretical results.

Description: In this paper, we offer a new approach of investigation and approximation of solutions of Caputo-type fractional differential equations under nonlinear boundary conditions. By using an appropriate parametrization technique, the original problem with nonlinear boundary conditions is reduced to the equivalent parametrized boundary-value problem with linear restrictions. To study the transformed problem, we construct a numerical-analytic scheme which is successful in relation to different types of two-point and multipoint linear boundary and nonlinear boundary conditions. Moreover, we give sufficient conditions of the uniform convergence of the successive approximations. Also, it is indicated that these successive approximations uniformly converge to a parametrized limit function and state the relationship of this limit function and exact solution. Finally, an example is presented to illustrate the theory.

Description: In this paper, we focus on studying the split feasibility problem (SFP) in Hilbert spaces. Based on the CQ algorithm involving the self-adaptive technique, we introduce a three-step iteration process for approximating the solution of SFP. Then, the convergence results are established under mild conditions. Numerical experiments are provided to show the efficiency in signal processing. Some comparisons to various methods are also provided in this paper.

Description: We investigate the split variational inclusion problem in Hilbert spaces. We propose efficient algorithms in which, in each iteration, the stepsize is chosen self-adaptive, and proves weak and strong convergence theorems. We provide numerical experiments to validate the theoretical results for solving the split variational inclusion problem as well as the comparison to algorithms defined by Byrne et al. and Chuang, respectively. It is shown that the proposed algorithms outrun other algorithms via numerical experiments. As applications, we apply our method to compressed sensing in signal recovery. The proposed methods have as a main advantage that the computation of the Lipschitz constants for the gradient of functions is dropped in generating the sequences.

Description: The aim of this paper is the approximation of nonlinear equations using iterative methods. We present a unified convergence analysis for some two-point type methods. This way we compare specializations of our method using not necessarily the same convergence criteria. We consider both semilocal and local analysis. In the first one, the hypotheses are imposed on the initial guess and in the second on the solution. The results can be applied for smooth and nonsmooth operators.

Description: Let K be a field and let S = K [ x 1 , ⋯ , x n ] be a polynomial ring over K. We analyze the extremal Betti numbers of special squarefree monomial ideals of S known as the t-spread strongly stable ideals, where t is an integer ≥ 1 . A characterization of the extremal Betti numbers of such a class of ideals is given. Moreover, we determine the structure of the t-spread strongly stable ideals with the maximal number of extremal Betti numbers when t = 2 .

Description: The flexible job shop scheduling problem (FJSP) is a difficult discrete combinatorial optimization problem, which has been widely studied due to its theoretical and practical significance. However, previous researchers mostly emphasized on the production efficiency criteria such as completion time, workload, flow time, etc. Recently, with considerations of sustainable development, low-carbon scheduling problems have received more and more attention. In this paper, a low-carbon FJSP model is proposed to minimize the sum of completion time cost and energy consumption cost in the workshop. A new bio-inspired metaheuristic algorithm called discrete whale optimization algorithm (DWOA) is developed to solve the problem efficiently. In the proposed DWOA, an innovative encoding mechanism is employed to represent two sub-problems: Machine assignment and job sequencing. Then, a hybrid variable neighborhood search method is adapted to generate a high quality and diverse population. According to the discrete characteristics of the problem, the modified updating approaches based on the crossover operator are applied to replace the original updating method in the exploration and exploitation phase. Simultaneously, in order to balance the ability of exploration and exploitation in the process of evolution, six adjustment curves of a are used to adjust the transition between exploration and exploitation of the algorithm. Finally, some well-known benchmark instances are tested to verify the effectiveness of the proposed algorithms for the low-carbon FJSP.

Description: This paper puts forward an innovative theory and method to calculate the canonical labelings of graphs that are distinct to N a u t y ’s. It shows the correlation between the canonical labeling of a graph and the canonical labeling of its complement graph. It regularly examines the link between computing the canonical labeling of a graph and the canonical labeling of its o p e n k- n e i g h b o r h o o d s u b g r a p h . It defines d i f f u s i o n d e g r e e s e q u e n c e s and e n t i r e d i f f u s i o n d e g r e e s e q u e n c e . For each node of a graph G, it designs a characteristic m _ N e a r e s t N o d e to improve the precision for calculating canonical labeling. Two theorems established here display how to compute the first nodes of M a x Q ( G ) . Another theorem presents how to determine the second nodes of M a x Q ( G ) . When computing C m a x ( G ) , if M a x Q ( G ) already holds the first i nodes u 1 , u 2 , ⋯ , u i , Diffusion and Nearest Node theorems provide skill on how to pick the succeeding node of M a x Q ( G ) . Further, it also establishes two theorems to determine the C m a x ( G ) of disconnected graphs. Four algorithms implemented here demonstrate how to compute M a x Q ( G ) of a graph. From the results of the software experiment, the accuracy of our algorithms is preliminarily confirmed. Our method can be employed to mine the frequent subgraph. We also conjecture that if there is a node v ∈ S ( G ) meeting conditions C m a x ( G − v ) ⩽ C m a x ( G − w ) for each w ∈ S ( G ) ∧ w ≠ v , then u 1 = v for M a x Q ( G ) .

Description: In this paper, we introduce the various types of generalized invexities, i.e., α f -invex/ α f -pseudoinvex and ( G , α f ) -bonvex/ ( G , α f ) -pseudobonvex functions. Furthermore, we construct nontrivial numerical examples of ( G , α f ) -bonvexity/ ( G , α f ) -pseudobonvexity, which is neither α f -bonvex/ α f -pseudobonvex nor α f -invex/ α f -pseudoinvex with the same η . Further, we formulate a pair of second-order non-differentiable symmetric dual models and prove the duality relations under α f -invex/ α f -pseudoinvex and ( G , α f ) -bonvex/ ( G , α f ) -pseudobonvex assumptions. Finally, we construct a nontrivial numerical example justifying the weak duality result presented in the paper.

Description: In this article, we discuss new characterizations of Cohen-Macaulay bipartite edge ideals. For arbitrary bipartite edge ideals I ( G ) , we also discuss methods to recognize regular elements on I ( G ) s for all s ≥ 1 in terms of the combinatorics of the graph G.

Description: Iterative methods were employed to obtain solutions of linear and non-linear systems of equations, solutions of differential equations, and roots of equations. In this paper, it was proved that s-iteration with error and Picard–Mann iteration with error converge strongly to the unique fixed point of Lipschitzian strongly pseudo-contractive mapping. This convergence was almost F -stable and F -stable. Applications of these results have been given to the operator equations F x = f and x + F x = f , where F is a strongly accretive and accretive mappings of X into itself.

Description: In this effort we propose a data-driven learning framework for reduced order modeling of fluid dynamics. Designing accurate and efficient reduced order models for nonlinear fluid dynamic problems is challenging for many practical engineering applications. Classical projection-based model reduction methods generate reduced systems by projecting full-order differential operators into low-dimensional subspaces. However, these techniques usually lead to severe instabilities in the presence of highly nonlinear dynamics, which dramatically deteriorates the accuracy of the reduced-order models. In contrast, our new framework exploits linear multistep networks, based on implicit Adams–Moulton schemes, to construct the reduced system. The advantage is that the method optimally approximates the full order model in the low-dimensional space with a given supervised learning task. Moreover, our approach is non-intrusive, such that it can be applied to other complex nonlinear dynamical systems with sophisticated legacy codes. We demonstrate the performance of our method through the numerical simulation of a two-dimensional flow past a circular cylinder with Reynolds number Re = 100. The results reveal that the new data-driven model is significantly more accurate than standard projection-based approaches.

Description: Since financial engineering problems are of great importance in the academic community, effective methods are still needed to analyze these models. Therefore, this article focuses mainly on capturing the discrete behavior of linear and nonlinear Black–Scholes European option pricing models. To achieve this, this article presents a combined method; a sixth order finite difference (FD6) scheme in space and a third–order strong stability preserving Runge–Kutta (SSPRK3) over time. The computed results are compared with available literature and the exact solution. The computed results revealed that the current method seems to be quite strong both quantitatively and qualitatively with minimal computational effort. Therefore, this method appears to be a very reliable alternative and flexible to implement in solving the problem while preserving the physical properties of such realistic processes.