Characterization of infinitely divisible multivariate gamma distributions

A particular class of p-dimensional exponential distributions have Laplace transforms |I + VT|^?1, V positive definite or positive semi-definite and T = diagonal (t₁,…, t_p). A characterization is given of when these Laplace transforms are infinitely divisible.     

Interpolation, correlation identities, and inequalities for infinitely divisible variables

We present an interpolation formula for the expectation of functions of infinitely divisible (i.d.) variables. This is then applied to study the association problem for i.d. vectors and to present new covariance expansions and correlation inequalities. Acknowledgements and Notes. The research of C. Houdré was supported in part by an NSF Mathematical Sciences Post-Doctoral Fellowship and by an NSF-NATO Postdoctoral Fellowship and by the NSF grant No. DMS-98032039. This research was completed while V. Pérez-Abreu was visiting the Georgia Institute of Technology.     

Moment properties of multivariate infinitely divisible laws and criteria for multivariate self-decomposability

Ramachandran (1969) [9, Theorem 8] has shown that for any univariate infinitely divisible distribution and any positive real number α, an absolute moment of order α relative to the distribution exists (as a finite number) if and only if this is so for a certain truncated version of the corresponding Lévy measure. A generalized version of this result in the case of multivariate infinitely divisible distributions, involving the concept of g-moments, was given by Sato (1999) [6, Theorem 25.3]. We extend Ramachandran’s theorem to the multivariate case, keeping in mind the immediate requirements under appropriate assumptions of cumulant studies of the distributions referred to; the format of Sato’s theorem just referred to obviously varies from ours and seems to have a different agenda. Also, appealing to a further criterion based on the Lévy measure, we identify in a certain class of multivariate infinitely divisible distributions the distributions that are self-decomposable; this throws new light on structural aspects of certain multivariate distributions such as the multivariate generalized hyperbolic distributions studied by Barndorff-Nielsen (1977) [12] and others. Various points relevant to the study are also addressed through specific examples.     

On quasi‐orthogonal cocycles

We introduce the notion of quasi‐orthogonal cocycle. This is motivated in part by the maximal determinant problem for square ‐matrices of size congruent to 2 modulo 4. Quasi‐orthogonal cocycles are analogous to the orthogonal cocycles of algebraic design theory. Equivalences with new and known combinatorial objects afforded by this analogy, such as quasi‐Hadamard groups, relative quasi‐difference sets, and certain partially balanced incomplete block designs, are proved.     

Behaviors of multivariable finite Euler products in probabilistic view

The finite Euler product is known one of the classical zeta functions in number theory. In [1], [2] and [3], we have introduced some multivariable zeta functions and studied their definable probability distributions on . They include functions which generate infinitely divisible, not infinitely divisible characteristic functions and not even to be characteristic functions. In this paper, we treat some multivariable finite Euler products and show how they behave in view of such properties.     

On α-factors of multivariate infinitely divisible probabilities

Let p be an infinitely divisible n-variate probability having μ for Poisson measure. We give here some sufficient conditions for p to belong to the class $\text{I}{}_{\mathrm{\alpha }}{}^{\mathrm{n}}$ of n-variate probabilities having only infinitely divisible α-factors. These results are interesting since they are concerned with the case when μ is a continuous measure.     

On the complexity of axiomatizations of the class of representable quasi‐polyadic equality algebras

Using games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEA _α of representable quasi‐polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi‐polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEA _n for $2< n <\omegaUsing games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEA _α of representable quasi‐polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi‐polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEA _n for $2< n <\omega$ and $l< n,$ $k < n$, k′ < ω are natural numbers, then Σ contains infinitely equations in which ? occurs, one of + or · occurs, a diagonal or a permutation with index l occurs, more than k cylindrifications and more than k′ variables occur. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

On infinitely divisible distributions with light tails of Lévy measures

We show that if the tail of a Lévy measure is light, then the same holds for the tail of the corresponding infinitely divisible distribution.     

New families of non‐embeddable quasi‐derived designs

The main result in this article is a method of constructing a non‐embeddable quasi‐derived design from a quasi‐derived design and an α‐resolvable design. This method is a generalization of techniques used by van Lint and Tonchev in 14 , 15 and Kageyama and Miao in 8 . As applications, we construct several new families of non‐embeddable quasi‐derived designs. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 263–275, 2008     

Coloring quasi‐line graphs

A graph G is a quasi‐line graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of the class of line graphs. A theorem of Shannon's implies that if G is a line graph, then it can be properly colored using no more than 3/2 ω(G) colors, where ω(G) is the size of the largest clique in G. In this article, we extend this result to all quasi‐line graphs. We also show that this bound is tight. © 2006 Wiley Periodicals, Inc. J Graph Theory     

Semi-selfdecomposable distributions and a new class of limit theorems

