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

数学と化学の学際共同研究と福井プロジェクト

N/A
N/A
Protected

Academic year: 2021

シェア "数学と化学の学際共同研究と福井プロジェクト"

Copied!
8
0
0

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

全文

(1)

有本 茂*1

Massoud Amini

*2

Hao Chen

*3 福田信幸*4

Joseph E. LeBlanc

*5 村上達也*6 成木勇夫*7

Mark Spivakovsky

*8 竹内 茂*9

Keith F. Taylor

*10

Hong Yi Wong

*11 山中 聡*12 横谷正明*13

Peter Zizler

*14

Mathematics and chemistry

interdisciplinary joint research and the Fukui Project XX

Shigeru ARIMOTO, Massoud AMINI, Hao CHEN, Nobuyuki FUKUDA, Joseph E. LEBLANC Tatsuya MURAKAMI, Isao NARUKI, Mark SPIVAKOVSKY, Shigeru TAKEUCHI

Keith F. TAYLOR, Hong Yi WONG, Satoshi YAMANAKA, Masaaki YOKOTANI and Peter ZIZLER

This is the 20th part of the series of articles that records and further develops essentials of the Mathematics and Chemistry Interdisciplinary Symposium 2013 Tsuyama, whose main themes were symmetry, periodicity, and repetition. The symposium was held on April 5th and 6th in Tsuyama city, Okayama, Japan, in conjunction with the Fukui Project and was devoted to the memory of the late Professor Kenichi Fukui (1981 Nobel Prize) who initiated the project. The present series also provides challenging cross-disciplinary problems which are directly related to the Fukui conjecture and to recent carbon nanotube research. Some of these problems are formulated using mathematical language not well known among chemists despite the importance of these notions in elucidating additivity and high-speed asymptotic phenomena in molecules having many repeating identical moieties. Some problems are formulated in terms of Fourier analysis connected to the theory of analytic curves, others are formulated in connection with the Science-Art Multi-angle Network (SAM Network) Project, which seeks to bridge Science and Art (visual, audial, and conceptual) for a creative collaboration, and is an important part of the Fukui Project.

Key Words: the Fukui conjecture, Memoir of Prof. K. Fukui, Unique factorization domain (UFD), Carbon nanotube, Fourier analysis

I Introduction

3. Interaction of Single-Walled Carbon Nanotubes with DNA

Tatsuya Murakami

This is a direct continuation of the article entitled

“Recent Advances in Chirality Enrichment of Single-Walled Carbon Nanotubes” [1] by the present author. In that article, we discussed how single chirality components of semiconducting single-walled carbon nanotubes (s-SWNTs) were enriched from the mixture.

More concretely, such enrichment can be achieved by 原稿受付 平成29921

*1, *12, *13 総合理工学科 *4 総合理工学科非常勤講師

*2 Dept. of Math.Tarbiat Modares University, Iran

*3 Dept. of Fund.Ed., Dalian Neusoft University of Information, China

*5 School of Integrated Studies, Pennsylvania College of Technology USA

*6 富山県立大学 工学部・医薬品工学科

*7 立命館大学 理工学部・数学物理学系・数理科学科・元教授

*8 CNRS and Institute de Mathématiques de Toulouse, France

*9 岐阜大学 教育学部・数学科

*10 Dept. of Math. and Stat., Dalhousie University, Canada

*11 School of Communication, Arts and Social Sciences, Singapore Polytechnic, Singapore

*14 Dept. of Math., Phys., and Eng., Mount Royal University, Canada

(2)

density-gradient ultracentrifugation [2], temperature-controlled gel chromatography [3], and DNA-controlled aqueous two-phase extraction [4]. In this short review, we will focus on interactions of SWNTs with DNA that have been utilized for the last procedure and briefly summarize a few reports on it.

