Non‐empirical calculations of NMR indirect carbon–carbon coupling constants. Part 4: Bicycloalkanes

A systematic study of the one‐bond and long‐range J(C,C), J(C,H) and J(H,H) in the series of nine bicycloalkanes was performed at the SOPPA level with special emphasis on the coupling transmission mechanisms at bridgeheads. Many unknown couplings were predicted with high reliability. Further refinement of SOPPA computational scheme adjusted for better performance was carried out using bicyclo[1.1.1]pentane as a benchmark to investigate the influence of geometry, basis set and electronic correlation. The calculations performed demonstrated that classical ab initio SOPPA applied with the locally dense Dunning's sets augmented with inner core s‐functions used for coupled carbons and Sauer's sets augmented with tight s‐functions used for coupled hydrogens performs perfectly well in reproducing experimental values of different types of coupling constants (the estimated reliability is ca 1–2 Hz) in relatively large organic molecules of up to 11 carbon atoms. Additive coupling increments were derived for J(C,C), J(C,H) and J(H,H) based on the calculated values of coupling constants within SOPPA in the model bicycloalkanes, in reasonably good agreement with the known values obtained earlier on pure empirical grounds. Most of the bridgehead couplings in all but one bicycloalkane appeared to be essentially additive within ca 2–3 Hz while bicyclo[1.1.1]pentane demonstrated dramatic non‐additivity of ?14.5 Hz for J(C,C), +16.6 Hz for J(H,H) and ?5.5 Hz for J(C,H), in line with previous findings. Non‐additivity effects in the latter compound established at the SOPPA level should be attributed to the through‐space non‐bonded interactions at bridgeheads due to the essential overlapping of the bridgehead rear lobes which provides an additional and effective non‐bonding coupling path for the bridgehead carbons and their protons in the bicyclopentane framework. Copyright © 2003 John Wiley & Sons, Ltd.     

Positive set‐operators of low complexity

The powerset operator, ??, is compared with other operators of similar type and logical complexity. Namely we examine positive operators whose defining formula has a canonical form containing at most a string of universal quantifiers. We call them ?‐operators. The question we address in this paper is: How is the class of ?‐operators generated ? It is shown that every positive ?‐operator Γ such that Γ(??) ≠ ??, is finitely generated from ??, the identity operator Id, constant operators and certain trivial ones by composition, ∪ and ∩. This extends results of [3] concerning bounded positive operators.     

Molecular Orbital Calculations on 2, 4, 6-Trinitrotoluene

Three ab initio calculations (HF/6-3IG, HF/6-3IG*, and HF/6-3IG**) on 2,4,6-trinitrotoluene were made, The results compare well with xray data, except dihedral angles of NO₂ relative to the plane of the benzene ring. The deviations are attributed to packing forces and steric effects in the crystal. The most stable structure was a torsional angle 10° of the methyl top with the benzene ring, unlike toluene. The rotational barriers of the methyl top and the 4-nitro group are small. Hydrogen bonding, dipole moments and total atomic charges arc calculated.     

A rigid graph for every set

A graph G is called rigid if the identical mapping V(G)→V(G) is the only homomorphism G→G. In this note we give a simple construction of a rigid oriented graph on every set. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 108–110, 2002     

Bases,spanning sets,and the axiom of choice

Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?₂ has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Rough隶属函数关于集合并与交的一种高精度计算方法

近些年来，许多处理近似问题的方法陆续被提出，其中利用Rough集理论计算两个集合的并和交的Rough隶属函数方法是被用较多的一种方法，但毕竟该方法精度较差。为此，介绍了一种精度较高的计算两个集合的并和交的Rough隶属函数方法，它克服了前者利用Rough集理论计算Rough隶属函数的复杂性，而迎来了简单和高精度的特点。     

Difference Sets and Recursion Theory

There is a recursive set of natural numbers which is the difference set of some recursively enumerable set but which is not the difference set of any recursive set.     

The Maximal Closed Classes of Unary Functions in p-Valued Logic

In many-valued logic the decision of functional completeness is a basic and important problem, and the thorough solution to this problem depends on determining all maximal closed sets in the set of many-valued logic functions. It includes three famous problems, i.e., to determine all maximal closed sets in the set of the total, of the partial and of the unary many-valued logic functions, respectively. The first two problems have been completely solved ([1], [2], [8]), and the solution to the third problem boils down to determining all maximal subgroups in the k-degree symmetric group S_k, which is an open problem in the finite group theory. In this paper, all maximal closed sets in the set of unary p-valued logic functions are determined, where p is a prime. Mathematics Subject Classification: 03B50, 20B35.     

Basis Set Orbital Relaxation in Atomic and Molecular Hydrogen Systems

Orbital relaxation (OR) amounts to variation of the orbital exponents in hydrogen molecules and ions relative to the exponents of the isolated atom; it is represented as the sum of the one- and two-center contributions depending on the effective atomic charge and on the presence of other atoms in the molecule. The procedure for isolating the contributions of the exponent includes treatment of the OR of hydrogen in a special set of neutral and charged atoms and molecules with certain multiplicities of their electronic states. Within the framework of the spin-unrestricted Hartree-Fock method, we found and discussed the optimal values of the exponents of the basis orbitals of hydrogen atoms and molecules using the minimal split valence-shell basis set, the basis set that includes the polarization function, and the expanded set of grouped natural orbitals. A simple energy model is suggested for OR. Expressions are derived for evaluating the exponents of the relaxed orbitals in hydrogen-containing systems.Original Russian Text Copyright © 2004 by A. I. Ermakov, A. E. Merkulov, A. A. Svechnikova, and V. V. Belousov__________Translated from Zhurnal Strukturnoi Khimii, Vol. 45, No. 6, pp. 973–978, November–December, 2004.     

From Chaos to Ordering: New Studies in the Shannon Entropy of 2D Patterns

Properties of the Voronoi tessellations arising from random 2D distribution points are reported. We applied an iterative procedure to the Voronoi diagrams generated by a set of points randomly placed on the plane. The procedure implied dividing the edges of Voronoi cells into equal or random parts. The dividing points were then used to construct the following Voronoi diagram. Repeating this procedure led to a surprising effect of the positional ordering of Voronoi cells, reminiscent of the formation of lamellae and spherulites in linear semi-crystalline polymers and metallic glasses. Thus, we can conclude that by applying even a simple set of rules to a random set of seeds, we can introduce order into an initially disordered system. At the same time, the Shannon (Voronoi) entropy showed a tendency to attain values that are typical for completely random patterns; thus, the Shannon (Voronoi) entropy does not distinguish the short-range ordering. The Shannon entropy and the continuous measure of symmetry of the patterns demonstrated the distinct asymptotic behavior, while approaching the close saturation values with the increase in the number of iteration steps. The Shannon entropy grew with the number of iterations, whereas the continuous measure of symmetry of the same patterns demonstrated the opposite asymptotic behavior. The Shannon (Voronoi) entropy is not an unambiguous measure of order in the 2D patterns. The more symmetrical patterns may demonstrate the higher values of the Shannon entropy.