Exact multiplicity and global structure of solutions for a class of semilinear elliptic equations

In this paper, we establish an exact multiplicity result of solutions for a class of semilinear elliptic equation. We also obtain a precise global bifurcation diagram of the solution set. As a result, an open problem presented by C.-H. Hsu and Y.-W. Shih [C.-H. Hsu, Y.-W. Shih, Solutions of semilinear elliptic equations with asymptotic linear nonlinearity, Nonlinear Anal. 50 (2002) 275-283] is completely solved. Our argument is mainly based on bifurcation theory and continuation method.     

An explicit construction of ruled surfaces

The main goal of this paper is to give a general algorithm to compute, via computer-algebra systems, an explicit set of generators of the ideals of the projective embeddings of ruled surfaces, i.e. projectivizations of rank two vector bundles over curves, such that the fibers are embedded as smooth rational curves.There are two different applications of our algorithm. Firstly, given a very ample linear system on an abstract ruled surface, our algorithm allows computing the ideal of the embedded surface, all the syzygies, and all the algebraic invariants which are computable from its ideal as, for instance, the k-regularity. Secondly, it is possible to prove the existence of new embeddings of ruled surfaces.The method can be implemented over any computer-algebra system able to deal with commutative algebra and Gröbner-basis computations. An implementation of our algorithms for the computer-algebra system Macaulay2 (cf. [Daniel R. Grayson, Michael E. Stillman, Macaulay 2, a software system for research in algebraic geometry, 1993. Available at http://www.math.uiuc.edu/Macaulay2/]) and explicit examples are enclosed.     

Karmarkar's algorithm and the ellipsoid method

We show that Karmarkar's algorithm and the ellipsoid method are closely related. At each iteration, the potential function used to measure convergence of the primal solutions in Karmarkar's algorithm correctly characterizes the logarithmic volume of an ellipsoid that contains all of the optimal dual solutions. As the potential function declines, the volume of the ellipsoid monotonicly shrinks to zero. These ellipsoids can be used to determine the optimal basis for linear programming. Conversely, the relation of these two algorithms may lead to an efficient implementation for the ellipsoid method.     

COMPUTATION OF THE RELAXATION OSCILLATION PERIOD IN LOTKA‐VOLTERRA SYSTEMS

ABSTRACT. This work surveys techniques of Grasman and Veling [1973], Vasil'eva and Belyanin [1988] and Shih [1996] for computing the relaxation oscillation period of singularly perturbed Lotka‐Volterra systems. Grasman and Veling [1973] used an implicit function theorem to derive an asymptotic formula for the period; Vasil'eva and Belyanin [1988] employed a method of matched asymptotic expansions to obtain an approximation to the period; Shih [1996] obtained two (exact) integral representations for the period in terms of two inverse functions W(–k, x) of xexp(x). These results are compared numerically and asymptotically. In particular, the integral representation of the period in Shih [1996] is computed numerically using a Gauss‐Tschebyscheff integration rule of the first kind, and is further investigated asymptotically by virtue of the asymptotics of W(–k, x), Laplace's method, and a method of consequent representation. Computational results indicate that the Gauss‐Tschebyscheff approximation of the period in Shih [1996] is uniformly accurate for a wide range of the singular parameter (? in the paper).     

A hidden Markov regime-switching model for option valuation

We investigate two approaches, namely, the Esscher transform and the extended Girsanov’s principle, for option valuation in a discrete-time hidden Markov regime-switching Gaussian model. The model’s parameters including the interest rate, the appreciation rate and the volatility of a risky asset are governed by a discrete-time, finite-state, hidden Markov chain whose states represent the hidden states of an economy. We give a recursive filter for the hidden Markov chain and estimates of model parameters using a filter-based EM algorithm. We also derive predictors for the hidden Markov chain and some related quantities. These quantities are used to estimate the price of a standard European call option. Numerical examples based on real financial data are provided to illustrate the implementation of the proposed method.     

An approach to injective acts over monoids based on indecomposability

The main purpose of this paper is to investigate classes of acts that are injective relative to all embeddings with indecomposable domains or codomains. We give some homological classifications of monoids in light of such kinds of injectivity. Our approach to the indecomposability property provides a new characterization of right absolutely injective monoids such that all indecomposable acts are injective.     

Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions

We examine a Maple implementation of two distinct approaches to Laplace's method used to obtain asymptotic expansions of Laplace-type integrals. One algorithm uses power series reversion, whereas the other expands all quantities in Taylor or Puiseux series. These algorithms are used to derive asymptotic expansions for the real valued modified Bessel functions of pure imaginary order and real argument that mimic the well-known corresponding expansions for the unmodified Bessel functions.     

Green's function-based integral approaches to nonlinear transient boundary-value problems (II)

Two Green's function-based numerical formulations are used to solve the time-dependent nonlinear heat conduction (diffusion) equation. These formulations, which are an extension of the first paper, utilize two fundamental solutions and the Green's second identity to achieve integral replications of the governing partial differential equation. The integral equations thus derived are discretized in space and time and aggregated in a finite element sense to give a system of nonlinear discrete equations that are solved by the Newton–Raphson algorithm. The mathematical simplicity of the Green's function of the first formulation facilitates its numerical implementation. The performance of the formulations is assessed by comparing their results with available numerical and analytical solutions. In all cases satisfactory and physically realistic results are obtained.     

Vertex-transitive graphs and vertex-transitive maps

We consider vertex-transitive graphs embeddable on a fixed surface. We prove that all but a finite number of them admit embeddings as vertex-transitive maps on surfaces of nonnegative Euler characteristic (sphere, projective plane, torus, or Klein bottle). It follows that with the exception of the cycles and a finite number of additional graphs, they are factor graphs of semiregular plane tilings. The results generalize previous work on the genus of minimal Cayley graphs by V. Proulx and T. W. Tucker and were obtained independently by C. Thomassen, with significant differences in the methods used. Our method is based on an excursion into the infinite. The local structure of our finite graphs is studied via a pointwise limit construction, and the infinite vertex-transitive graphs obtained as such limits are classified by their connectivity and the number of ends. In two appendices, we derive a combinatorial version of Hurwitz's Theorem, and classify the vertex-transitive maps on the Klein bottle.     

On polynomial isotopy of knot-types

We have proved that every knot-type ???³ can be uniquely represented by polynomials up to polynomial isotopy i.e. if two polynomial embeddings of ? in ?³ represent the same knot-type, then we can join them by polynomial embeddings.     

Heuristical labour scheduling to optimize airport passenger flows

We describe the development and implementation of a decision support system for the optimization of passenger flow by trading off service quality and labour costs at an airport. The system integrates a simulation module with an optimization module that requires that Dantzig's labour scheduling problem be solved in the order of thousands of times. We developed a customized scatter search to give the system the capability of finding high-quality solutions to the labour scheduling problems in short computational times. Our experiments verify that our scatter search implementation meets the needed requirements.     

Some General Results on Conformal Embeddings of Affine Vertex Operator Algebras

We give a general criterion for conformal embeddings of vertex operator algebras associated to affine Lie algebras at arbitrary levels. Using that criterion, we construct new conformal embeddings at admissible rational and negative integer levels. In particular, we construct all remaining conformal embeddings associated to automorphisms of Dynkin diagrams of simple Lie algebras. The semisimplicity of the corresponding decompositions is obtained by using the concept of fusion rules for vertex operator algebras.     

Embeddings for solutions of Einstein equations

We study isometric embeddings of some solutions of the Einstein equations with sufficiently high symmetries into a flat ambient space. We briefly describe a method for constructing surfaces with a given symmetry. We discuss all minimal embeddings of the Schwarzschild metric obtained using this method and show how the method can be used to construct all minimal embeddings for the Friedmann models. We classify all the embeddings in terms of realizations of symmetries of the corresponding solutions.     

A new algorithm for quadratic programming

We present a new finite algorithm for quadratic programming. Our algorithm is based on the solution procedures of linear programming (pivoting, Bland's rule, Hungarian Methods, criss-cross method), however this method does not require the enlargement of the basic tableau as Frank-Wolfe method does. It can be considered as a feasible point active-set method. We solve linear equation systems in oder to reach an active constraint set (complementary solutions) and we solve a feasibility problem in order to check that optimality can be reached on this active set or to improve the actual solution. This algorithm is a straightforward generalization of Klafszky's and Terlaky's Hungarian Method. It has nearly the same structure as Ritter's algorithm (which is based on conjugate directions), but it does not use conjugate directions.     

Extension of Hilbert's tenth problem to some algebraic number fields

We extend the solution of Hilbert's tenth problem to algebraic number fields having one pair of complex conjugated embeddings. The proof is based on the extended method of J. Denef used for totally real algebraic number fields.     

Embeddings between grand,small, and variable Lebesgue spaces

We give conditions on the exponent function p( · ) that imply the existence of embeddings between the grand, small, and variable Lebesgue spaces. We construct examples to show that our results are close to optimal. Our work extends recent results by the second author, Rakotoson and Sbordone.     

Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's

We show that Van der Heyden's variable dimension algorithm and Dantzig and Cottle's principal pivoting method require 2ⁿ–1 pivot steps to solve a class of linear complementarity problems of ordern. Murty and Fathi have previously shown that the computational effort required to solve a linear complementarity problem of ordern by Lemke's complementary pivot algorithm or by Murty's Bard-type algorithm is not bounded above by a polynomial inn. Our study shows that the variable dimension algorithm and the principal pivoting method have similar worst case computational requirements.     

某些常微分方程的亚纯解表示与应用

本文运用Nevanlinna值分布理论研究了某些常微分方程亚纯解的存在性. 对于某些具有控制项的常系数常微分方程, 本文得到了亚纯解的表示, 并且给出了求相应偏微分方程精确解的一种方法.作为例子, 本文运用此方法得到了著名的KdV方程的所有亚纯行波精确解. 结果显示该方法比其他方法简单.     

Monotone Piecewise Curve Fitting Algorithms

A piecewise cubic curve fitting algorithm preserving monotonicity of the data without modification of the assigned slopes ig proposed. The algorithm has the same order of convergence as Yan's algorithm [8] and Gasparo-Morandi's algorithm[5] for accurate or O(hq) accurate given data, but it has a more visually pleasing curve than those two algorithms. We also discuss the convergence order of cubic rational interpolation for O(hq) accurate data.