Search

Semi-Markov processes generalize the Markov chains framework by utilizing abstract sojourn time distributions. They are widely known for offering enhanced accuracy in modeling stochastic phenomena. The aim of this paper is to provide closed analytic forms for three types of probabilities which describe attributes of considerable research interest in semi-Markov modeling: (a) the number of transitions to a state through time (Occupancy), (b) the number of transitions or the amount of time required to observe the first passage to a state (First passage time) and (c) the number of transitions or the amount of time required after a state is entered before the first real transition is made to another state (Duration). The non-homogeneous in time recursive relations of the above probabilities are developed and a description of the corresponding geometric transforms is produced. By applying appropriate properties, the closed analytic forms of the above probabilities are provided. Finally, data from human DNA sequences are used to illustrate the theoretical results of the paper.

The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided. Vertex–frequency localization-based approaches to analyzing signals on the graph emerged as a response to challenges of analysis of big data on irregular domains. Graph signals are either localized in the vertex domain before the spectral analysis is performed or are localized in the spectral domain prior to the inverse graph Fourier transform is applied. The latter approach is the spectral form of the vertex–frequency analysis, and it will be considered in this paper since the spectral domain for signal localization is well ordered and thus simpler for application to the graph signals. The localized graph Fourier transform is defined based on its counterpart, the short-time Fourier transform, in classical signal analysis. We consider various spectral window forms based on which these transforms can tackle the localized signal behavior. Conditions for the signal reconstruction, known as the overlap-and-add (OLA) and weighted overlap-and-add (WOLA) methods, are also considered. Since the graphs can be very large, the realizations of vertex–frequency representations using polynomial form localization have a particular significance. These forms use only very localized vertex domains, and do not require either the graph Fourier transform or the inverse graph Fourier transform, are computationally efficient. These kinds of implementations are then applied to classical time–frequency analysis since their simplicity can be very attractive for the implementation in the case of large time-domain signals. Spectral varying forms of the localization functions are presented as well. These spectral varying forms are related to the wavelet transform. For completeness, the inversion and signal reconstruction are discussed as well. The presented theory is illustrated and demonstrated on numerical examples.

Many problems of practical interest can be modeled and solved by using fuzzy graph (FG) algorithms. In general, fuzzy graph theory has a wide range of application in various fields. Since indeterminate information is an essential real-life problem and is often uncertain, modeling these problems based on FG is highly demanding for an expert. A vague graph (VG) can manage the uncertainty relevant to the inconsistent and indeterminate information of all real-world problems in which fuzzy graphs may not succeed in bringing about satisfactory results. Domination in FGs theory is one of the most widely used concepts in various sciences, including psychology, computer sciences, nervous systems, artificial intelligence, decision-making theory, etc. Many research studies today are trying to find other applications for domination in their field of interest. Hence, in this paper, we introduce different kinds of domination sets, such as the edge dominating set (EDS), the total edge dominating set (TEDS), the global dominating set (GDS), and the restrained dominating set (RDS), in product vague graphs (PVGs) and try to represent the properties of each by giving some examples. The relation between independent edge sets (IESs) and edge covering sets (ECSs) are established. Moreover, we derive the necessary and sufficient conditions for an edge dominating set to be minimal and show when a dominance set can be a global dominance set. Finally, we try to explain the relationship between a restrained dominating set and a restrained independent set with an example. Today, we see that there are still diseases that can only be treated in certain countries because they require a long treatment period with special medical devices. One of these diseases is leukemia, which severely affects the immune system and the body’s defenses, making it impossible for the patient to continue living a normal life. Therefore, in this paper, using a dominating set, we try to categorize countries that are in a more favorable position in terms of medical facilities, so that we can transfer the patients to a suitable hospital in the countries better suited in terms of both cost and distance.

In this paper, we prove some new Ostrowski-type integral inequalities for q-differentiable bounded functions. It is also shown that the results presented in this paper are a generalization of know results in the literarure. Applications to special means are also discussed.

