Counting Lattice Paths With Four Types of Steps

The main purpose of this paper is to derive generating functions for the numbers of lattice paths running from (0, 0) to any (n, k) in \({\mathbb{Z} \times \mathbb{N}}\) consisting of four types of steps: horizontal H = (1, 0), vertical V = (0, 1), diagonal D = (1, 1), and sloping L = (–1, 1). These paths generalize the well-known Delannoy paths which consist of steps H, V, and D. Several restrictions are considered. However, we mainly treat with those which will be needed to get the generating function for the numbers R(n, k) of these lattice paths whose points lie in the integer rectangle \({\{(x, y) \in \mathbb{N}^2 : 0 \leq x \leq n, 0 \leq y \leq k\}}\) . Recurrence relation, generating functions and explicit formulas are given. We show that most of considered numbers define Riordan arrays.     

Almost Injective Transformations of an Infinite Set

Let V be an infinite-dimensional vector space, let n be a cardinal such that ?₀ ≤ n ≤ dim V, and let AM(V, n) denote the semigroup consisting of all linear transformations of V whose nullity is less than n. In recent work, Mendes-Gonçalves and Sullivan studied the ideal structure of AM(V, n). Here, we do the same for a similarly-defined semigroup AM(X, q) of transformations defined on an infinite set X. Although our results are clearly comparable with those already obtained for AM(V, n), we show that the two semigroups are never isomorphic.     

Plethysm and Lattice Point Counting

We apply lattice point counting methods to compute the multiplicities in the plethysm of \(\textit{GL}(n)\). Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old conjecture of Howe on the leading term of plethysm. For any partition \(\mu \) of 3, 4, or 5, we obtain an explicit formula in \(\lambda \) and k for the multiplicity of \(S^\lambda \) in \(S^\mu (S^k)\).     

极值问题与一类具有无限纯策略集的最优混合策略

证明了局部凸线性拓扑空间上实值连续泛函的极大极小定理与极大定理，并由此证明了一类具有无限纯策略集的二人对策中最优混合策略的存在性。该证明对经典情形也适用，而且比传统的证明要简洁。     

峰严格递增的Dyck路的计数

本文考虑了由最高峰的高度为m,并且峰的高度沿着Dyck路严格递增的所有Dyck路组成的集合,即集合Dm的子集的计数问题．利用双射、生成树以及Riordan阵的方法来对集合Dm的一些子集进行计数,得到了一些以经典的序列如Catalan数、Narayana数、Motzkin数、Fibonacci数、Schroder数以及第一类无符号Stirling数来计数的组合结构．特别地,我们给出了两个新的Catalan结构,它们并没有明显地出现在Stanley关于Catalan结构的列表中．     

Counting Dyck Paths by Area and Rank

The set of Dyck paths of length 2n inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths: area (the area under the path) and rank (the rank in the lattice). While area for Dyck paths has been studied, pairing it with this rank function seems new, and we get an interesting (q, t)-refinement of the Catalan numbers. We present two decompositions of the corresponding generating function: One refines an identity of Carlitz and Riordan; the other refines the notion of γ-nonnegativity, and is based on a decomposition of the lattice of noncrossing partitions due to Simion and Ullman. Further, Biane’s correspondence and a result of Stump allow us to conclude that the joint distribution of area and rank for Dyck paths equals the joint distribution of length and reflection length for the permutations lying below the n-cycle (12· · ·n) in the absolute order on the symmetric group.     

无限格与其非标准扩张

在非标准κ-饱和模型下,研究了无限格L的非标准扩张*L的性质及其在L-集滤子理论中的应用.首先,定义了κ-完备格的概念,讨论了完备格与κ-完备格之间的关系,证明了无限格L的非标准扩张*L是κ-完备格.其次,定义了L-集滤子的单子,利用κ-完备格证明了此定义是合理的.最后,利用L-集滤子的单子给出了L-集滤子族上确界存在的充分且必要条件.     

Lattice Paths and Positive Trigonometric Sums

A trigonometric polynomial generalization to the positivity of an alternating sum of binomial coefficients is given. The proof uses lattice paths, and identifies the trigonometric sum as a polynomial with positive integer coefficients. Some special cases of the q -analogue conjectured by Bressoud are established, and new conjectures are given. January 22, 1997. Date revised: July 9, 1997.     

一个n有序集组的计数问题

In this paper, we discuss the counting problem of an order n-group of set (A1 ,A2 ,… ,An) which satisfies ∪^ni=1Ai={a,a2,…,am} and one of the following:(1)∩^ni=1Ai=Φ;(2)∩^ni=1Ai={b1,b2,…,bk};(3)∩^ni=1A1包含{b1,b2,…,bk};(4)Ai≠Φ(i=1,2,…,k），We solve these problems by element analytical method.     

The Lattice of Completions of an Ordered Set

For any ordered set P, the join dense completions of P form a complete lattice K(P) with least element O(P), the lattice of order ideals of P, and greatest element M(P), the Dedekind–MacNeille completion P. The lattice K(P) is isomorphic to an ideal of the lattice of all closure operators on the lattice O(P). Thus it inherits some local structural properties which hold in the lattice of closure operators on any complete lattice. In particular, if K(P) is finite, then it is an upper semimodular lattice and an upper bounded homomorphic image of a free lattice, and hence meet semidistributive.     

幂格与幂集格的关系

由幂格的定义知 ,幂格与幂集格是不同的 ,然而它们却有一定的联系 .本文在幂格概念的基础上 ,进一步地讨论幂格和幂集格在一定条件下的联系 .     

Pairs of Lattice Paths and Positive Trigonometric Sums

Ismail et al. (Constr. Approx. 15:69–81, 1999) proved the positivity of some trigonometric polynomials with single binomial coefficients. In this paper, we prove some similar results by replacing the binomial coefficients with products of two binomial coefficients.     

Rings of Formal Power Series in an Infinite Set of Indeterminates

Let α be an infinite cardinal number, Λ be an index set of cardinality > α, and {X _λ}_λ∈Λ be a set of indeterminates over an integral domain D. It is well known that there are three ways of defining the ring of formal power series in {X _λ}_λ∈Λ over D, say, D[[{X _λ}]] _i for i = 1, 2, 3. In this paper, we let D[[{X _λ}]]_α = ∪ {D[[{X _λ}_λ∈Γ]]₃ | Γ ? Λ and |Γ| ≤ α}, and we then show that D[[{X _λ}]]_α is an integral domain such that D[[{X _λ}]]₂ ? D[[{X _λ}]]_α ? D[[{X _λ}]]₃. We also prove that (1) D is a Krull domain if and only if D[[{X _λ}]]_α is a Krull domain and (2) D[[{X _λ}]]_α is a unique factorization domain (UFD) (resp., π-domain) if and only if D[[X ₁,…, X _n ]] is a UFD (resp., π-domain) for every integer n ≥ 1.     

三维空间中带对角步格路的一个注记

Jr.Stocks讨论了从(0,0,0)到(n,n,n)的带对角步格路的计数问题.本文给出了[4]中主要结果的简单公式,并将其推广到了一般情形.