Double Aztec rectangles

We investigate the connection between lozenge tilings and domino tilings by introducing a new family of regions obtained by attaching two different Aztec rectangles. We prove a simple product formula for the generating functions of the tilings of the new regions, which involves the statistics as in the Aztec diamond theorem (Elkies et al. (1992) [2], [3]). Moreover, we consider the connection between the generating function and MacMahon's q-enumeration of plane partitions fitting in a given box     

A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem

In this paper, we present the design of a Polynomial Time Approximation Scheme (PTAS) for the Grade of Service Steiner Minimum Tree (GOSST) problem, which is known to be NP-Complete. Previous research has focused on geometric analyses and different approximation algorithms have been designed. We propose a PTAS that provides a polynomial time, near-optimal solution with performance ratio 1+. The GOSST problem has some important applications. In network design, a fundamental issue for the physical construction of a network structure is the interconnection of many communication sites with the best choice of the connecting lines and the best allocation of the transmission capacities over these lines. Good solutions should provide paths with enough communication capacities between any two sites, with the least network construction costs. Also, the GOSST problem has applications in transportation, for road constructions and some potential uses in CAD in terms of interconnecting the elements on a plane to provide enough flux between any two elements.     

Determinants of Triangular Matrices and Trajectories on Ferre Diagrams

Some functions defined on the set of integer triangular matrices and their modifications are considered. These functions are analogs of the classical determinant and permanent functions and provide a powerful apparatus for studying sequences generated by linear recursive equations. Modifications of these functions are used to solve the problem about trajectories on Ferre diagrams and to establish new combinatorial identities.     

FINITE ELEMENT APPROXIMATION OF A NONLINEAR STEADY-STATE HEAT CONDUCTION PROBLEM

1. Introduction Anciellt Chinese mathematicians have done many fund~al discoveries, even thoughmad of them are now usually called by western names, e.g., the Pascal triangle, the HornerIcheme, the Gaussian elimination, see [231. In the modern era3 Chinese mathematiciare have.jalso got many priorities. For instance, the fast Proof Of convergence of the finite element methodfor a linear elliptic boundary vajue problem was done in the pioneering work [61 by K. Feng in1965 (for the English tra…     

On the stability of some integer programming algorithms

In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed.     

On Time Dynamics of Coagulation-Fragmentation Processes

We establish a characterization of coagulation-fragmentation processes, such that the induced birth and death processes depicting the total number of groups at time t≥0 are time homogeneous. Based on this, we provide a characterization of mean-field Gibbs coagulation-fragmentation models, which extends the one derived by Hendriks et al. As a by-product of our results, the class of solvable models is widened and a question posed by N. Berestycki and Pitman is answered, under restriction to mean-field models.     

New weighted Rogers-Ramanujan partition theorems and their implications

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of Göllnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at least two. Consequences of this include Jacobi's celebrated triple product identity for theta functions, Sylvester's famous refinement of Euler's theorem, as well as certain weighted partition identities. Next, by studying partitions with prescribed bounds on successive ranks and replacing these with weighted Rogers-Ramanujan partitions, we obtain two new sets of theorems - a set of three theorems involving partitions into parts (mod 6), and a set of three theorems involving partitions into parts (mod 7), .

     

New facts

We use ``iterated square sequences' to show that there is an -definable partition such that if is an inner model not containing :

(a)

For some is stationary.

(b)

For each there is a generic extension of in which does not exist and is non-stationary.

This result is then applied to show that if is an inner model without , then some sentence not true in can be forced over .

     

Arithmetic Properties of Summands of Partitions

Let d d, d2 2. We prove that for almost all partitions of an integer the parts are well distributed in residue classes mod d. The limitations of the uniformity of this distribution are also studied.     

Partition Complexes, Tits Buildings and Symmetric Products

We construct a homological approximation to the partition complex,and identify it as the Tits building. This gives a homologicalrelationship between the symmetric group and the affine group,leads to a geometric tie between symmetric powers of spheresand the Steinberg idempotent, and allows us to use the self-dualityof the Steinberg module to study layers in the Goodwillie towerof the identity functor. 2000 Mathematics Subject Classification:55N25, 55S15, 20B30, 55P25.