The aim of this paper is twofold. First, we show that the expectation of the absolute value of the difference between two copies, not necessarily independent, of a random variable is a measure of its variability in the sense of Bickel and Lehmann (1979). Moreover, if the two copies are negatively dependent through stochastic ordering, this measure is subadditive. The second purpose of this paper is to provide sufficient conditions for comparing several distances between pairs of random variables (with possibly different distribution functions) in terms of various stochastic orderings. Applications in actuarial and financial risk management are given.

This paper is concerned with an SIS epidemic reaction-diffusion model. The purpose of this paper is to derive some effects of the spatial heterogeneity of the recovery rate on the total population of infected and the reproduction number. The proof is based on an application of our previous result on the unboundedness of the ratio of the species to the resource for a diffusive logistic equation. Our pure mathematical result can be epidemically interpreted as that a regional difference in the recovery rate can make the infected population grow in the case when the reproduction number is slightly larger than one.

Let Z(s)=(Z1(s),…,Zp(s))t be an isotropic second-order stationary multivariate spatial process. We measure the statistical association between the p random components of Z with the correlation coefficients and measure the spatial dependence with variograms. If two of the Z components are correlated, the spatial information provided by one of them can improve the information of the other. To capture this association, both within components of Z(s) and across s, we use a cross-variogram. Only two robust cross-variogram estimators have been proposed in the literature, both by Lark, and their sample distributions were not obtained. In this paper, we propose new robust cross-variogram estimators, following the location estimation method instead of the scale estimation one considered by Lark, thus extending the results obtained by García-Pérez to the multivariate case. We also obtain accurate approximations for their sample distributions using saddlepoint techniques and assuming a multivariate-scale contaminated normal model. The question of the independence of the transformed variables to avoid the usual dependence of spatial observations is also considered in the paper, linking it with the acceptance of linear variograms and cross-variograms.

The present paper concretizes the models proposed by S. Ri and N. Secelean. S. Ri proposed the construction of the fractal interpolation function (FIF) considering finite systems consisting of Rakotch contractions, but produced no concretization of the model. N. Secelean considered countable systems of Banach contractions to produce the fractal interpolation function. Based on the abovementioned results, in this paper, we propose two different algorithms to produce the fractal interpolation functions both in the affine and non-affine cases. The theoretical context we were working in suppose a countable set of starting points and a countable system of Rakotch contractions. Due to the computational restrictions, the algorithms constructed in the applications have the weakness that they use a finite set of starting points and a finite system of Rakotch contractions. In this respect, the attractor obtained is a two-step approximation. The large number of points used in the computations and the graphical results lead us to the conclusion that the attractor obtained is a good approximation of the fractal interpolation function in both cases, affine and non-affine FIFs. In this way, we also provide a concretization of the scheme presented by C.M. Păcurar.

In this paper, we define (p,q)-integrals for continuous functions of two variables. Then, we prove the Hermite-Hadamard type inequalities for coordinated convex functions by using (p,q)-integrals. Many results obtained in this paper provide significant extensions of other related results given in the literature. Finally, we give some examples of our results.

Given a digital image (or digital object) (X,k),X⊂Zn, this paper initially establishes a group structure of the set of self-k-isomorphisms of (X,k) with the function composition, denoted by Isok(X) or Autk(X). In particular, let Ckn,l be a simple closed k-curve with l elements in Zn. Then, the group Isok(Ckn,l) is proved to be isomorphic to the standard dihedral group Dl with order l. The calculation of this quantity Isok(Ckn,l) is a key step for obtaining many new results. Indeed, it is essential for exploring many features of Isok(X). Furthermore, this quantity is proved to be a digital topological invariant. After proceeding with an Isok(X)-action on (X,k), we investigate some properties of fixed point sets by this action. Finally, we explore various features of fixed point sets by this action from the viewpoint of digital k-curve theory. This paper only deals with k-connected digital images (X,k) whose cardinality is equal to or greater than 2. Besides, we discuss some errors that have appeared in the lilterature.

