Minimizing the number of transitions with respect to observation equivalence

Labeled transition systems (lts) provide an operational semantics for many specification languages. In order to abstract unrelevant details of lts's, manybehavioural equivalences have been defined; here observation equivalence is considered. We are interested in the following problem:Given a finite lts, which is the minimal observation equivalent lts corresponding to it? It is well known that the number of states of an lts can be minimized by applying arelational coarsest partition algorithm. However, the obtained lts is not unique (up to the renaming of the states): for an lts there may exist several observation equivalent lts's which have the minimal number of states but varying number of transitions. In this paper we show how the number of transitions can be minimized, obtaining a unique lts.     

U-statistics in danach spaces

U-statistics in Banach spaces are considered and thoroughly investigated. The martingale structure, estimates of moments, the law of large numbers, the central limit theorem, the invariance principle, estimates of the rate of convergence, and large deviations are established     

The Dedekind-MacNeille completion as a reflector

We introduce a special type of order-preserving maps between quasiordered sets, the so-called cut-stable maps. These form the largest morphism class such that the corresponding category of quasiordered sets contains the category of complete lattices and complete homomorphisms as a full reflective subcategory, the reflector being given by the Dedekind-MacNeille completion (alias normal completion or completion by cuts). Suitable restriction of the object class leads to the category of separated quasiordered sets and its full reflective subcategory of completely distributive lattices. Similar reflections are obtained for continuous lattices, algebraic lattices, etc.     

REML estimation for binary data in GLMMs

The restricted maximum likelihood (REML) procedure is useful for inferences about variance components in mixed linear models. However, its extension to hierarchical generalized linear models (HGLMs) is often hampered by analytically intractable integrals. Numerical integration such as Gauss-Hermite quadrature (GHQ) is generally not recommended when the dimensionality of the integral is high. With binary data various extensions of the REML method have been suggested, but they have had unsatisfactory biases in estimation. In this paper we propose a statistically and computationally efficient REML procedure for the analysis of binary data, which is applicable over a wide class of models and design structures. We propose a bias-correction method for models such as binary matched pairs and discuss how the REML estimating equations for mixed linear models can be modified to implement more general models.     

On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms

In this paper we design a fast new algorithm for reducing an N × N quasiseparable matrix to upper Hessenberg form via a sequence of N − 2 unitary transformations. The new reduction is especially useful when it is followed by the QR algorithm to obtain a complete set of eigenvalues of the original matrix. In particular, it is shown that in a number of cases some recently devised fast adaptations of the QR method for quasiseparable matrices can benefit from using the proposed reduction as a preprocessing step, yielding lower cost and a simplification of implementation.     

Differential operators on Hilbert modular forms

We investigate differential operators and their compatibility with subgroups of SL₂n(R). In particular, we construct Rankin-Cohen brackets for Hilbert modular forms, and more generally, multilinear differential operators on the space of Hilbert modular forms. As an application, we explicitly determine the Rankin-Cohen bracket of a Hilbert-Eisenstein series and an arbitrary Hilbert modular form. We use this result to compute the Petersson inner product of such a bracket and a Hilbert modular cusp form.     

On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle

We consider the general problem of determining the maximum possible multiplicity of an eigenvalue in a Hermitian matrix whose graph contains exactly one cycle. For some cases we express that maximum multiplicity in terms of certain parameters associated with the graph.     

Engel Values in Residually Finite Groups

The following theorem is proved. Let n be a positive integer and q a power of a prime p. There exists a number m = m(n, q) depending only on n and q such that if G is any residually finite group satisfying the identity ([x _1,n y ₁] ⋯ [x _m,n y _m ])^q ≡ 1, then the verbal subgroup of G corresponding to the nth Engel word is locally finite.