广义Fibonacci数列一些前n项和式初等证明

用数学初等方法证明了广义Fibonacci数列的相差小于6的前n项的和式,从而就能得到Fibonacci数列、Lucas数列的相差小于6的前n项的和式,通过这些数列的通项就能轻松计算其值。

和式极限求法初探

本文着重介绍了三种计算和式极限的方法 :构造母函数法、利用Toeplitz定理或Stolz定理求和式极限 。

对称函数的d_j图表示及其应用

根据对称函数的性质,在对称函数K图/bj图的基础上提出了部分对称函数/全对称函数的dj图表示.给出了利用对称函数dj图检测对称性的方法,并以实例加以说明.与传统方法相比,该法使基于逻辑函数对称性的逻辑设计较传统设计更简单、更有效.

关于求极限的一类问题的研究

本文通过对具体题目的分析求解,给出一类和式极限问题的解决方法,同时将所有思路与方法做出归纳与总结,并进而给予推广.

Some Discussions on Parallel Bounded Batch Scheduling to Minimize the Sum of Squared Machine Loads

We sttidy the problem of scheduling n jobs on m parallel bounded batch machines to minimize the sum of squared machine loads. Each batch contains at most B jobs, and the processing time of a batch is equal to the longest processing time of the jobs in this batch. We prove this problem to be NP-hard. Furthermore, we present a polynomial time approximation scheme （PTAS） and a fully polynomial time approximation scheme （FPTAS） for this problem.

The Relation on the Coefficients and Roots of Adjoint Polynomial and Its Application

The parameter R（G） is the function about the front three coeffcients of the adjoint polynomial of graph G. In the paper, the range of R（G） is given when β（G） 〈 β（Dn）, where β（G） is the minimum root of the adjoint polynomial of graph G and the chromatically equivalent classification of tDn is completely depicted.Furthermore, a sufficient and necessary condition for the class of graphs to be chromatically unique is obtained.

A novel hybrid algorithm based on a harmony search and artificial bee colony for solving a portfolio optimization problem using a mean-semi variance approach

Portfolio selection is one of the major capital allocation and budgeting issues in financial management, and a variety of models have been presented for optimal selection. Semi-variance is usually considered as a risk factor in drawing up an efficient frontier and the optimal portfolio. Since semi-variance offers a better estimation of the actual risk portfolio, it was used as a measure to approximate the risk of investment in this work. The optimal portfolio selection is one of the non-deterministic polynomial(NP)-hard problems that have not been presented in an exact algorithm, which can solve this problem in a polynomial time. Meta-heuristic algorithms are usually used to solve such problems. A novel hybrid harmony search and artificial bee colony algorithm and its application were introduced in order to draw efficient frontier portfolios. Computational results show that this algorithm is more successful than the harmony search method and genetic algorithm. In addition, it is more accurate in finding optimal solutions at all levels of risk and return.

The Hybrid Power Mean Involving the Character Sum of Polynomials and a Sum Analogous to Kloosterman Sum

The main purpose of this paper is using the properties of the classical Gauss sum and the analytic methods to study the computational problem of one kind of hybrid power mean involving the character sum of polynomials and a sum analogous to Kloosterman sum mod p,an odd prime,and give two sharp asymptotic formulae for them.

SOME SEMI-BENT FUNCTIONS WITH POLYNOMIAL TRACE FORM

This paper is devoted to the study of semi-bent functions with several parameters flexible on the finite field F2n.Boolean functions defined on F2n of the form f（r）ab（x） =Trn1（axr（2m-1））＋Tr41（bx（2n-1）/5） and the form g（rs）abcd（x）=Trn1（axr（2m-1））＋Tr41（bx（2n-1）/5）＋Trn1（cx（2m-1）1/2＋1）＋Trn1（dx（2m-1）s＋1） where n = 2m,m = 2（mod 4）,a,c ∈ F2n,and b ∈ F（16）,d ∈ F2,are investigated in constructing new classes of semi-bent functions.Some characteristic sums such as Kloosterman sums and Weil sums are employed to determine whether the above functions are semi-bent or not.

The growth of H-harmonic functions on the Heisenberg group

We discuss the relationship between the frequency and the growth of H-harmonic functions on the Heisenberg group.Precisely,we prove that an H-harmonic function must be a polynomial if its frequency is globally bounded.Moreover,we show that a class of H-harmonic functions are homogeneous polynomials provided that the frequency of such a function is equal to some constant.

Quasi-binomial coefficients stemming from Nakayama algebras

It is known that there is a very closed connection between the set of non-isomorphic indecomposable basic Nakayama algebras and the set of admissible sequences.To determine the cardinal number of all nonisomorphic indecomposable basic Nakayama algebras,we describe the cardinal number of the set of all t-length admissible sequences using a new type of integers called quasi-binomial coefficients.Furthermore,we find some intrinsic relations among binomial coefficients and quasi-binomial coefficients.

A UNIFORM GROWTH ESTIMATES OF SOLUTIONS OF ASYMPTOTICALLY ELLIPTIC OPERATORS

This paper introduces a generic eigenvalue flow of a parameter family of operators, where the corresponding eigenfunction is continuous in parameters. Then the author applies the result to the study of polynomial growth L-harmonic functions. Under the assumption that the operator has some weakly conic structures at infinity which is not necessarily unique, a Harnack type uniform growth estimate is obtained.