Self-decomposable distributions are given as limits of normalized sums of independent random variables. We define semi-selfdecomposable distributions as limits of subsequences of normalized sums. More generally, we introduce a way of making a new class of limiting distributions derived from a class of distributions by taking the limits through subsequences of normalized sums, and define the class of semi-selfdecomposable distributions and a decreasing sequence of subclasses of it. We give two kinds of necessary and sufficient conditions for distributions belonging to those classes, one is in terms of the decomposability of random variables and another is in terms of Lévy measures. Received: 1 May 1997 / Revised version: 5 February 1998     

On Kendall-Ressel and related distributions

We delineate a connection of Kendall-Ressel and related laws with the lower real branch of Lambert W function. A characterization of the canonical member of Kendall-Ressel class is found. The Letac-Mora interpretation of the reciprocity of two specific NEFs is extended by considering two related reproductive EDMs. A local limit theorem on gamma convergence for the reproductive back-shifted Kendall-Ressel EDM is derived. Each member of this EDM is self-decomposable and unimodal, but not strongly unimodal. The coefficient of variation, skewness and kurtosis of each representative of this EDM are higher than the corresponding measures for the members of gamma and inverse Gaussian EDMs. An integral representation for the lower real branch of Lambert W function is given.     

Small non‐embeddable quasi‐derived designs

We establish the existence of non‐embeddable quasi‐derived 2‐designs with the parameters (13, 4, 3), (15, 6, 5), and (16, 6, 5). © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 364–372, 2008     

Disjoint quasi‐kernels in digraphs

A quasi‐kernel in a digraph is an independent set of vertices such that any vertex in the digraph can reach some vertex in the set via a directed path of length at most two. Chvátal and Lovász proved that every digraph has a quasi‐kernel. Recently, Gutin et al. raised the question of which digraphs have a pair of disjoint quasi‐kernels. Clearly, a digraph has a pair of disjoint quasi‐kernels cannot contain sinks, that is, vertices of outdegree zero, as each such vertex is necessarily included in a quasi‐kernel. However, there exist digraphs which contain neither sinks nor a pair of disjoint quasi‐kernels. Thus, containing no sinks is not sufficient in general for a digraph to have a pair of disjoint quasi‐kernels. In contrast, we prove that, for several classes of digraphs, the condition of containing no sinks guarantees the existence of a pair of disjoint quasi‐kernels. The classes contain semicomplete multipartite, quasi‐transitive, and locally semicomplete digraphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:251‐260, 2008     

Non‐isolated quasi‐degrees

We show that non‐isolated from below 2‐c.e. Q ‐degrees are dense in the structure of c.e. Q ‐degrees. We construct a 2‐c.e. Q ‐degree, which can't be isolated from below not only by c.e. Q ‐degrees, but by any Q ‐degree. We also prove that below any c.e. Q ‐degree there is a 2‐c.e. Q ‐degree, which is non‐isolated from below and from above (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

High‐resolution monotone schemes based on quasi‐characteristics technique

In this article, we consider a new technique that allows us to overcome the well‐known restriction of Godunov's theorem. According to Godunov's theorem, a second‐order explicit monotone scheme does not exist. The techniques in the construction of high‐resolution schemes with monotone properties near the discontinuities of the solution lie in choosing of one of two high‐resolution numerical solutions computed on different stencils. The criterion for choosing the final solution is proposed. Results of numerical tests that compare with the exact solution and with the numerical solution obtained by the first‐order monotone scheme are presented. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 262–276, 2001     

Weak‐quasi‐Stone algebras

In this paper we shall introduce the variety WQS of weak‐quasi‐Stone algebras as a generalization of the variety QS of quasi‐Stone algebras introduced in [9]. We shall apply the Priestley duality developed in [4] for the variety N of ¬‐lattices to give a duality for WQS. We prove that a weak‐quasi‐Stone algebra is characterized by a property of the set of its regular elements, as well by mean of some principal lattice congruences. We will also determine the simple and subdirectly irreducible algebras (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on triangle‐free quasi‐symmetric designs

Triangle‐free quasi‐symmetric 2‐ (v, k, λ) designs with intersection numbers x, y; 0<x<y<kand λ>1, are investigated. It is proved that λ?2y ? x ? 3. As a consequence it is seen that for fixed λ, there are finitely many triangle‐free quasi‐symmetric designs. It is also proved that: k?y(y ? x) + x. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:422‐426, 2011     

Affine,quasi‐affine and co‐affine frames on local fields of positive characteristic

The concept of quasi‐affine frame in Euclidean spaces was introduced to obtain translation invariance of the discrete wavelet transform. We extend this concept to a local field K of positive characteristic. We show that the affine system generated by a finite number of functions is an affine frame if and only if the corresponding quasi‐affine system is a quasi‐affine frame. In such a case the exact frame bounds are equal. This result is obtained by using the properties of an operator associated with two such affine systems. We characterize the translation invariance of such an operator. A related concept is that of co‐affine system. We show that there do not exist any co‐affine frame in .