• 検索結果がありません。

Frontispiece Relief Sculpture of Śākyamuni Buddha

N/A
N/A
Protected

Academic year: 2021

シェア "Frontispiece Relief Sculpture of Śākyamuni Buddha"

Copied!
3
0
0

読み込み中.... (全文を見る)

全文

(1)

For copyright reasons, the frontispiece and all other illustrations in this volume have been blacked out. We are in the process of applying for permission to reproduce these illustrations electronically. Once permission is gained, the illustrations will be made available. We apologize for the inconvenience.

(2)
(3)

RELIEF SCULPTURE OF ŚĀKYAMUNI BUDDHA

A relief sculpture of Śākyamuni Buddha lying in the nirvana position while the itinerant hermit Subhadra, his last convert, sits in silent meditation. Gandhāra, second century CE. The sculpture is held by the Freer Gallery of Art, Washing-ton, DC, and permission to use this photograph is gratefully acknowledged.

参照

関連したドキュメント

The input specification of the process of generating db schema of one appli- cation system, supported by IIS*Case, is the union of sets of form types of a chosen application system

The torsion free generalized connection is determined and its coefficients are obtained under condition that the metric structure is parallel or recurrent.. The Einstein-Yang

We present sufficient conditions for the existence of solutions to Neu- mann and periodic boundary-value problems for some class of quasilinear ordinary differential equations.. We

Analogs of this theorem were proved by Roitberg for nonregular elliptic boundary- value problems and for general elliptic systems of differential equations, the mod- ified scale of

Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A

Definition An embeddable tiled surface is a tiled surface which is actually achieved as the graph of singular leaves of some embedded orientable surface with closed braid

Correspondingly, the limiting sequence of metric spaces has a surpris- ingly simple description as a collection of random real trees (given below) in which certain pairs of

, n is called a recursive tree if the vertex labelled 1 is the root and, for all 2 ≤ k ≤ n, the sequence of vertex labels in the path from the root to k is increasing (Stanley