Dielectric and optical properties of polymer-liquid crystal composite

Dielectric properties of polymer-liquid crystal mixture, having constituent polymer, poly-butyl methacrylate (PBMA) and liquid crystal, cholesteryl nonanoate, are reported as a function of frequency and temperature. The measurement has been done in a temperature range of 300-375 K and frequency range of 100 Hz-10 MHz. The dielectric permittivity and dielectric loss shows significant changes with the addition of polymer molecules in liquid crystal. The significant feature of composite formation is that the pure liquid crystal and polymer do not show dielectric relaxation in the frequency range covered, while the composite shows relaxation peak at a particular frequency. The optical transmittance of pure liquid crystal and composite has also been measured and compared.     

Optimal tristance anticodes in certain graphs

For z₁,z₂,z₃∈Zⁿ, the tristance d₃(z₁,z₂,z₃) is a generalization of the L₁-distance on Zⁿ to a quantity that reflects the relative dispersion of three points rather than two. A tristance anticodeA_d of diameter d is a subset of Zⁿ with the property that d₃(z₁,z₂,z₃)?d for all z₁,z₂,z₃∈A_d. An anticode is optimal if it has the largest possible cardinality for its diameter d. We determine the cardinality and completely classify the optimal tristance anticodes in Z² for all diameters d?1. We then generalize this result to two related distance models: a different distance structure on Z² where d(z₁,z₂)=1 if z₁,z₂ are adjacent either horizontally, vertically, or diagonally, and the distance structure obtained when Z² is replaced by the hexagonal lattice A₂. We also investigate optimal tristance anticodes in Z³ and optimal quadristance anticodes in Z², and provide bounds on their cardinality. We conclude with a brief discussion of the applications of our results to multi-dimensional interleaving schemes and to connectivity loci in the game of Go.     

Absolutely indecomposable symmetric matrices

Let A be a symmetric matrix of size n×n with entries in some (commutative) field K. We study the possibility of decomposing A into two blocks by conjugation by an orthogonal matrix T∈Mat_n(K). We say that A is absolutely indecomposable if it is indecomposable over every extension of the base field. If K is formally real then every symmetric matrix A diagonalizes orthogonally over the real closure of K. Assume that K is a not formally real and of level s. We prove that in Mat_n(K) there exist symmetric, absolutely indecomposable matrices iff n is congruent to 0, 1 or −1 modulo 2s.     

Global stability of the Armstrong-Frederick model with periodic biaxial inputs

The paper is concerned with the study of plasticity models described by differential equations with stop and play operators. We suggest sufficient conditions for the global stability of a unique periodic solution for the scalar models and for the vector models with biaxial inputs of a particular form, namely the sum of a uniaxial function and a constant term. For another class of simple biaxial inputs, we present an example of the existence of unstable periodic solutions. The paper was written during the research stay of D. Rachinskii at the Technical University Munich supported by the research fellowship from the Alexander von Humboldt Foundation. His work was partially supported by the Russian Science Support Foundation, Russian Foundation for Basic Research (Grant No. 01-01-00146, 03-01-00258), and the Grants of the President of Russia (Grant No. MD-87.2003.01, NS-1532.2003.1). The support is gratefully acknowledged.     

Conditional independence models for seemingly unrelated regressions with incomplete data

We consider normal ≡ Gaussian seemingly unrelated regressions (SUR) with incomplete data (ID). Imposing a natural minimal set of conditional independence constraints, we find a restricted SUR/ID model whose likelihood function and parameter space factor into the product of the likelihood functions and the parameter spaces of standard complete data multivariate analysis of variance models. Hence, the restricted model has a unimodal likelihood and permits explicit likelihood inference. In the development of our methodology, we review and extend existing results for complete data SUR models and the multivariate ID problem.     

Symmetries and conservation laws of partial differential equations: Basic notions and results

The main notions and results which are necessary for finding higher symmetries and conservation laws for general systems of partial differential equations are given. These constitute the starting point for the subsequent papers of this volume. Some problems are also discussed.     

Sharp estimates in terms of moduli of smoothness for compound cubature rules

Summary In 1980 Dahmen-DeVore-Scherer introduced a modulus of continuity which turns out to reflect invariance properties of compound cubature rules effectively. Accordingly, sharp error bounds are derived, the existence of relevant counterexamples being a consequence of a quantitative resonance principle, established previously.     

On the density of the space of continuous and uniformly continuous functions

For X a metrizable space and (Y,ρ) a metric space, with Y pathwise connected, we compute the density of (C(X,(Y,ρ)),σ)—the space of all continuous functions from X to (Y,ρ), endowed with the supremum metric σ. Also, for (X,d) a metric space and (Y,‖⋅‖) a normed space, we compute the density of (UC((X,d),(Y,ρ)),σ) (the space of all uniformly continuous functions from (X,d) to (Y,ρ), where ρ is the metric induced on Y by ‖⋅‖). We also prove that the latter result extends only partially to the case where (Y,ρ) is an arbitrary pathwise connected metric space.To carry such an investigation out, the notions of generalized compact and generalized totally bounded metric space, introduced by the author and A. Barbati in a former paper, turn out to play a crucial rôle. Moreover, we show that the first-mentioned concept provides a precise characterization of those metrizable spaces which attain their extent.     

Coxeter complexes and graph-associahedra

Given a graph Γ, we construct a simple, convex polytope, dubbed graph-associahedra, whose face poset is based on the connected subgraphs of Γ. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that for any simplicial Coxeter system, the minimal blow-ups of its associated Coxeter complex has a tiling by graph-associahedra. The geometric and combinatorial properties of the complex as well as of the polyhedra are given. These spaces are natural generalizations of the Deligne-Knudsen-Mumford compactification of the real moduli space of curves.