#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2006

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- William Y. C. Chen, Amy M. Fu, Iris F. Zhang
- Discrete Mathematics
- 2009

We observe that the classical Faulhaber’s theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression a+b, a+2b, . . . , a+nb is a polynomial in na+ n(n + 1)b/2. While this assertion can be deduced from the original Fauhalber’s theorem, we give an alternative formula in terms of… (More)

- Xian-Fu Zhang, Iris Zhang, Lihong Liu
- Photochemistry and photobiology
- 2010

The fluorescence quantum yield (Phi(f)), fluorescence lifetime (tau(f)), intersystem crossing quantum yield (Phi(isc)) and redox potentials of seven halogenated fluoresceins in their dianion forms were measured and compared in methanol to get a deep insight into the effect of halogeno atoms on their photophysics. It is found that the heavy atom effect alone… (More)

- William Y. C. Chen, David G. L. Wang, Iris F. Zhang
- Eur. J. Comb.
- 2009

We introduce the notion of arithmetic progression blocks or m-AP-blocks of Zn, which can be represented as sequences of the form (x, x+m,x+2m, . . . , x+ (i−1)m) (mod n). Then we consider the problem of partitioning Zn into m-APblocks. We show that subject to a technical condition, the number of partitions of Zn into m-AP-blocks of a given type is… (More)

- Amy M. Fu, Iris F. Zhang
- Graphs and Combinatorics
- 2010

- Iris Zhang
- 2016

In the past decade, the complexity of video games have increased dramatically and so have the complexity of software systems behind them [7]. The difficulty in designing and testing games invariably leads to bugs that manifest themselves across funny video reels on graphical glitches and millions of submitted support tickets [8] [12]. This paper presents an… (More)

Abstract. We show that the classical Faulhaber’s theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression a + b, a + 2b, . . . , a + nb is a polynomial in na+ n(n+ 1)b/2. The coefficients of these polynomials are given in terms of the Bernoulli polynomials. Following Knuth’s… (More)

- ‹
- 1
- ›