Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

Zeros of orthogonal polynomials

Concrete mathematics, a foundation for computer science, by Ronald L. Graham, Donald E. Knuth and Oren Patashnik. Pp 625. £24·95. 1989. ISBN 0-201-14236-8 (Addison-Wesley)

Determine the value of the variable in each equation.

Basic Algebra = 代数学入門

In this paper I present a history of tractability of continuous problems, which has its beginning in the successful numerical tests for highdimensional integration of finance problems. Tractability results will be illustrated for two multivariate problems, integration and linear tensor products problems, in the worst case setting. My talk at FoCM'08 in Hong Kong and this paper are based on the book Tractability of Multivariate Problems , written jointly with Erich Novak. The first volume of our book has been recently published by the European Mathematical Society. Introduction Many people have recently become interested in studying the tractability of continuous problems. This area of research addresses the computational complexity of multivariate problems defined on spaces of functions of d variables, with d that can be in the hundreds or thousands; in fact, d can even be arbitrarily large. Such problems occur in numerous applications including physics, chemistry, finance, economics, and the computational sciences. As with all problems arising in information-based complexity, we want to solve multivariate problems to within ∈, using algorithms that use finitely many functions values or values of some linear functionals. Let n (∈, d ) be the minimal number of function values or linear functionals that is needed to compute the solution of the d -variate problem to within ∈. For many multivariate problems defined over standard spaces of functions n (∈, d ) is exponentially large in d .

Tractability of Multivariate Problems

Let G be a finite additive abelian group with exponent exp(G)=n>1 and let A be a nonempty subset of {1,...,n-1}. In this paper, we investigate the smallest positive integer $m$, denoted by s_A(G), such that any sequence {c_i}_{i=1}^m with terms from G has a length n=exp(G) subsequence {c_{i_j}}_{j=1}^n for which there are a_1,...,a_n in A such that sum_{j=1}^na_ic_{i_j}=0. 
When G is a p-group, A contains no multiples of p and any two distinct elements of A are incongruent mod p, we show that s_A(G) is at most $\lceil D(G)/|A|\rceil+exp(G)-1$ if |A| is at least (D(G)-1)/(exp(G)-1), where D(G) is the Davenport constant of G and this upper bound for s_A(G)in terms of |A| is essentially best possible. 
In the case A={1,-1}, we determine the asymptotic behavior of s_{{1,-1}}(G) when exp(G) is even, showing that, for finite abelian groups of even exponent and fixed rank, s_{{1,-1}}(G)=exp(G)+log_2|G|+O(log_2log_2|G|) as exp(G) tends to the infinity. Combined with a lower bound of $exp(G)+sum{i=1}{r}\lfloor\log_2 n_i\rfloor$, where $G=\Z_{n_1}\oplus...\oplus \Z_{n_r}$ with 1<n_1|... |n_r, this determines s_{{1,-1}}(G), for even exponent groups, up to a small order error term. Our method makes use of the theory of L-intersecting set systems. 
Some additional more specific values and results related to s_{{1,-1}}(G) are also computed.

On weighted zero-sum sequences

We mainly introduce two new kinds of numbers given by $$R_n=\sum_{k=0}^n\binom nk\binom{n+k}k\frac1{2k-1}\quad\ (n=0,1,2,...)$$ and $$S_n=\sum_{k=0}^n\binom nk^2\binom{2k}k(2k+1)\quad\ (n=0,1,2,...).$$ We find that such numbers have many interesting arithmetic properties. For example, if $p\equiv1\pmod 4$ is a prime with $p=x^2+y^2$ (where $x\equiv1\pmod 4$ and $y\equiv0\pmod 2$), then $$R_{(p-1)/2}\equiv p-(-1)^{(p-1)/4}2x\pmod{p^2}.$$ Also, $$\frac1{n^2}\sum_{k=0}^{n-1}S_k\in\mathbb Z\ \ {and}\ \ \frac1n\sum_{k=0}^{n-1}S_k(x)\in\mathbb Z[x]\quad{for all}\ n=1,2,3,...,$$ where $S_k(x)=\sum_{j=0}^k\binom kj^2\binom{2j}j(2j+1)x^j$. For any positive integers $a$ and $n$, we show that $$\frac1{n^2}\sum_{k=0}^{n-1}(2k+1)\binom{n-1}k^a\binom{-n-1}k^a\in\mathbb Z\ \ {and} \ \ \frac 1n\sum_{k=0}^{n-1}\frac{\binom{n-1}k^a\binom{-n-1}k^a}{4k^2-1}\in\mathbb Z.$$ We also pose several conjectures for further research.

Two new kinds of numbers and related divisibility results

Let $p>3$ be a prime and let $a$ be a positive integer. We show that if $p\equiv1\pmod 4$ or $a>1$ then $$\sum_{k=0}^{\lfloor\frac34p^a\rfloor}\frac{\binom{2k}k^2}{16^k}\equivl(\frac{-1}{p^a}\r)\pmod{p^3}$$ with $(-)$ the Jacobi symbol, which confirms a conjecture of Z.-W. Sun. We also establish the following new congruences: \begin{align*}\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k\binom{3k}k}{27^k}\equiv&l(\frac p3\r)\frac{2^p+1}3\pmod{p^2}, \\\sum_{k=0}^{(p-1)/2}\frac{\binom{6k}{3k}\binom{3k}k}{(2k+1)432^k}\equiv&l(\frac p3\r)\frac{3^p+1}4\pmod{p^2}, \\\sum_{k=0}^{(p-1)/2}\frac{\binom{4k}{2k}\binom{2k}k}{(2k+1)64^k}\equiv&l(\frac{-1}p\r)2^{p-1}\pmod{p^2}. \end{align*} Note that in 2003 Rodriguez-Villeguez posed conjectures on $$\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{16^k},\ \sum_{k=0}^{p-1}\frac{\binom{2k}k\binom{3k}k}{27^k},\ \sum_{k=1}^{p-1}\frac{\binom{4k}{2k}\binom{2k}k}{64^k},\ \sum_{k=1}^{p-1}\frac{\binom{6k}{3k}\binom{3k}k}{432^k}$$ modulo $p^2$ which were later proved.

New congruences involving products of two binomial coefficients

On value sets of polynomials over a field

A positive integer n is called a covering number if there are some distinct divisors n1,... ,nk of n greater than one and some integers a1,... ,ak such that Z is the union of the residue classes a1(mod n1),... ,ak(mod nk). A covering number is said to be primitive if none of its proper divisors is a covering number. In this paper we give some su! cient conditions for n to be a (primitive) covering number; in particular, we show that for any r = 2,3,... there are infinitely many primitive covering numbers having exactly r distinct prime divisors. In 1980 P. Erd˝s asked whether there are infinitely many positive integers n such that among the subsets of Dn = {d ! 2 : d | n} only Dn can be the set of all the moduli in a cover of Z with distinct moduli; we answer this question a! rmatively. We also conjecture that any primitive covering

Zhi-Wei Sun

Papers

On weighted zero-sum sequences

Two new kinds of numbers and related divisibility results

New congruences involving products of two binomial coefficients

On value sets of polynomials over a field

On covering numbers