ON THE SINGULAR DIRECTIONS OF VALUE DISTRIBUTION OF HOLOMORPHIC CURVES IN P^n（C）

This article proves the existence of singular directions of value distribution theory for some transcendental holomorphic curves in the n-dimensional complex projective space Pn(C). An example is given to complement these results.     

Existence Results for Semilinear Neutral Functional Differential Inclusions via Analytic Semigroups

In this paper we prove existence results for semilinear neutral functional differential inclusions with finite or infinite delay in Banach spaces. Our theory makes use of analytic semigroups and fractional powers of closed operators, integrated semigroups and cosine families.      

Constructions of External Difference Families and Disjoint Difference Families

External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference sets is set up.     

Commutators, C0-semigroups and resolvent estimates

We study the existence and the continuity properties of the boundary values on the real axis of the resolvent of a self-adjoint operator H in the framework of the conjugate operator method initiated by Mourre. We allow the conjugate operator A to be the generator of a C₀-semigroup (finer estimates require A to be maximal symmetric) and we consider situations where the first commutator [H,iA] is not comparable to H. The applications include the spectral theory of zero mass quantum field models.     

Characterization and recognition of generalized clique-Helly graphs

Let p?1 and q?0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F^′⊆F formed by p or less members has total intersection of cardinality at least q. A family of sets F is (p,q)-Helly when every (p,q)-intersecting subfamily F^′⊆F has total intersection of cardinality at least q. A graph G is a (p,q)-clique-Helly graph when its family of (maximal) cliques is (p,q)-Helly. According to this terminology, the usual Helly property and the clique-Helly graphs correspond to the case p=2,q=1. In this work we present a characterization for (p,q)-clique-Helly graphs. For fixed p,q, this characterization leads to a polynomial-time recognition algorithm. When p or q is not fixed, it is shown that the recognition of (p,q)-clique-Helly graphs is NP-hard.     

On centroid branches of trees from certain families

We obtain various results involving the centroid branches of randomly chosen trees from simply generated families.     

An analogue of Montel's theorem for some classes of rational functions

For sequences of rational functions, analytic in some domain, a theorem of Montel's type is proved. As an application, sequences of rational functions of the best L _p -approximation with an unbounded number of finite poles are considered.     

Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs

A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not too intensive and the path distribution is mainly concentrated on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how large the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity.     

Structure-based identification and clustering of protein families and superfamilies

Summary We describe an approach to protein structure comparison designed to detect distantly related proteins of similar fold, where the procedure must be sufficiently flexible to take into account the elasticity of protein folds without losing specificity. Protein structures are represented as a series of secondary structure elements, where for each element a local environment describes its relations with the elements that surround it. Secondary structures are then aligned by comparing their features and local environments. The procedure is illustrated with searches of a database of 468 protein structures in order to identify proteins of similar topology to porcine pepsin, porphobilinogen deaminase and serum amyloid P-component. In all cases the searches correctly identify protein structures of similar fold as the search proteins. Multiple cross-comparisons of protein structures allow the clustering of proteins of similar fold. This is exemplified with a clustering of /- and -class protein structures. We discuss applications of the comparison and clustering of three-dimensional protein structures to comparative modelling and structure-based protein design.     

The diagnonal multivariate natural exponential families and their classification

A natural exponential family (NEF)F in ? ⁿ ,n>1, is said to be diagonal if there existn functions,a ₁,...,a _n , on some intervals of ?, such that the covariance matrixV _F (m) ofF has diagonal (a ₁(m ₁),...,a _n (m _n )), for allm=(m ₁,...,m _n ) in the mean domain ofF. The familyF is also said to be irreducible if it is not the product of two independent NEFs in ? ^k and ? ^n-k , for somek=1,...,n?1. This paper shows that there are only six types of irreducible diagonal NEFs in ? ⁿ , that we call normal, Poisson, multinomial, negative multinomial, gamma, and hybrid. These types, with the exception of the latter two, correspond to distributions well established in the literature. This study is motivated by the following question: IfF is an NEF in ? ⁿ , under what conditions is its projectionp(F) in ? ^k , underp(x ₁,...,x _n )∶=(x ₁,...,x _k ),k=1,...,n?1, still an NEF in ? ^k ? The answer turns out to be rather predictable. It is the case if, and only if, the principalk×k submatrix ofV _F (m ₁,...,m _n ) does not depend on (m _k+1,...,m _n ).