DNA monomers consist of sugar phosphate and bases and are joined together by a phosphodiester linkage between 5’ and 3’ carbon atoms of the sugar moiety to form DNA strands. Single-strand DNA then forms double-strand DNA with the complementary strand via hydrogen bonding between the base moieties. This molecular recognition based on hydrogen bonding has been utilized to construct nano-objects with various geometries [5]. Additionally, the π-stacking interaction between the base moieties stabilizes the double-strand structures and has been utilized for molecular electronics [6]. It should also be noted that DNA strands have amphiphilic nature.

On the basis of the properties of DNA strands mentioned above, Zheng et al. first reported DNA-assisted dispersion of SWNTs [7], in which SWNTs and single-strand DNA were mixed and sonicated in aqueous solution of 0.1 M NaCl. While similar dispersion was achieved with double-strand DNA and total RNA extracted from Saccharomyces cerevisiae and Escherichia coli, 30-mer of poly(T) chemically synthesized was found to be the best dispersant among several homopolymers examined. For the dispersion mechanism of (10,0)-SWNTs with a poly(T), the authors proposed right- or left-handed helical structures of a single-strand DNA around a single tube, in which base moieties orient to stack with the surface of the nanotube and sugar-phosphate moieties orient relatively away from it. In this structure, the binding enthalpy and entropic penalty were estimated to be –1.17 and 0.15 eV•nm–1, respectively, indicating that the binding was enthalpy-driven.

The same group has advanced this technology to separate a synthetic mixture of tubes into individual single chirality components of SWNTs [8]. A breakthrough discovery in this research was that single-strand DNA oligomers of ~10 mer were capable of extremely specific recognition of single-chirality components of SWNTs. Such DNA oligomers were discovered from library DNA oligomers containing 2-4-nucleotide repeats, such as (GT)n and (ATTT)m. With these DNA oligomers, 12 chirality components of semiconducting SWNTs were successfully enriched at a high purity (60–90%). Detailed mechanism of this

enrichment was not clear yet, but in a later report by the same group, recognition ability was found to correlate with binding strength, and it was suggested that a stable secondary structure of DNA oligomers, e.g., a DNA

-barrel structure stabilized by hydrogen bonding between bases on adjacent DNA oligomers, was formed so as to fully cover the tube surface [9].

References

[1] Arimoto, S., Amini, M., Fukuda, N., LeBlanc, J. E., Murakami, T., Naruki, I., Naruki, I., Spivakovsky, M., Takeuchi, S., Taylor, K. F., Yamanaka, S., Yokotani, M. and Zizler, P., Mathematics and Chemistry, 2016, 1–2.

[2] Ghosh, S., Bachilo, S. M. and Weisman, R. B., Nat. Nanotechnol.

2010, 5, 443–450.

[3] Liu, H., Nishide, D., Tanaka, T. and Kataura, H., Nat. Commun. 2011, 2, 309.

[4] Tu, X., Manohar, S., Jagota, A., Zheng, M., Nature 2009, 460, 250–253.

[5] Seeman, N. C., Nature 2003, 421, 427–431.

[6] Arkin, M. R., Stemp, E. D., Holmin, R. E., Barton, J. K., Hörmann, A., Olson, E. J., Barbara, P. F., Science 1996, 273, 475–480.

[7] Zheng, M. Jagota, A., Semke, E. D., Diner, B. A., Mclean, R. S., Lustig, S. R., Richardson, R. E. and Tassi, N. G., Nature 2003, 2, 38–342.

[8] Tu, X., Manohar, S., Jagota, A., Zheng, M., Nature 2009, 460, 250–253.

[9] Roxbury, D., Tu, X., Zheng, M., Jagota, A., Langmuir 2011, 27, 8282–8293.

4. Logical Interface in the Repeat Space Theory (RST) Shigeru Arimoto, Massoud Amini, Hao Chen Nobuyuki Fukuda, Isao Naruki, Mark Spivakovsky Shigeru Takeuchi, Keith F. Taylor, Satoshi Yamanaka

Masaaki Yokotani and Peter Zizler

