Pressure-temperature phase diagrams of smectogenic 4'-alkyl-4-cyanobiphenyls (9CB, 10CB, 11CB and 12CB)

The pressure-temperature ( p - T ) phase diagrams for four smectogenic members of the 4'-alkyl-4-cyanobiphenyl homologous series ( n CB, n =9, 10, 11 and 12) over the temperature range 320-410 K and pressure range 0.1-300 MPa (3 kbar) were constructed using DTA. At 1 atm 9CB exhibits nematic and smectic A d phases, while the other members show only the smectic A d phase. However, at elevated pressures the clearing line splits in the case of 10CB and 11CB which indicates the induction of a nematic phase. It was found that the triple point, where the isotropic, nematic and smectic phases coexist, is strongly shifted to higher pressures with increasing chain length. This was interpreted as being caused by a loss of the rod-like shape of the molecules containing longer alkyl tails which explore a range of conformations. The slope of the clearing line, d T /d p , depends strongly on the length of the alkyl chain for the n CB series, but does not show a step-wise change between the nematogenic and smectogenic members.     

Synthesis of 1,3-Bis(trialkylammonio)-2-propanol Dihalides Exhibiting Retardant Activity toward Rape

1,3-Bis(trialkylammonio)-2-propanol dihalides were prepared, and their retardant activity was studied in relation to the chemical structure.     

Partitions of a Polytope and Mappings of a Point Set to Facets

Three theorems of this paper generalize previous results of the author on conjectures of A. Bezdek and V.V. Proizvolov. They show the existence of mappings from a given point set to the set of facets of a given polytope that satistfy some special conditions. Developing the same technique, some results on convex polytope partitions are presented, two of them dealing with partitions with prescribed measures of parts. Then we prove a corollary on the existence of a possibly nonconvex polytope with a given set of vertices, containing given points in its interior. We also consider problems of the following type: find an assignment of vectors from a given set to the parts of a given convex partition of ℝⁿ so that the shifts of the parts by their corresponding vectors either do not intersect by interior points or cover ℝⁿ     

A remark on Lorentz algebras

We consider the class of Euclidean algebras associated to Minkowski light cones and called Lorentz algebras. We prove that in Lorentz algebras the estimate ∥P(a,b) ∥_∞≥(√2-1) ∥a∥_∞ ∥b∥_∞ is valid for the spectral norm and is therefore independent of the dimension of the Lorentz algebra.     

An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle

We prove lower bounds of the form exp(n^{ε d}), ε_d > 0, on the length of proofs of an explicit sequence of tautologies, based on the Pigeonhole Principle, in proof systems using formulas of depth d, for any constant d. This is the largest lower bound for the strongest proof system, for which any superpolynomial lower bounds are known.     

Model of free charge generation in polymers

A time solution of the excimer-ion pair system is presented here with a special attention to the time asymptote. Presented at the Czech-Israeli-German Symposium “Dynamical Processes in Condensed Molecular Systems”, Prague, Czech Republic, 26–30 May 1997. This work was supported by the grant No. C 1050601 of the Grant Agency of the Academy of Sciences of the Czech Republic.     

Interpolation by a Game

We introduce a notion of a real game (a generalisation of the Karchmer-Wigderson game (cf. [3]) and of real communication complexity, and relate this complexity to the size of monotone real formulas and circuits. We give an exponential lower bound for tree-like monotone protocols (defined in [4, Definition 2.2]) of small real communication complexity solving the monotone communication complexity problem associated with the bipartite perfect matching problem. This work is motivated by a research in interpolation theorems for prepositional logic (by a problem posed in [5, Section 8], in particular). Our main objective is to extend the communication complexity approach of [4, 5] to a wider class of proof systems. In this direction we obtain an effective interpolation in a form of a protocol of small real communication complexity. Together with the above mentioned lower bound for tree-like protocols this yields as a corollary a lower bound on the number of steps for particular semantic derivations of Hall's theorem (these include tree-like cutting planes proofs for which an exponential lower bound was demonstrated in [2]).     

On a certain two-sided symmetric condition in magnetic field analysis and computations

A special two-sided condition for the incremental magnetic reluctivity is introduced which guarantees the unique existence of both the weak and the approximate solutions of the nonlinear stationary magnetic field distributed on a region composed of different media, as well as a certain estimate of the error between the two solutions. The condition, being discussed from the physical as well as the mathematical point of view, can be easily verified and is fulfilled for various magnetic reluctivity models used in electrotechnical practice.