The fractional calculus is useful in describing the natural phenomena with memory effect. This paper addresses the fractional form of Ambartsumian equation with a delay parameter. It may be a challenge to obtain accurate approximate solution of such kinds of fractional delay equations. In the literature, several attempts have been conducted to analyze the fractional Ambartsumian equation. However, the previous approaches in the literature led to approximate power series solutions which converge in subdomains. Such difficulties are solved in this paper via the Homotopy Perturbation Method (HPM). The present approximations are expressed in terms of the Mittag-Leffler functions which converge in the whole domain of the studied model. The convergence issue is also addressed. Several comparisons with the previous published results are discussed. In particular, while the computed solution in the literature is physical in short domains, with our approach it is physical in the whole domain. The results reveal that the HPM is an effective tool to analyzing the fractional Ambartsumian equation.

In this paper we investigate the unified theory for solutions of differential equations without impulses and with impulses, even at variable times, allowing the presence of beating phenomena, in the space of regulated functions. One of the aims of the paper is to give sufficient conditions to ensure that a regulated solution of an impulsive problem is globally defined.

This paper further improves the Lie group method with Magnus expansion proposed in a previous paper by the authors, to solve some types of direct singular Sturm&ndash, Liouville problems. Next, a concrete implementation to the inverse Sturm&ndash, Liouville problem algorithm proposed by Barcilon (1974) is provided. Furthermore, computational feasibility and applicability of this algorithm to solve inverse Sturm&ndash, Liouville problems of higher order (for n=2,4) are verified successfully. It is observed that the method is successful even in the presence of significant noise, provided that the assumptions of the algorithm are satisfied. In conclusion, this work provides a method that can be adapted successfully for solving a direct (regular/singular) or inverse Sturm&ndash, Liouville problem (SLP) of an arbitrary order with arbitrary boundary conditions.

In the paper, a survey of the main results concerning univariate and multivariate exponential power (EP) distributions is given, with main attention paid to mixture representations of these laws. The properties of mixing distributions are considered and some asymptotic results based on mixture representations for EP and related distributions are proved. Unlike the conventional analytical approach, here the presentation follows the lines of a kind of arithmetical approach in the space of random variables or vectors. Here the operation of scale mixing in the space of distributions is replaced with the operation of multiplication in the space of random vectors/variables under the assumption that the multipliers are independent. By doing so, the reasoning becomes much simpler, the proofs become shorter and some general features of the distributions under consideration become more vivid. The first part of the paper concerns the univariate case. Some known results are discussed and simple alternative proofs for some of them are presented as well as several new results concerning both EP distributions and some related topics including an extension of Gleser’s theorem on representability of the gamma distribution as a mixture of exponential laws and limit theorems on convergence of the distributions of maximum and minimum random sums to one-sided EP distributions and convergence of the distributions of extreme order statistics in samples with random sizes to the one-sided EP and gamma distributions. The results obtained here open the way to deal with natural multivariate analogs of EP distributions. In the second part of the paper, we discuss the conventionally defined multivariate EP distributions and introduce the notion of projective EP (PEP) distributions. The properties of multivariate EP and PEP distributions are considered as well as limit theorems establishing the conditions for the convergence of multivariate statistics constructed from samples with random sizes (including random sums of random vectors) to multivariate elliptically contoured EP and projective EP laws. The results obtained here give additional theoretical grounds for the applicability of EP and PEP distributions as asymptotic approximations for the statistical regularities observed in data in many fields.

In this paper, an algebraic structure of a type of double cyclic codes is investigated, which covers some existing codes as special cases. The paper presents generic results about the generating polynomials, minimal generating sets, matrices and dual codes of the proposed codes.

In the present paper, we consider an important problem from the point of view of application in sciences and engineering, namely, a new class of nonlinear Love-equation with infinite memory in the presence of source term that takes general nonlinearity form. New minimal conditions on the relaxation function and the relationship between the weights of source term are used to show a very general decay rate for solution by certain properties of convex functions combined with some estimates. Investigations on the propagation of surface waves of Love-type have been made by many authors in different models and many attempts to solve Love&rsquo, s equation have been performed, in view of its wide applicability. To our knowledge, there are no decay results for damped equations of Love waves or Love type waves. However, the existence of solution or blow up results, with different boundary conditions, have been extensively studied by many authors. Our interest in this paper arose in the first place in consequence of a query for a new decay rate, which is related to those for infinite memory &piv, in the third section. We found that the system energy decreased according to a very general rate that includes all previous results.