This is a direct continuation of Section 2 of the previous Part XIX, where we utilized the following Theorem E to give the second proof of Zizler’s Theorem by means of a unifying approach in the RST.

Theorem E. Let denote either the real field , or the complex field . Let X be a normed space over , let B be a Banach space over , and let N B(X, B) be a sequence of bounded linear operators from X to B. Let L denote the topological space with the underlying set {T, F} and the system of open sets oT = {, {F},

(3)

{T, F}}. Consider the mapping : X  L defined by

T if {N()} is convergent, 

() = 

F if {N()} is not convergent.

Suppose that

sup {||N||: N ≥ 1} < 

The following statements are true:

(i)  is continuous.

(ii) If X0 is a subset of X with (X0) = {T}, then

(X0) = {T}.

(iii) If X0 is a dense subset of X with (X0) = {T}, then (X) = {T}. Moreover : X  B defined by () = limN N() is a bounded linear operator:   B(X, B).

Lemma Delta proved in the previous Part XIX is closely related to the Functional Delta Existence Theorem (Functional DET) established in Ref. [1]. The Delta Existence Theorem was indispensable for reducing the proof of the Fukui Conjecture to the problems of resolution of singularities and related methods [2-6], where the notion of UFD (unique factorization domain) played a fundamental role. The reader is referred to Ref.

[1] for the methodological ideas from experimental and empirical chemistry before reading what follows.

Systematic asymptotic analyses on thermodynamic and spectroscopic data were undertaken in [7,8] for a study of correlation between molecular structure and energies in hydrocarbons. The formation of the Functional DET has been highly motivated by Haruo Shingu and Takehiko Fujimoto’s empirical asymptotic principle called ‘the long chain criteria principle’, which was initially derived from the observation on ‘the constancy of isomeric variations of the same kind in the molecular energies of the long chain paraffin hydrocarbons’ (cf. [7,8]).

Reflecting on this principle, we recall from Ref. [1] the following definitions in conjunction with Theorem E reproduced above:

Definitions. Let L denote the topological space with the underlying set {T, F} and the system of open sets oT = {, {F}, {T F}}. The topological space L is called the logical space. Let X, X1, ..., Xn be topological spaces, let

: X  L be a continuous mapping, let 1: X  X1, ..., n:

Xn-1Xn, and n+1: XnL be continuous mappings such that the following diagram is commutative:

X L

1

X1

n+1

X2 . . . . Xn - 1 Xn

2 3 n

that is, such that

 = n+1  ...  1. (4.1) The mapping  is called a logical interface on X. Each i, 1 ≤ i ≤ n +1, is called a component of . Equality (4.1) is called a component analysis of .

We note that the empirical asymptotic principle for the zero-point energy and thermodynamic quantities of molecules having many identical moieties can be mathematically elucidated by using the Functional DET and component analyses of logical interface , whose definition was given above in conjunction with Theorem E.

It was recorded in article [1] that its author (S.A.) recalled with pleasure discussions on the additivity problems of organic compounds with the late Profs.

Kenichi Fukui and Haruo Shingu, especially those valuable discussions on the dialectic and mutually beneficial interplay between theory and experiment, which later lead the author of article [1] to form the following:

(i) the approach using diagrams of arrows [9-14] in the RST,

(ii) the notion of logical interface  which assists in bridging the gap between theoretical and experimental languages in chemistry, and

(iii) the idea and applications of component analyses of . It should be noted that the above (i), (ii), and (iii) have been successfully used not only as research tools in the RST but as communication and / or pedagogical devices for those who are unfamiliar with the physicochemical applications of the RST, which aims to assist in cultivating the fertile interdisciplinary research field

(4)

between chemistry and modern mathematics. Now, in view of the above Logical Interface in the RST, we pose the following challenging problem.

Challenging Problem 1: To prove Theorem 1 stated in Part XIX, which is reproduced below, not via the ALT but via Theorem E.

Theorem 1. Let a, b with a < b, let x(N, k) :=

