The Chung-Feller theorem revisited

In this note, we provide a direct and elegant bijective proof of Chung-Feller theorem.     

New proofs for Levine’s theorems

Recently, Levine [9] expressed the vertex weighted complexity on spanning trees (with a fixed root) of the directed line graph of a digraph D in terms of the edge weighted complexity on spanning trees (with a fixed root) of D. We present new proofs for two Levine’s Theorems. Furthermore, we express the number of unicycles of the directed line graph of a digraph D in terms of the number of unicycles of D.     

Restricted Dumont permutations, Dyck paths, and noncrossing partitions

We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that uses cycle decomposition, as well as bijections between 132-, 231- and 321-avoiding Dumont permutations and Dyck paths. Finally, we enumerate Dumont permutations of the first kind simultaneously avoiding certain pairs of 4-letter patterns and another pattern of arbitrary length.     

Counting strings in Dyck paths

This paper deals with the enumeration of Dyck paths according to the statistic “number of occurrences of τ”, for an arbitrary string τ. In this direction, the statistic “number of occurrences of τ at height j” is considered. It is shown that the corresponding generating function can be evaluated with the aid of Chebyshev polynomials of the second kind. This is applied to every string of length 4. Further results are obtained for the statistic “number of occurrences of τ at even (or odd) height”.     

Canonization theorems for finite affine and linear spaces

In this paper we prove a canonical (i.e. unrestricted) version of the Graham—Leeb—Rothschild partition theorem for finite affine and linear spaces [3]. We also mention some other kind of canonization results for finite affine and linear spaces.     

Dyck paths and restricted permutations

This paper is devoted to characterize permutations with forbidden patterns by using canonical reduced decompositions, which leads to bijections between Dyck paths and S_n(321) and S_n(231), respectively. We also discuss permutations in S_n avoiding two patterns, one of length 3 and the other of length k. These permutations produce a kind of discrete continuity between the Motzkin and the Catalan numbers.     

Partial difference equation method for lattice path problems

Many problems concerning lattice paths, especially on the square lattice have been exactly solved. For a single path, many methods exist that allow exact calculation regardless of whether the path inhabits a strip, a semi-infinite space or infinite space, or perhaps interacts with the walls. It has been shown that a transfer matrix method using the Bethe Ansatz allows for the calculation of the partition function for many non-intersecting paths interacting with a wall. This problem can also be considered using the Gessel-Viennot methodology. In a concurrent development, two non-intersecting paths interacting with a wall have been examined in semi-infinite space using a set of partial difference equations.Here, we review thispartial difference equation method for the case of one path in a half plane. We then demonstrate that the answer for arbitrary numbers of non-intersecting paths interacting with a wall can be obtained using this method. One reason for doing this is its pedagogical value in showing its ease of use compared to the transfer matrix method. The solution is expressed in a new form as a constant term formula, which is readily evaluated. More importantly, it is the natural method that generalizes easily to many intersecting paths where there is inter-path interactions (e.g., osculating lattice paths). We discuss the relationship of the partial difference equation method to the transfer matrix method and their solution via a Bethe Ansatz.     

Primal decomposition in rings, modules and lattice modules

In a work by L. Fuchs, W. Heinzer and B. Olberding, a decomposition of ideals in a commutative ring as intersections of primal isolated component ideals is investigated. In subsequent work by L. Fuchs and R. Reis, these ideas are developed in multiplicative lattices. The object of this note is to point out that, when specialized to the lattice of ideals of a commutative ring, the decomposition of L. Fuchs and R. Reis does not give the decomposition obtained in the paper by Fuchs, Heinzer and Olberding, and to give two variations of the decomposition of Fuchs and Reis. One of these variations, when specialized to the lattice of ideals of a ring, does give the decomposition obtained by Fuchs, Heinzer and Olberding, and the other one gives a decomposition which is superior in some ways. Received December 2, 2004; accepted in final form February 17, 2005.     

Dichotomy theorems for countably infinite dimensional analytic hypergraphs

We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic number.     

Some intersection theorems

LetL(A) be the set of submatrices of anm×n matrixA. ThenL(A) is a ranked poset with respect to the inclusion, and the poset rank of a submatrix is the sum of the number of rows and columns minus 1, the rank of the empty matrix is zero. We attack the question: What is the maximum number of submatrices such that any two of them have intersection of rank at leastt? We have a solution fort=1,2 using the followoing theorem of independent interest. Letm(n,i,j,k) = max(|F|;|G|), where maximum is taken for all possible pairs of families of subsets of ann-element set such thatF isi-intersecting,G isj-intersecting andF ansd,G are cross-k-intersecting. Then fori≤j≤k, m(n,i,j,k) is attained ifF is a maximali-intersecting family containing subsets of size at leastn/2, andG is a maximal2k?i-intersecting family. Furthermore, we discuss and Erd?s-Ko-Rado-type question forL(A), as well.     

