Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Separation in distributive congruence lattices

We define separable sets in algebraic lattices. For a finitely generated congruence distributive variety V \mathcal{V} , we show a close connection between non-separable sets in congruence lattices of algebras in V \mathcal{V} and the structure of subdirectly irreducible algebras in V \mathcal{V} . We apply the general results to some lattice varieties.     

Lower bounds of the Laplacian graph eigenvalues

In this paper we prove that all positive eigenvalues of the Laplacian of an arbitrary simple graph have some positive lower bounds. For a fixed integer k 1 we call a graph without isolated vertices k-minimal if its kth greatest Laplacian eigenvalue reaches this lower bound. We describe all 1-minimal and 2-minimal graphs and we prove that for every k 3 the path P_k+1 on k + 1 vertices is the unique k-minimal graph.     

Natural Operators Lifting Vector Fields to Bundles of Weil Contact Elements

Let A be a Weil algebra. The bijection between all natural operators lifting vector fields from m-manifolds to the bundle functor K ^A of Weil contact elements and the subalgebra of fixed elements SA of the Weil algebra A is determined and the bijection between all natural affinors on K ^A and SA is deduced. Furthermore, the rigidity of the functor K ^A is proved. Requisite results about the structure of SA are obtained by a purely algebraic approach, namely the existence of nontrivial SA is discussed.     

Volume Chemistry of Nitrogen in Binary Metal Nitrides and Subnitrides

A comparison of the concept of volume increments created by W. Biltz with that based on quantum mechanical calculations by R.F.W. Bader was performed for crystal structures of binary metal nitrides and ‐subnitrides. The mutual comparison of both concepts permits insights into the bonding relationships of these compounds and reveals the considerable range of volume demand of a strongly polarisable bonding partner, such as the nitride ion. Finally it becomes clear that the Biltz volume increments show a quantum‐chemical relevance in the chemistry of solids.     

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.     

Fibers and 3D mesh scaffolds from biodegradable starch-based blends: production and characterization

The aim of this work is the production of fibers from biodegradable polymers to obtain 3D scaffolds for tissue engineering of hard tissues. The scaffolds required for this highly demanding application need to have, as well as the biological and mechanical characteristics, a high degree of porosity with suitable dimensions for cell seeding and proliferation. Furthermore, the open cell porosity should have adequate interconnectivity for a continuous flow of nutrients and outflow of cell metabolic residues as well as to allow cell growth into confluent layers. Blends of corn starch, a natural biodegradable polymer, with other synthetic polymers (poly(ethylene vinyl alcohol), poly(epsilon-caprolactone), poly(lactic acid)) were selected for this work because of their good balance of properties, namely biocompatibility, processability and mechanical properties. Melt spinning was used to produce fibers from all the blends and 3D meshes from one of the starch-poly(lactic acid) blends. The experimental characterization included the evaluation of the tensile mechanical properties and thermal properties of the fibers and the compression stiffness, porosity and degradation behavior of the 3D meshes. Light microscopy picture of 3D meshes.     

Phase Analysis of the Binary System of Cryolite (Na3AlF6) and Sodium Metasilicate (Na2SiO3)

The phase analysis of cryolite (Na₃AlF₆) and sodium metasilicate (Na₂SiO₃) was performed by thermal analysis. The eutectic system with a region of two immiscible substances at a concentration of Na₂SiO₃ between 42.8 and 46.3 mol‐% was identified and the eutectic temperature determined to (886±2) °C. Based on the results of mass‐loss measurements, it was assumed that the introduced Na₂SiO₃ reacts with Na₃AlF₆ due to the formation of some nonvolatile stable compounds. The stable reaction products were identified by X‐ray diffraction analysis and IR spectroscopy of the spontaneously cooled samples, which established the formation of NaF and stable amorphous aluminosilicate compounds.