a + (b – a)k/N, and let f  AC[a, b]. We have

1 N k

f(x(N, k)) = (1/(b – a))(

a

b

f()d)N

+ (1/2)(f(b) – f(a)) + o(1) as N  .

The purpose of the following section is to solve the above challenging problem:

5. Solution of Challenging Problem 1 Shigeru Arimoto, Massoud Amini, Hao Chen Nobuyuki Fukuda, Isao Naruki, Mark Spivakovsky Shigeru Takeuchi, Keith F. Taylor, Satoshi Yamanaka

Masaaki Yokotani and Peter Zizler

Let us first establish the following weaker C1 version of Theorem 1:

Proposition 1. Let a, b with a < b, let x(N, k) :=

a + (b – a)k/N, and let f  C1[a, b]. Then, we have

1 N k

f(x(N, k)) = (1/(b – a))(

a

b

f()d)N

+ (1/2)(f(b) – f(a)) + o(1) as N  .

Proof. Let N  , let k {1, 2, … , N} , and let f  C1(I). Then by Taylor's theorem, there exists a real number Uk  ]x(N, k

1), x(N, k)[ such that

( , )

( , 1) x N k

x N k

f()d = f(x(N, k

1))(b

a)/N + (1/2)f'(Uk)(b

a)2/N2. (5.1) Thus, taking the sum of the above with k running from 1 to N, we have

a

b

f()d = ((b

a)/N)

{

1 N

k f(x(N, k)) + ((f(a)

f(b))

+ (1/2)

1 N

k f'(Uk)(b

a)/N

}

. (5.2)

On the other hand, since f' is continuous thus Riemann integrable on [a, b], one sees that

(1/2)

1 N k

f'(Uk)(b

a)/N (1/2)

a

b

f'()d

= (1/2)(f(b)

f(a)) (5.3) as N , from which the conclusion follows. //

Now we are ready to solve Challenging Problem 1:

Proof of Theorem 1 via Theorem E. Let N: AC(I)  denote the linear functionals defined by

 N(f) =

1 N k

f(x(N, k))

(1/(b

a))( b

a f()d))N, (5.4)

N  .

By what has been proved above

N(f) (1/2)(f(b)

f(a)) (5.5) for all f  C1(I ).

Let f  AC(I). We next prove that

|N(f)| ≤ ||f|| (5.6) for all N  . By the mean value theorem, there exists a real number Uk  ]x(N, k

1), x(N, k)[ such that

( , )

( , 1) x N k

x N k

f()d = f(Uk)(b

a)/N). (5.7)

Therefore, we have (1/(b

a))(

a

b

f()d))N =

1 N

k f(Uk). (5.8)

From this, it follows that

|N(f)| ≤ |

1 N

k f(x(N, k))

1 N k

f(Uk)|

1 N k

{|f(x(N, k))

f(Uk)| + |f(Uk)

f(x(N, k

1))|}

(5)

1 N

k V([x(N, k

1), x(N, k)])(f)

= V([a, b])(f). (5.9)

By the definition of the norm of AC(I), the inequality (5.6) is true for all N  . Applying Theorem E, we see that lim

NN(f) exists for all f  C1(I) = AC(I). Define

: AC(I)  by (f) = lim

NN(f). Then it is easily seen that  is a bounded linear functional. By the continuity of

, one easily gets lim

NN(f) = (1/2)(f(b)

f(a)) for all f

 AC(I ) from which the conclusion follows. //

The following appendix provides the definitions of:

(i) Generalized repeat space Xr(q, d), (ii) Normed repeat space Xr(q, d, p), (iii) Alpha space X(q),

(iv) Beta space X(q), (v) Repeat space Xr(q), (vi) FS map.

This appendix is for all Parts XIX-XXIII.

6. APPENDIX

Review of the Generalized Repeat Space, the Normed Repeat Space, the Alpha Space, the Beta Space, the Repeat Space, and the FS map

Let +, , and respectively, denote the set of all positive integers, real numbers, and complex numbers.