The paper is concerned with complex fuzzy numbers and complex fuzzy inner product spaces. In the classical complex number set, a complex number can be expressed using the Cartesian form or polar form. Both expressions are needed because one expression is better than the other depending on the situation. Likewise, the Cartesian form and the polar form can be defined in a complex fuzzy number set. First, the complex fuzzy numbers (CFNs) are categorized into two types, the polar form and the Cartesian form, as type I and type II. The properties of the complex fuzzy number set of those two expressions are discussed, and how the expressions can be used practically is shown through an example. Second, we study the complex fuzzy inner product structure in each category and find the non-existence of an inner product on CFNs of type I. Several properties of the fuzzy inner product space for type II are proposed from the modulus that is newly defined. Specfically, the Cauchy-Schwartz inequality for type II is proven in a compact way, not only the one for fuzzy real numbers. In fact, it was already discussed by Hasanhani et al; however, they proved every case in a very complicated way. In this paper, we prove the Cauchy-Schwartz inequality in a much simpler way from a general point of view. Finally, we introduce a complex fuzzy scalar product for the generalization of a complex fuzzy inner product and propose to study the condition for its existence on CFNs of type I.

For a non-empty class of groups L, a finite group G=AB is said to be an L-connected product of the subgroups A and B if &lang, a,b&rang, &isin, L for all a&isin, A and b&isin, B. In a previous paper, we prove that, for such a product, when L=S is the class of finite soluble groups, then [A,B] is soluble. This generalizes the theorem of Thompson that states the solubility of finite groups whose two-generated subgroups are soluble. In the present paper, our result is applied to extend to finite groups previous research about finite groups in the soluble universe. In particular, we characterize connected products for relevant classes of groups, among others, the class of metanilpotent groups and the class of groups with nilpotent derived subgroup. Additionally, we give local descriptions of relevant subgroups of finite groups.

The integral representation of the two-parameter Mittag-Leffler function E &rho, &mu, ( z ) is considered in the paper that expresses its value in terms of the contour integral. For this integral representation, the transition is made from integration over a complex variable to integration over real variables. It is shown that as a result of such a transition, the integral representation of the function E &rho, ( z ) has two forms: the representation &ldquo, A&rdquo, and &ldquo, B&rdquo, Each of these representations has its advantages and drawbacks. In the paper, the corresponding theorems are formulated and proved, and the advantages and disadvantages of each of the obtained representations are discussed.

The Opial property of Hilbert spaces is essential in many fixed point theorems of non-expansive maps. While the Opial property does not hold in every Banach space, the Bregman&ndash, Opial property does. This suggests to study fixed point theorems for various Bregman non-expansive like maps in the general Banach space setting. In this paper, after introducing the notion of Bregman generalized hybrid sequences in a reflexive Banach space, we prove (with using the Bregman&ndash, Opial property instead of the Opial property) convergence theorems for such sequences. We also provide new fixed point theorems for Bregman generalized hybrid maps defined on an arbitrary but not necessarily convex subset of a reflexive Banach space. We end this paper with a brief discussion of the existence of Bregman absolute fixed points of such maps.

An arbitrary univariate polynomial of nth degree has n sequences. The sequences are systematized into classes. All the values of the first class sequence are obtained by Newton&rsquo, s polynomial of nth degree. Furthermore, the values of all sequences for each class are calculated by Newton&rsquo, s identities. In other words, the sequences are formed without calculation of polynomial roots. The New-nacci method is used for the calculation of the roots of an nth-degree univariate polynomial using radicals and limits of successive members of sequences. In such an approach as is presented in this paper, limit play a catalytic&ndash, theoretical role. Moreover, only four basic algebraic operations are sufficient to calculate real roots. Radicals are necessary for calculating conjugated complex roots. The partial limitations of the New-nacci method may appear from the decadal polynomial. In the case that an arbitrary univariate polynomial of nth degree (n &ge, 10) has five or more conjugated complex roots, the roots of the polynomial cannot be calculated due to Abel&rsquo, s impossibility theorem. The second phase of the New-nacci method solves this problem as well. This paper is focused on solving the roots of the quintic equation. The method is verified by applying it to the quintic polynomial with all real roots and the Degen&ndash, Abel polynomial, dating from 1821.