Applications of minor summation formula III, Plücker relations, lattice paths and Pfaffian identities

The initial purpose of the present paper is to provide a combinatorial proof of the minor summation formula of Pfaffians in [Ishikawa, Wakayama, Minor summation formula of Pfaffians, Linear and Multilinear Algebra 39 (1995) 285-305] based on the lattice path method. The second aim is to study applications of the minor summation formula for obtaining several identities. Especially, a simple proof of Kawanaka's formula concerning a q-series identity involving the Schur functions [Kawanaka, A q-series identity involving Schur functions and related topics, Osaka J. Math. 36 (1999) 157-176] and of the identity in [Kawanaka, A q-Cauchy identity involving Schur functions and imprimitive complex reflection groups, Osaka J. Math. 38 (2001) 775-810] which is regarded as a determinant version of the previous one are given.     

Projective mappings between projective lattice geometries

The concept of projective lattice geometry generalizes the classical synthetic concept of projective geometry, including projective geometry of modules.In this article we introduce and investigate certain structure preserving mappings between projective lattice geometries. Examples of these so-calledprojective mappings are given by isomorphisms and projections; furthermore all linear mappings between modules induce projective mappings between the corresponding projective geometries.     

Infinite paths in a Lorentz lattice gas model

We consider infinite paths in an illumination problem on the lattice ℤ², where at each vertex, there is either a two-sided mirror (with probability p≥ 0) or no mirror (with probability 1 −p). The mirrors are independently oriented NE-SW or NW-SE with equal probability. We consider beams of light which are shone from the origin and deflected by the mirrors. The beam of light is either periodic or unbounded. The novel feature of this analysis is that we concentrate on the measure on the space of paths. In particular, under the assumption that the set of unbounded paths has positive measure, we are able to establish a useful ergodic property of the measure. We use this to prove results about the number and geometry of infinite light beams. Extensions to higher dimensions are considered. Received: 14 November 1996 / Revised version: 1 September 1998     

Enumeration of the self-avoiding polygons on a lattice by the Schwinger-Dyson equations

We show how to compute the generating function of the self-avoiding polygons on a lattice by using the statistical mechanics Schwinger-Dyson equations for the correlation functions of theN-vector spin model on that lattice.     

Intersection theorems with geometric consequences

In this paper we prove that ifℱ is a family ofk-subsets of ann-set, μ₀, μ₁, ..., μ_s are distinct residues modp (p is a prime) such thatk ≡ μ₀ (modp) and forF ≠ F′ ≠ℱ we have |F ∩F′| ≡ μ_i (modp) for somei, 1 ≦i≦s, then |ℱ|≦( _s ⁿ ). As a consequence we show that ifR ⁿ is covered bym sets withm<(1+o(1)) (1.2) ⁿ then there is one set within which all the distances are realised. It is left open whether the same conclusion holds for compositep.     

Normal limit theorems for symmetric random matrices

Using the machinery of zonal polynomials, we examine the limiting behavior of random symmetric matrices invariant under conjugation by orthogonal matrices as the dimension tends to infinity. In particular, we give sufficient conditions for the distribution of a fixed submatrix to tend to a normal distribution. We also consider the problem of when the sequence of partial sums of the diagonal elements tends to a Brownian motion. Using these results, we show that if O _n is a uniform random n×n orthogonal matrix, then for any fixed k>0, the sequence of partial sums of the diagonal of O ^k _n tends to a Brownian motion as n→∞. Received: 3 February 1998 / Revised version: 11 June 1998     

Geršgorin type theorems for quaternionic matrices

This paper aims to set an account of the left eigenvalue problems for real quaternionic (finite) matrices. In particular, we will present the Geršgorin type theorems for the left (and right) eigenvalues of square quaternionic matrices. We shall conclude the paper with examples showing and summarizing some differences between complex matrices and quaternionic matrices and right and left eigenvalues of quaternionic matrices.     

Absolute and relative Weyl theorems for generalized eigenvalue problems

Weyl-type eigenvalue perturbation theories are derived for Hermitian definite pencils A-λB, in which B is positive definite. The results provide a one-to-one correspondence between the original and perturbed eigenvalues, and give a uniform perturbation bound. We give both absolute and relative perturbation results, defined in the standard Euclidean metric instead of the chordal metric that is often used.