By ‘for all N >> 0’, we mean ‘for all positive integers N greater than some given positive integer’.

I. Generalized Repeat Space

There are several equivalent ways of defining the generalized repeat space Xr(q, d) with a given size (q, d)

++. We shall recall below the definition that uses the notion of the sum of subspaces of a linear space (cf.

Refs. [15-19]).

Fix (q, d)  ++ and let X (q, d) denote the set of all matrix sequences whose N-th term MN is an arbitrary qNd

qNd complex matrix, N  +. This set constitutes a

-algebra over the field with termwise addition {MN} + {MN} = {MN + MN}, (A.1) scalar multiplication

k{MN } = {kMN}, (A.2) multiplication

{MN}{MN} = {MNMN}, (A.3) and involution (

)*: X(q, d)  X(q, d) defined by

{MN}* = {MN*}, (A.4) where the * on the right-hand side of (A.4) denotes the operation of taking the adjoint.

Let PN denote an N  N real-orthogonal matrix given by

PN  0 1

0 1 0

0

0 1

0 0 1

1 0





























.

Let PN a := (PN -1)-a where a  {-2, -3, …}. (Note that PNa

equals the transpose of PN-a .)

Let SN denote an N  N real idempotent matrix given by

SN  1 0

0 0 0 0

0 0

0

0 0 0 0

0 0





























. Let PN n denote the Nd  Nd matrix given by

PN n = PNn 1  PNn 2  ...  PNnd, (A.5) where n = (n1, n2, . . . , nd)  d, and  denotes the Kronecker product.

Let SNk denote the Nd  Nd matrix given by

SNk = SNk 1  SNk 2  ...  SNk d, (A.6) where k = (k1, k2, ..., kd) ( +  {0})d.

Let V k(q, d) with k = (k1, k2, ... , kd)  {0, 1}d denote the subset of X (q, d) defined by

V k(q, d) = {{ MN}  X (q, d): m, n  d,

Q  Mq( ) such that

MN = (PNm SNk PNn) Q for all N >> 0}. (A.7) Let span V k(q, d) with k = (k1, k2, ... , kd)  {0, 1}d denote the linear span of V k(q, d).

We defined three fundamental linear subspaces Xr(q, d), X(q, d), and X(q, d) of X (q, d) by

(6)

Xr(q, d) =

k{0,1}

dspan V k(q, d), (A.8) X(q, d) = span V 0(q, d), (A.9) where

0 = (0, 0, ..., 0)  {0, 1}d, (A.10)

X(q, d) =

k{0,1}d\{0}

span V k(q, d). (A.11)

In (A.8) and (A.11),  denotes the usual sum of subspaces in the obvious manner.

We call Xr(q, d), X(q, d), X(q, d), respectively, the generalized repeat space, generalized alpha space, and generalized beta space of size (q, d), and each element of Xr(q, d), X(q, d), X(q, d), respectively, a generalized repeat sequence, generalized alpha sequence, and generalized beta sequence with size (q, d).

The following is one of the most fundamental theorems in repeat space theory.

Theorem A1. For all q, d +, Xr(q, d) forms a

-algebra.

Proof. This was proved in Ref. [17]. //

For the special definition of the generalized repeat space with size (q, 1), set d =1 in the definition of V k(q, d) given by (A.7) and observe that

X(q, 1) = span V 0(q, 1)

= span {{MN}  X(q, 1) : m  ,

Q  Mq( ) such that MN = PNm Q

for all N >> 0}, (A.12) X(q, 1) = span V 1(q, 1)

= span{{MN}  X(q, 1): m, n  ,

Q  Mq( ) such that MN = (PNmSNPNn) Q

for all N >> 0}, (A.13) and note that

Xr(q, 1) = X(q, 1) + X(q, 1). (A.14)

II. Normed Repeat Space

Let Cn denote the set of all column n-vectors.

For each 1 ≤ p < , let