The aim of this paper is to study the Lagrange interpolation on the unit circle taking only into account the separation properties of the nodal points. The novelty of this paper is that we do not consider nodal systems connected with orthogonal or paraorthogonal polynomials, which is an interesting approach because in practical applications this connection may not exist. A detailed study of the properties satisfied by the nodal system and the corresponding nodal polynomial is presented. We obtain the relevant results of the convergence related to the process for continuous smooth functions as well as the rate of convergence. Analogous results for interpolation on the bounded interval are deduced and finally some numerical examples are presented.

In this paper, we introduce the notions of &alpha, almost Istrăţescu contraction of type E and of type E&lowast, inthesetting of b-metric space. The existence of fixed points for such mappings isinvestigated and some examples to illustrate the validity of the main results are considered. In the last part of the paper, we list some immediate consequences.

The domination game is played on a graph by two players, Dominator and Staller, who alternately choose a vertex of G. Dominator aims to finish the game in as few turns as possible while Staller aims to finish the game in as many turns as possible. The game ends when all vertices are dominated. The game domination number, denoted by &gamma, g ( G ) (respectively &gamma, g &prime, ( G ) ), is the total number of turns when both players play optimally and when Dominator (respectively Staller) starts the game. In this paper, we study a version of this game where the set of chosen vertices is always independent. This version turns out to be another game known as the competition-independence game. The competition-independence game is played on a graph by two players, Diminisher and Sweller. They take turns in constructing maximal independent set M, where Diminisher tries to minimize | M | and Sweller tries to maximize | M | . Note that, actually, it is the domination game in which the set of played vertices is independent. The competition-independence number, denoted by I d ( G ) (respectively I s ( G ) ) is the optimal size of the final independent set in the competition-independence game if Diminisher (respectively Sweller) starts the game. In this paper, we check whether some well-known results in the domination game hold for the competition-independence game. We compare the competition-independence numbers to the game domination numbers. Moreover, we provide a family of graphs such that many parameters are equal. Finally, we present a realization result on the competition-independence numbers.

The main purpose of this paper is to obtain criteria for the oscillation of all solutions of a third-order half-linear neutral differential equation. The main result in this paper is an oscillation theorem obtained by comparing the equation under investigation to two first order linear delay differential equations. An additional result is obtained by using a Riccati transformation technique. Examples are provided to show the importance of the main results.

The aim of this paper is to enrich random fixed point theory, which is one of the cornerstones of probabilistic functional analysis. In this paper, we introduce the notions of random, comparable MT- &gamma, contraction and random, comparable Meir-Keeler contraction in the framework of complete random metric spaces. We investigate the existence of a random fixed point for these contractions. We express illustrative examples to support the presented results.

In this paper, first, we introduce a path for a convex combination of a pseudocontractive type of mappings with a perturbed mapping and prove strong convergence of the proposed path in a real reflexive Banach space having a weakly continuous duality mapping. Second, we propose two modified implicit iterative methods with a perturbed mapping for a continuous pseudocontractive mapping in the same Banach space. Strong convergence theorems for the proposed iterative methods are established. The results in this paper substantially develop and complement the previous well-known results in this area.

