A self-catenated network containing unprecedented 0D + 2D → 2D polycatenation array
Gong‐Ming SunFeng LuoYu‐Mei SongXiao-Zhao TianHai-Xiao HuangYan ZhuZi-Jun YuanXue-feng FengMing‐Biao LuoShujuan LiuWenyuan Xu
36
Citation
30
Reference
10
Related Paper
Citation Trend
Abstract:
Herein, we report a new acylamide ligand and its application in the construction of a metal–organic framework. The resultant acylamide metal–organic framework, namely [Zn2(L)(OH)(btc)]n (1, L = N1,N4-bis(pyridin-3-ylmethyl) naphthalene-1,4-dicarboxamide, H3btc = benzene-1,3,5-tricarboxylic acid), was obtained by hydrothermal synthesis. The outstanding structural feature of it is the 0D + 2D → 2D polycatenation array containing a self-catenated feature which has never previously been observed. To the best of our knowledge, the coexistence of self-catenation and polycatenation phenomena is highly exceptional.Keywords:
Catenation
Feature (linguistics)
A language $L$ is the orthogonal catenation of languages $L_1$ and $L_2$ if every word of $L$ can be written in a unique way as a catenation of a word in $L_1$ and a word in $L_2$. We establish a tight bound for the state complexity of orthogonal catenation of regular languages. The bound is smaller than the bound for arbitrary catenation.
Catenation
Cite
Citations (1)
석탄유도화합물인 Benzene, Cyclohexane, Naphthalene, Biphenyl이 이루는 Benzene-Naphthalene, Benzene-Biphenyl, Cyclohexane-Naphthalene 그리고 Cyclohexane-Biphenyl의 이성분계의 포화용해도를 측정하고, 이들 이성분계들의 고-액 상평형도를 완성하였다. 이들 계의 포화용해도는 Scatchard-Hildebrand Regular Solution Theory로써 정확히 예측할 수 있음을 보였다.
Biphenyl
Cite
Citations (0)
Cite
Citations (7)
The Solubility of (Biphenyl, Naphthalene)–(Benzene, Cyclohexane, 1-Octanol) Binary Mixtures in Water
Abstract The solubility in water at 25 °C of binary mixed solutes, combinations of biphenyl and naphthalene with benzene, cyclohexane, and 1-octanol, was measured using a shake-flask method. As a function of biphenyl or naphthalene mole fraction, activity coefficients of biphenyl and naphthalene in benzene, cyclohexane, and 1-octanol, and those of benzene in biphenyl–benzene and naphthalene–benzene binary systems have been determined.
Biphenyl
Cite
Citations (3)
We investigate the problem of decomposing a language into a catenation of nontrivial languages, none of which can be decomposed further. In many cases this leads to the operation of an ordered catenation closure, introduced in this paper. We study properties of this operation, as well as its iterations. Special emphasis is on laid on ordered catenation closures of finite languages. It is also shown that if an infinite language is a code or a length code, then its ordered catenation closure does not possess a finite decomposition of indecomposable factors.
Catenation
Closure (psychology)
Code (set theory)
Cite
Citations (0)
This paper is a continuation of our research work on state complexity of combined operations. Motivated by applications, we study the state complexities of two particular combined operations: catenation combined with star and catenation combined with reversal. We show that the state complexities of both of these combined operations are considerably less than the compositions of the state complexities of their individual participating operations.
Catenation
Combined operations
Continuation
Star (game theory)
Cite
Citations (14)
Azulene
Induction period
Cite
Citations (1)
In this paper, we show that, due to the structural properties of the resulting automaton obtained from a prior operation, the state complexity of a combined operation may not be equal but close to the mathematical composition of the state complexities of its component operations. In particular, we provide two witness combined operations: reversal combined with catenation and star combined with catenation.
Catenation
Combined operations
Star (game theory)
Cite
Citations (3)
The notions of power of word, periodicity and primitivity are intrinsically connected to the operation of catenation, that dynamically generates word repetitions. When considering generalizations of the power of a word, other operations will be the ones that dynamically generate such pseudo-repetitions. In this paper we define and investigate the operation of θ-catenation that gives rise to the notions of θ-power (pseudopower) and θ-periodicity (pseudo-periodicity). We namely investigate the properties of θ-catenation, its connection to the previously defined notion of θ-primitive word, briefly explore closure properties of language families under θ-catenation and language operations involving this operation, and propose Abelian catenation as the operation that generates Abelian powers of words.
Catenation
Closure (psychology)
Cite
Citations (2)
In this paper, we study the state complexities of two particular combinations of operations: catenation combined with union and catenation combined with intersection. We show that the state complexity of the former combined operation is considerably less than the mathematical composition of the state complexities of catenation and union, while the state complexity of the latter one is equal to the mathematical composition of the state complexities of catenation and intersection.
Catenation
Combined operations
Cite
Citations (19)