||||p := ||(1, . . . ,n)T|| p = (|1|p+ ... + |n|p)1/p. (B.1)

Let

|||| =||(1, . . . ,n)T|| = max {|i |: 1  i  n}. (B.2) For each positive integer n and 1 ≤ p ≤ , let Mat(n, p) denote the set of all n n complex matrices with the norm given by

||A||p = sup {||Ax||p/||x||p: x  Cn -{0}}. (B.3) Fix (q, d)  ++ and let X(q, d) denote the set of all matrix sequences whose N-th term MN is an arbitrary qNd

qNd complex matrix, N  +. This set constitutes a

-algebra over the field with termwise addition {MN} + {MN} = {MN + MN}, (B.4) scalar multiplication

k{MN } = {kMN}, (B.5) multiplication

{MN}{MN} = {MNMN}, (B.6) and involution (

)*: X(q, d)  X(q, d) defined by

{MN}* = {MN*}, (B.7)

where the * on the right-hand side of (B.7) denotes the operation of taking the adjoint.

For each q, d  + and 1 ≤ p ≤ , let XB(q, d, p) :=

{{MN} 

N1

Mat(qNd, p): ||{MN}||p :=

sup

N

||MN||p < }. (B.8) Note that XB(q, d, p) is a subalgebra of X(q, d). We also note that XB(q, d, p) forms a Banach algebra for each 1 ≤ p ≤  and a C*-algebra for p = 2. The set XB(q, d, p) is called the bounded underlying space (or B-space for short) of type (q, d, p).

Now recall the definition of generalized repeat space with size (q, d), which is denoted by Xr(q, d) in (A.8).

Theorem B1. For each q, d  + and 1 ≤ p ≤ , we have Xr(q, d)  XB(q, d, p). (B.9) Proof. This was proved in Ref. [20]. //

Definition of the Normed Repeat Space For each q, d  + and 1 ≤ p ≤ , let

Xr(q, d, p) := closure of Xr(q, d)  XB(q, d, p). (B.10)

The set Xr(q, d, p) is called the normed repeat space of type (q, d, p).

Note that Xr(q, d, p) forms a Banach algebra for each 1 ≤ p ≤  and a C*-algebra for p = 2. This fact easily

(7)

follows from the observation that linear operations, multiplication, and involution are all continuous operations and that any closed set in a complete metric space is a complete metric subspace. (The reader is referred e.g. to Refs. [21,22] for the fundamental properties of Banach algebras and C*-algebras.)

III. Alpha Space, Beta Space, Repeat Space, and the FS map

Let q be a positive integer. The repeat space with block-size q, given in the Fukui conjecture (cf. Part XIX of this series) is denoted by Xr(q). Let X(q) denote the set of all matrix sequences whose N-th term is an arbitrary qN  qN real symmetric matrix. Then, one can define, the alpha space X(q) with block-size q, the beta space X(q) with block-size q, and the repeat space Xr(q) with block-size q by using (A.12), (A.13), and (A.14) as follows:

X(q) = X(q)  X(q, 1), (C.1) X(q) = X(q)  X(q, 1), (C.2) Xr(q) = X(q)  Xr(q, 1). (C.3) Note that

Xr(q) = span(X(q) ⋃ X(q))

= X(q) + X(q),

where the linear span is taken in the real linear space X(q).

Note that if {AN}  X(q), there exist a nonnegative integer v and q  q real matrices Q0, Q1, …, Qv, with Q-n

= QnT (n = 0, 1, ..., v), such that AN = v

n

v PNn  Qn (C.4)

for all for all N >> 0.

Fix a q  +, and let h(q) denote the linear space over the field of all q  q Hermitian matrices, and let H(q) denote the set of all mappings F:  h(q), that is, the set of all q  q Hermitian-matrix-valued functions defined on the real line. Let Hf(q)  H(q) denote the subset of all the mappings F that have the form of a finite Fourier series:

F() = v

n

v (exp(in))Qn, (C.5)