The present paper studies the fixed point property (FPP) for closed k-surfaces. We also intensively study Euler characteristics of a closed k-surface and a connected sum of closed k-surfaces. Furthermore, we explore some relationships between the FPP and Euler characteristics of closed k-surfaces. After explaining how to define the Euler characteristic of a closed k-surface more precisely, we confirm a certain consistency of the Euler characteristic of a closed k-surface and a continuous analog of it. In proceeding with this work, for a simple closed k-surface in Z 3 , say S k , we can see that both the minimal 26-adjacency neighborhood of a point x &isin, S k , denoted by M k ( x ) , and the geometric realization of it in R 3 , denoted by D k ( x ) , play important roles in both digital surface theory and fixed point theory. Moreover, we prove that the simple closed 18-surfaces M S S 18 and M S S 18 &prime, do not have the almost fixed point property (AFPP). Consequently, we conclude that the triviality or the non-triviality of the Euler characteristics of simple closed k-surfaces have no relationships with the FPP in digital topology. Using this fact, we correct many errors in many papers written by L. Boxer et al.

In this paper, we present the application of the homotopy analysis method for solving integrodifferential equations. In this method, a series is created, the successive elements of which are determined by calculating the appropriate integral of the previous element. In this elaboration, we prove that, if this series is convergent, then its sum is the solution of the objective equation. We formulate and prove the sufficient condition of this convergence, and we give also the estimation of error of an approximate solution obtained by taking the partial sum of the considered series. Moreover, we present in this paper the example of using the investigated method for determining the vibrations of the freely supported reinforced concrete beam as well as for solving the equation of movement of the electromagnet jumper mechanical system.

Unlike the study of the fixed point property (FPP, for brevity) of retractable topological spaces, the research of the FPP of non-retractable topological spaces remains. The present paper deals with the issue. Based on order-theoretic foundations and fixed point theory for Khalimsky (K-, for short) topological spaces, the present paper studies the product property of the FPP for K-topological spaces. Furthermore, the paper investigates the FPP of various types of connected K-topological spaces such as non-K-retractable spaces and some points deleted K-topological (finite) planes, and so on. To be specific, after proving that not every one point deleted subspace of a finite K-topological plane X is a K-retract of X, we study the FPP of a non-retractable topological space Y, such as one point deleted space Y ∖ { p } .

This paper aims to present a Clenshaw&ndash, Curtis&ndash, Filon quadrature to approximate thesolution of various cases of Cauchy-type singular integral equations (CSIEs) of the second kind witha highly oscillatory kernel function. We adduce that the zero case oscillation (k = 0) proposed methodgives more accurate results than the scheme introduced in Dezhbord at el. (2016) and Eshkuvatovat el. (2009) for small values of N. Finally, this paper illustrates some error analyses and numericalresults for CSIEs.

In this paper, we consider a resolvent operator which depends on the composition of two mappings with &oplus, operation. We prove some of the properties of the resolvent operator, that is, that it is single-valued as well as Lipschitz-type-continuous. An existence and convergence result is proven for a generalized implicit set-valued variational inclusion problem with &oplus, operation. Some special cases of a generalized implicit set-valued variational inclusion problem with &oplus, operation are discussed. An example is constructed to illustrate some of the concepts used in this paper.

In this paper, we investigate a class of nonlinear Langevin equations involving two fractional orders with nonlocal integral and three-point boundary conditions. Using the Banach contraction principle, Krasnoselskii’s and the nonlinear alternative Leray Schauder theorems, the existence and uniqueness results of solutions are proven. The paper was appended examples which illustrate the applicability of the results.

Probabilistic evolution theory (PREVTH) forms a framework for the solution of explicit ODEs. The purpose of the paper is two-fold: (1) conversion of multinomial right-hand sides of the ODEs to purely second degree multinomial right-hand sides by space extension, (2) decrease the computational burden of probabilistic evolution theory by using the condensed Kronecker product. A first order ODE set with multinomial right-hand side functions may be converted to a first order ODE set with purely second degree multinomial right-hand side functions at the expense of an increase in the number of equations and unknowns. Obtaining purely second degree multinomial right-hand side functions is important because the solution of such equation set may be approximated by probabilistic evolution theory. A recent article by the authors states that the ODE set with the smallest number of unknowns can be found by searching. This paper gives the details of a way to search for the optimal space extension. As for the second purpose of the paper, the computational burden can be reduced by considering the properties of the Kronecker product of vectors and how the Kronecker product appears within the recursion of PREVTH: as a Cauchy product structure.

