Upper and lower bounds for the energy of bipartite graphs

Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp.     

Multiplicity results for positive solutions of some semi-positone three-point boundary value problems

In this paper, some multiplicity results for positive solutions of some singular semi-positone three-point boundary value problem be obtained by using the fixed point index method.     

Existence of two solutions of m-point boundary value problem for second order dynamic equations on time scales

In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered.     

Stability and bifurcation in a delayed predator-prey system with Beddington-DeAngelis functional response

We consider a delayed predator-prey system with Beddington-DeAngelis functional response. The stability of the interior equilibrium will be studied by analyzing the associated characteristic transcendental equation. By choosing the delay τ as a bifurcation parameter, we show that Hopf bifurcation can occur as the delay τ crosses some critical values. The direction and stability of the Hopf bifurcation are investigated by following the procedure of deriving normal form given by Faria and Magalhães. An example is given and numerical simulations are performed to illustrate the obtained results.     

Improved bounds for some nonstandard problems in generalized heat conduction

We consider the Maxwell-Cattaneo system of equations for generalized heat conduction where the temperature and heat flux satisfy a nonstandard auxiliary condition which prescribes a combination of their values initially and at a later time. We obtain L₂ bounds for the temperature and heat flux by means of Lagrange identities. These bounds extend the range of validity for the parameter in the nonstandard condition under a constraint on the coefficients in the differential equations.     

CONSTRUCTION OF SOME KIESSWETTER-LIKE FUNCTIONS-THE CONTINUOUS BUT NON-DIFFERENTIABLE FUNCTION DEFINED BY QUINARY DECIMAL

In this paper, we construct some continuous but non-differentiable functions defined by quinary decimal, that are Kiesswetter-like functions. We discuss their properties, then investigate the Hausdorff dimensions of graphs of these functions and give a detailed proof.     

S[a,b]类中边界Nevanlinna-Pick插值(Ⅱ)

继续作者最近的研究,用所谓的Hankel向量方法建立S[a,b]函数类中带边界插值数据的Nevanlinna-Pick插值问题与[a,b]上的某种带约束条件的Hausdorff矩量问题之间解集之间明确的一一对应关系.通过N[a,b]函数类与S[a,b]函数类之间的联系,从而由BNP(N[a,b])问题的可解性准则和解的参数化描述获得BNP(S[a,b)问题的可解性准则和解的参数化表示.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Convergence estimates of Galerkin-wavelet solutions to a Cauchy problem for a class of periodic pseudodifferential equations

A class of Cauchy problems for interesting complicated periodic pseudodifferential equations is considered. By the Galerkin-wavelet method and with weak solutions one can find sufficient conditions to establish convergence estimates of weak Galerkin-wavelet solutions to a Cauchy problem for this class of equations.

     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.