In the present paper we investigate the precise large deviations for heavy-tailed random sums. First, we obtain a result which improves the relative result in Kluppelberg and Mikosch (J. Appl.… Expand

Combined analyses of deep tow magnetic anomalies and International Ocean Discovery Program Expedition 349 cores show that initial seafloor spreading started around 33 Ma in the northeastern South… Expand

We consider a canonical Ramsey type problem. An edge-coloring of a graph is called m-good if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G)… Expand

A k-uniform linear path of length ℓ, denoted by ℙℓ(k), is a family of k-sets {F1,...,F℗ such that |Fi ∩ Fi+1|=1 for each i and Fi ∩ Fbj = $\not 0$.Expand

We show that, in fact, there exists a positive constant c such that A/sub 2/(n, d)/spl ges/c2/sup n//V(n,d-1) is the maximum size of a binary code of length n and minimum distance d.Expand

We apply the delta system method, particularly tools from [11] and [8], to determine, for all k ≥ 5 and large n, the Turán numbers of certain hypergraphs called k-uniform linear cycles.Expand

Coring/logging data and physical property measurements from International Ocean Discovery Program Expedition 349 are integrated with, and correlated to, reflection seismic data to map seismic… Expand

We prove that the Turan number $ex(n,H^{(p)})$ is the maximum number of edges in an $n$-vertex simple graph that does not contain $F$ as a subgraph.Expand

Integrated Ocean Drilling Program (IODP) Expedition 316 Sites C0006 and C0007 examined the deformation front of the Nankai accretionary prism offshore the Kii Peninsula, Japan. In the drilling area,… Expand