The Colebrook-White equation is often used for calculation of the friction factor in turbulent regimes; it has succeeded in attracting a great deal of attention from researchers. The Colebrook–White equation is a complex equation where the computation of the friction factor is not direct, and there is a need for trial-error methods or graphical solutions; on the other hand, several researchers have attempted to alter the Colebrook-White equation by explicit formulas with the hope of achieving zero-percent (0%) maximum deviation, among them Dejan Brkić and Pavel Praks. The goal of this paper is to discuss the results proposed by the authors in their paper:” Accurate and Efficient Explicit Approximations of the Colebrook Flow Friction Equation Based on the Wright ω-Function” and to propose more accurate formulas.

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.

In the 1920s, the English philosopher W.E. Johnson introduced a characterization of the symmetric Dirichlet prior distribution in terms of its predictive distribution. This is typically referred to as Johnson’s “sufficientness” postulate, and it has been the subject of many contributions in Bayesian statistics, leading to predictive characterization for infinite-dimensional generalizations of the Dirichlet distribution, i.e., species-sampling models. In this paper, we review “sufficientness” postulates for species-sampling models, and then investigate analogous predictive characterizations for the more general feature-sampling models. In particular, we present a “sufficientness” postulate for a class of feature-sampling models referred to as Scaled Processes (SPs), and then discuss analogous characterizations in the general setup of feature-sampling models.

The aim of this paper is to introduce an orignal coupling procedure between surface integral equation formulations and on-surface radiation condition (OSRC) methods for solving two-dimensional scattering problems for non convex structures. The key point is that the use of the OSRC introduces a sparse block in the surface operator representation of the wave field while the integral part leads to an improved accuracy of the OSRC method in the non convex part of the scattering structure. The procedure is given for both the Dirichlet and Neumann scattering problems. Some numerical simulations show the improvement induced by the coupling method.

Consider the Diophantine equation yn=x+x(x+1)+⋯+x(x+1)⋯(x+k), where x, y, n, and k are integers. In 2016, a research article, entitled – ’power values of sums of products of consecutive integers’, primarily proved the inequality n= 19,736 to obtain all solutions (x,y,n) of the equation for the fixed positive integers k≤10. In this paper, we improve the bound as n≤ 10,000 for the same case k≤10, and for any fixed general positive integer k, we give an upper bound depending only on k for n.

In this paper, a new efficient and practical modification of the Adomian decomposition method is proposed with Laguerre polynomials and the second kind of Chebyshev polynomials which has not been introduced in other articles to the best of our knowledge. This approach can be utilized to approximately solve linear and nonlinear differential equations. The proposed formulations are examined by a representative example and the numerical results confirm their efficiency and accuracy.

In recent years, predator–prey systems have increased their applications and have given rise to systems which represent more accurately different biological issues that appear in the context of interacting species. Our aim in this paper is to give a state-of-the-art review of recent predator–prey models which include some interesting characteristics such as Allee effect, fear effect, cannibalism, and immigration. We compare the qualitative results obtained for each of them, particularly regarding the equilibria, local and global stability, and the existence of limit cycles.

In this paper, we first define soft u-open sets and soft s-open as two new classes of soft sets on soft bitopological spaces. We show that the class of soft p-open sets lies strictly between these classes, and we give several sufficient conditions for the equivalence between soft p-open sets and each of the soft u-open sets and soft s-open sets, respectively. In addition to these, we introduce the soft u-ω-open, soft p-ω-open, and soft s-ω-open sets as three new classes of soft sets in soft bitopological spaces, which contain soft u-open sets, soft p-open sets, and soft s-open sets, respectively. Via soft u-open sets, we define two notions of Lindelöfeness in SBTSs. We discuss the relationship between these two notions, and we characterize them via other types of soft sets. We define several types of soft local countability in soft bitopological spaces. We discuss relationships between them, and via some of them, we give two results related to the discrete soft topological space. According to our new concepts, the study deals with the correspondence between soft bitopological spaces and their generated bitopological spaces.