where Q-n= QnT (n = 0, 1,..., v),   , v is a nonnegative integer, Q0, Q1,…, Qv are all q  q real matrices and QnT denotes the transpose of Qn.

Define : Xr(q)  Hf(q) by the following procedure.

Given any {MN}  Xr(q), by definition of repeat space, there exist a pair of sequences {AN}  X(q), {BN}  X(q) whose sum equals {MN}, a nonnegative integer v and q  q real matrices Q-v, Q-v +1,…, Qv where Q-n=

QnT (n = 0, 1,..., v), such that for all N >> 0 the N-th term MN of {MN} is expressed as

MN = AN + BN = v

n

v PNn Qn + BN. (C.6)

The mapping is then defined by

 ({MN})() = v

n

v (exp(in))Qn. (C.7)

It is not difficult to see that this mapping is well defined.

(Cf. [23] for a detailed discussion of the mapping .) Given any {MN}  Xr(q), we call

F = ({MN})  Hf(q) (C.8) the FS map associated with the repeat sequence {MN}. A closed interval I  is said to be compatible with F if I contains all the eigenvalues of F() for all   .

References

[1] S. Arimoto, The Functional Delta Existence Theorem and the reduction of a proof of the Fukui conjecture to that of the Special Functional Asymptotic Linearity Theorem, J. Math. Chem. 34 (2003) 287-296.

[2] S. Arimoto, M. Spivakovsky, K.F. Taylor, and P.G. Mezey, Proof of the Fukui conjecture via resolution of singularities and related methods. I, J. Math. Chem. 37 (2005) 75-91.

[3] S. Arimoto, M. Spivakovsky, K.F. Taylor, and P.G. Mezey, Proof of the Fukui conjecture via resolution of singularities and related methods.

II, J. Math. Chem. 37 (2005) 171-189.

[4] S. Arimoto, Proof of the Fukui conjecture via resolution of singularities and related methods. III, J. Math. Chem. 47 (2010) 856-870.

[5] S. Arimoto, M. Spivakovsky, K.F. Taylor, and P.G. Mezey, Proof of the Fukui conjecture via resolution of singularities and related methods.

IV, J. Math. Chem. 48 (2010) 776-790.

[6] S. Arimoto, M. Spivakovsky, E. Yoshida, K.F. Taylor, and P.G. Mezey, Proof of the Fukui conjecture via resolution of singularities and related methods. V, J. Math. Chem. 49 (2011) 1700-1712.

[7] H. Shingu and T. Fujimoto, Bull. Japan Petroleum Inst. 1 (1959) 11.

[8]T. Fujimoto and H. Shingu, Nippon Kagaku Zasshi, 82 (1961) 789-794, 794-799, 945-948, 948-955; 83 (1962) 19, 23-30, 359-363, 364-368.

[9] S. Arimoto and M. Spivakovsky, The Asymptotic Linearity Theorem for the Study of Additivity Problems of the Zero-point Vibrational Energy of Hydrocarbons and the Total Pi-electron Energy of Alternant Hydrocarbons, J. Math. Chem. 13 (1993) 217-247.

[10] S. Arimoto, M. Spivakovsky, K.F. Taylor, Notes on the Asymptotic Linearity Theorems, J. Math. Chem. 8 (1995) 169-177.

[11] S. Arimoto, K. Fukui, K.F. Taylor, and P.G. Mezey, Structural Analysis of Certain Linear Operators Representing Chemical Network

(8)

Systems via the Existence and Uniqueness Theorems of Spectral Resolution. IV, Int. J. Quantum Chem. 67 (1998) 57-69.

[12] S. Arimoto, K. Fukui, P. Zizler, K.F. Taylor, and P.G. Mezey, Structural Analysis of Certain Linear Operators Representing Chemical Network Systems via the Existence and Uniqueness Theorems of Spectral Resolution. V, Int. J. Quantum Chem. 74 (1999) 633-644.

[13] S. Arimoto, M. Spivakovsky, H. Ohno, P. Zizler, K.F. Taylor, T.

