Weighted lattice polynomials of independent random variables

We give the cumulative distribution functions, the expected values, and the moments of weighted lattice polynomials when regarded as real functions of independent random variables. Since weighted lattice polynomial functions include ordinary lattice polynomial functions and, particularly, order statistics, our results encompass the corresponding formulas for these particular functions. We also provide an application to the reliability analysis of coherent systems.     

对称扩展的有界分配格的同余关系及其应用

给出了对称扩展的有界分配格的定义,即带有满足一定条件的一元运算的有界分配格.然后给出了这种分配格上的主同余的等式刻划及其可补性.最后,讨论了对称扩展的有界分配格的次直不可约性。     

分配格中模糊理想诱导的模糊幂格

在模糊幂格讨论基础上,给出了由分配格中模糊理想诱导的两种模糊幂格.     

Weighted Polynomial Approximation for Convex External Fields

It is proven that if Q is convex and w(x)= exp(-Q(x)) is the corresponding weight, then every continuous function that vanishes outside the support of the extremal measure associated with w can be uniformly approximated by weighted polynomials of the form w ⁿ P _n . This solves a problem of P. Borwein and E. B. Saff. Actually, a similar result is true locally for any parts of the extremal support where Q is convex. February 10, 1998. Date revised: July 23, 1998. Date accepted: August 17, 1998.     

格蕴涵代数与BCK代数的关系

本文给出了有界可换的ＢＣＫ代数的分配性的一些等价条件，指出了格蕴涵代数与有界可换分配的ＢＣＫ代数以及格Ｈ蕴涵代数与有界关联的ＢＣＫ代数之间的对偶关系     

The lattice of integer partitions and its infinite extension

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all partitions of a positive integer, equipped with a dominance ordering. We first explain how this lattice can be constructed by an algorithm in linear time with respect to its size by showing that it has a self-similar structure. Then, we define a natural extension of the model to infinity, which we compare with the Young lattice. Using a self-similar tree, we obtain an encoding of the obtained lattice which makes it possible to enumerate easily and efficiently all the partitions of a given integer. This approach also gives a recursive formula for the number of partitions of an integer, and some informations on special sets of partitions, such as length bounded partitions.     

ContributionsAn algorithm for the Tutte polynomials of graphs of bounded treewidth

Let k be a fixed, positive integer. We give an algorithm which computes the Tutte polynomial of any graph G of treewidth at most k in time O(n^{2+7 log₂ c}), where c is twice the number of partitions of a set with 3k + 3 elements and n the number of vertices of G.     

集对Fuzzy格及其在格表示论中的应用

用幂集格构造了集对 Ｆｕｚｚｙ 格（这与用整数对构造有理数集有相似之处）,并用它证明了完整的软代数表示定理,即定义了到自身的映射且有最大元和最小元的格为软代数的充要条件是它与某个集对 Ｆｕｚｚｙ 格的子格同构．这样,与分配格在幂集 Ｂｏｏｌｅ 格中表示相对应,软代数在集对 Ｆｕｚｚｙ 格中有表示,在理论上是很完美的     

The Cauchy Integral Operator on Weighted Hardy Space

The authors show that the Cauchy integral operator is bounded from Hωp(R1) to hωp(R1) (the weighted local Hardy space). To prove the results, a kind of generalized atoms is introduced and a variant of weighted "Tb theorem" is considered.     

伪补分配格的同余理想与同余关系

L是完备的伪补分配格,I是L的同余理想,本文得到以下结果：⑴θ是L的以I为核的最大同余关系的条件。⑵L的以I为核的同余关系是唯一的充分必要条件。⑶L的同余理想与同余关系之间有一一对应关系的充分必要条件。     

Tension polynomials of graphs

The tension polynomial F_G(k) of a graph G, evaluating the number of nowhere‐zero ?_k‐tensions in G, is the nontrivial divisor of the chromatic polynomial χ_G(k) of G, in that χ_G(k) = k^c(G)F_G(k), where c(G) denotes the number of components of G. We introduce the integral tension polynomial I_G(k), which evaluates the number of nowhere‐zero integral tensions in G with absolute values smaller than k. We show that 2^r(G)F_G(k)≥I_G(k)≥ (r(G)+1)F_G(k), where r(G)=|V(G)|?c(G), and, for every k>1, F_G(k+1)≥ F_G(k)˙k / (k?1) and I_G(k+1)≥I_G(k)˙k/(k?1). © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 137–146, 2002     

复流形上（p，q）形式的带权因子的积分表示

本文在[1]的基础上，通过构造带权的Cauchy—Leray核，得到了一般复流形上的(p,q)形式的带权因子的积分表示和带权子的Koppelman—Lerey—Noryuet公式．     

Extremal lattices and the construction of lattice rules

After introducing the concept of extremal lattices we show how these can be used to construct lattice rules of a high trigonometric degree.     

Indecomposable matrices over a distributive lattice

In this paper, the concepts of indecomposable matrices and fully indecomposable matrices over a distributive lattice L are introduced, and some algebraic properties of them are obtained. Also, some characterizations of the set F _n (L) of all n × n fully indecomposable matrices as a subsemigroup of the semigroup H _n (L) of all n × n Hall matrices over the lattice L are given.     

On the projections of convex lattice sets

As a discrete analogue of Aleksandrov＇s projection theorem, it is natural to ask the following question： Can an o-symmetric convex lattice set of the integer lattice Z n be uniquely determined by its lattice projection counts？ In 2005, Gardner, Gronchi and Zong discovered a counterexample with cardinality 11 in the plane. In this paper, we will show that it is the only counterexample in Z2, up to unimodular transformations and with cardinality not larger than 17.     

On series containing products of Legendre polynomials

Explicit formulas are established for infinite sums of products of three or four Legendre polynomials of nth order with coefficients 2n + 1; the series depends only the arguments of the polynomials and contains no other variables. We show that, for the product of three polynomials, the sum is inverse to the root of the product of four sine functions and, in the case of four polynomials, this expression additionally contains the elliptic integral K(k) as a multiplier. Analogs and particular cases are considered which allow one to compare the relationships proved in this note with results proved in various domains of mathematical physics and classical functional analysis.     

变量核的Marcinkiewicz积分的加权有界性

对Marcinkiewicz积分算子的有界性问题进行研究.应用Morrey-Herz空间的分解特征和算子在Lρ上的有界性结果,得到变量核的Marcinkiewicz积分算子在Morrey-Herz空间上的加权有界性.     

Weighted Composition Operators from the Bloch Spaces to Weighted Hardy Spaces on Bounded Symmetric Domains*

Let B_E be a bounded symmetric domain realized as the unit open ball of JB*-triples.The authors will characterize the bounded weighted composition operator from the Bloch space B(BE) to weighted Hardy space H_v^∞ in terms of Kobayashi distance.The authors also give a sufficient condition for the compactness,and also give the upper bound of its essential norm.As a corollary,they show that the boundedness and compactness are equivalent for composition operator fromB(B...     

Factorization of monic polynomials

We prove a uniqueness result about the factorization of a monic polynomial over a general commutative ring into comaximal factors. We apply this result to address several questions raised by Steve McAdam. These questions, inspired by Hensel's Lemma, concern properties of prime ideals and the factoring of monic polynomials modulo prime ideals.

     

Cumulants, lattice paths, and orthogonal polynomials

A formula expressing free cumulants in terms of Jacobi parameters of the corresponding orthogonal polynomials is derived. It combines Flajolet's theory of continued fractions and the Lagrange inversion formula. For the converse we discuss Gessel–Viennot theory to express Hankel determinants in terms of various cumulants.