The main purpose of this paper is to use the multiple twisted Bernoulli polynomials and their interpolation functions to construct multiple twisted Dedekind type sums. We investigate some properties of these sums. By use of the properties of multiple twisted zeta functions and the Bernoulli functions involving the Bernoulli polynomials, we derive reciprocity laws of these sums. Further developments and observations on these new Dedekind type sums are given.

Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-commodity flow problems, are continuously developed and improved, and so, random network generators become indispensable to simulate the functionality and to test the correctness and the execution speed of these algorithms. For this purpose, in this paper, the well-known Erdős–Rényi model is adapted to generate random flow (transportation) networks. The developed algorithm is fast and based on the natural property of the flow that can be decomposed into directed elementary s-t paths and cycles. So, the proposed algorithm can be used to quickly build a vast number of networks as well as large-scale networks especially designed for s-t flows.

A class of p-valent analytic functions is introduced using the q-difference operator and the familiar Janowski functions. Several properties of functions in the class, such as the Fekete–Szegö inequality, coefficient estimates, necessary and sufficient conditions, distortion and growth theorems, radii of convexity and starlikeness, closure theorems and partial sums, are discussed in this paper.

Partial difference equations have received more and more attention in recent years due to their extensive applications in diverse areas. In this paper, we consider a Dirichlet boundary value problem of the partial difference equation involving the mean curvature operator. By applying critical point theory, the existence of at least three solutions is obtained. Furthermore, under some appropriate assumptions on the nonlinearity, we respectively show that this problem admits at least two or three positive solutions by means of a strong maximum principle. Finally, we present two concrete examples and combine with images to illustrate our main results.

Let Lip([0,1]) be the Banach space of all Lipschitz complex-valued functions f on [0,1], equipped with one of the norms: fσ=|f(0)|+f′L∞ or fm=max|f(0)|,f′L∞, where ·L∞ denotes the essential supremum norm. It is known that the surjective linear isometries of such spaces are integral operators, rather than the more familiar weighted composition operators. In this paper, we describe the topological reflexive closure of the isometry group of Lip([0,1]). Namely, we prove that every approximate local isometry of Lip([0,1]) can be represented as a sum of an elementary weighted composition operator and an integral operator. This description allows us to establish the algebraic reflexivity of the sets of surjective linear isometries, isometric reflections, and generalized bi-circular projections of Lip([0,1]). Additionally, some complete characterizations of such reflections and projections are stated.

In this paper, the method of artificial boundary conditions for exterior quasilinear problems in concave angle domains is investigated. Based on the Kirchhoff transformation, the exact quasiliner elliptical arc artificial boundary condition is derived. Using the approximate elliptical arc artificial boundary condition, the finite element method is formulated in a bounded region. The error estimates are obtained. The effectiveness of our method is showed by some numerical experiments.

In this paper, we introduce the notion of bicomplex partial metric space and prove some common fixed point theorems. The presented results generalize and expand some of the literature’s well-known results. An example and application on bicomplex partial metric space is given.

Let F=Fθ:θ∈Θ⊂R be a family of probability distributions indexed by a parameter θ and let X1,⋯,Xn be i.i.d. r.v.’s with L(X1)=Fθ∈F. Then, F is said to be reproducible if for all θ∈Θ and n∈N, there exists a sequence (αn)n≥1 and a mapping gn:Θ→Θ,θ⟼gn(θ) such that L(αn∑i=1nXi)=Fgn(θ)∈F. In this paper, we prove that a natural exponential family F is reproducible iff it possesses a variance function which is a power function of its mean. Such a result generalizes that of Bar-Lev and Enis (1986, The Annals of Statistics) who proved a similar but partial statement under the assumption that F is steep as and under rather restricted constraints on the forms of αn and gn(θ). We show that such restrictions are not required. In addition, we examine various aspects of reproducibility, both theoretically and practically, and discuss the relationship between reproducibility, convolution and infinite divisibility. We suggest new avenues for characterizing other classes of families of distributions with respect to their reproducibility and convolution properties .