Yamabe, and P.G. Mezey, Structural Analysis of Certain Linear Operators Representing Chemical Network Systems via the Existence and Uniqueness Theorems of Spectral Resolution. VI, Int. J. Quantum Chem.

84 (2001) 389-400.

[14] S. Arimoto, M. Spivakovsky, H. Ohno, P. Zizler, R.A. Zuidwijk, K.F.

Taylor, T. Yamabe, and P.G. Mezey, Structural Analysis of Certain Linear Operators Representing Chemical Network Systems via the Existence and Uniqueness Theorems of Spectral Resolution. VII, Int. J. Quantum Chem. 97 (2004) 765-775.

[15] S. Arimoto, K. Fukui, Fundamental Mathematical Chemistry, Interdisciplinary Research in Fundamental Mathematical Chemistry and Generalized Repeat Space, IFC Bulletin, Kyoto, 1998, pp 7-13.

[16] S. Arimoto, Repeat space theory applied to carbon nanotubes and related molecular networks. I, J. Math. Chem. 41 (2007) 231.

[17] S. Arimoto, K. Fukui, P. Zizler, K.F. Taylor, and P.G. Mezey, Structural Analysis of Certain Linear Operators Representing Chemical Network Systems via the Existence and Uniqueness Theorems of Spectral Resolution. V, Int. J. Quantum Chem. 74 (1999) 633-644.

[18] S. Arimoto, M. Spivakovsky, H. Ohno, P. Zizler, K.F. Taylor, T.

Yamabe, and P.G. Mezey, Structural Analysis of Certain Linear Operators Representing Chemical Network Systems via the Existence and Uniqueness Theorems of Spectral Resolution. VI, Int. J. Quantum Chem. 84 (2001) 389-400.

[19] S. Arimoto, M. Spivakovsky, H. Ohno, P. Zizler, R.A. Zuidwijk, K.F.

Taylor, T. Yamabe, and P.G. Mezey, Structural Analysis of Certain Linear Operators Representing Chemical Network Systems via the Existence and Uniqueness Theorems of Spectral Resolution. VII, Int. J. Quantum Chem. 97 (2004) 765-775.

[20] S. Arimoto, Normed repeat space and its super spaces: fundamental notions for the second generation Fukui project, J. Math. Chem. 46 (2009) 586-591.

[21] J.B. Conway, A course in Functional Analysis (Springer, New York, 1985).

[22] C. Constantinescu, C*-Algebras, Vol. 2 and 3 (Elsevier, Amsterdam, 2001).

[23] S. Arimoto and G.G. Hall, Int. J. Quant. Chem. 41 (1992) 613.

参照

関連したドキュメント

Inverse problem to determine the order of a fractional derivative and a kernel of the lower order term from measurements of states over the time is posed.. Existence, uniqueness

Shen, “A note on the existence and uniqueness of mild solutions to neutral stochastic partial functional differential equations with non-Lipschitz coefficients,” Computers

A bounded linear operator T ∈ L(X ) on a Banach space X is said to satisfy Browder’s theorem if two important spectra, originating from Fredholm theory, the Browder spectrum and

We study several choice principles for systems of finite character and prove their equivalence to the Prime Ideal Theorem in ZF set theory without Axiom of Choice, among them

Based on the proposed hierarchical decomposition method, the hierarchical structural model of large-scale power systems will be constructed in this section in a bottom-up manner

Amount of Remuneration, etc. The Company does not pay to Directors who concurrently serve as Executive Officer the remuneration paid to Directors. Therefore, “Number of Persons”

Photo Library キャンパスの夏 ひと 人 ひと 私たちの先生 神学部  榎本てる子ゼミ SKY SEMINAR 人間福祉学部教授 今井小の実

2020年 2月 3日 国立大学法人長岡技術科学大学と、 防災・減災に関する共同研究プロジェクトの 設立に向けた包括連携協定を締結. 2020年