Explicit bounds for multidimensional linear recurrences with restricted coefficients

This note employs path counting techniques to extend recent results on bounds for odd order linear recurrences to higher dimensions. The results imply optimal zero-free polydisks for multivariable power series with 0, 1 coefficients. Among the applications is a result that states that the optimal zero-free polydisk has radius approximately 1/(v+1), for large dimensions v.     

第二类窃密信道中的组合数学方法

当信息在第二类窃密信道中传输时,线性码的广义汉明重量谱完全描述的它在该信道中的密码学特征.计算一个线性码的广义汉明重量谱是一个基本问题,首先提出了线性码的“最简基”的概念.在此基础上给出了一般线性码子码的几种计数公式,并给出了它们之间等价性的证明.     

电磁波在多层介质内的透射

导了多层介质中透射电磁波的电场振幅与介质表面入射电磁波场电场振幅之间的关系式，引入了一个母函数，通过微分可以生成介质各层中的透射波。     

Iterations of random and deterministic functions

Letf be a probability generating function on [0, 1]. The convergence of its iteratesf _n to fixed points is studied in this paper. Results include rates forf andf ^-1. Also iterates of independent identically distributed stable processes are studied and a trichotomy based on the order of the stability is established. Dedicated to the memory of Professor K G Ramanathan     

Derivation of the probability distribution functions for succession quota random variables

The probability distribution functions (pdf's) of the sooner and later waiting time random variables (rv's) for the succession quota problem (k successes and r failures) are derived presently in the case of a binary sequence of order k. The probability generating functions (pgf's) of the above rv's are then obtained directly from their pdf's. In the case of independent Bernoulli trials, expressions for the pdf's in terms of binomial coefficients are also established.     

Analysis of the M/Gi/1 →/M/1 queueing model

An M/GI/1 queueing system is in series with a unit with negative exponential service times and infinite waiting room capacity. We determine a closed form expression for the generating function of the joint queue length distribution in steady state. This result is obtained via the solution of a new type of functional equation in two variables.     

Single line queue with recurrent repeated demands

We analyze a model queueing system in which customers cannot be in continuous contact with the server, but must call in to request service. If the server is free, the customer enters service immediately, but if the server is occupied, the unsatisfied customer must break contact and reapply for service later. There are two types of customer present who may reapply. First transit customers who arrive from outside according to a Poisson process and if they find the server busy they join a source of unsatisfied customers, called the orbit, who according to an exponential distribution reapply for service till they find the server free and leave the system on completion of service. Secondly there are a number of recurrent customers present who reapply for service according to a different exponential distribution and immediately go back in to the orbit after each completion of service. We assume a general service time distribution and calculate several characterstic quantities of the system for both the constant rate of reapplying for service and for the case when customers are discouraged and reduce their rate of demand as more customers join the orbit.     

Difference equations in statistical mechanics. I. Cluster statistics models

A review and some new results are presented for several cluster statistics models, solutions of which can be reduced to difference equations. Mathematical techniques suitable for solving these equations are surveyed.     

Jagged Partitions

By jagged partitions we refer to an ordered collection of non-negative integers (n₁, n₂,..., n_m) with n_m≥ p for some positive integer p, further subject to some weakly decreasing conditions that prevent them for being genuine partitions. The case analyzed in greater detail here corresponds to p = 1 and the following conditions n_i≥ n_i+1−1 and n_i≥ n_i+2. A number of properties for the corresponding partition function are derived, including rather remarkable congruence relations. An interesting application of jagged partitions concerns the derivation of generating functions for enumerating partitions with special restrictions, a point that is illustrated with various examples. 2000 Mathematics Subject Classification: Primary—05A15, 05A17, 05A19     

Generating Functions for Coalitional Power Indices: An Application to the IMF

This paper provides “ready-to-apply” procedures, based on generating functions, which allow to compute power indices in weighted majority games restricted by an a priori system of unions. We illustrate these methods by an application to the International Monetary Fund. We compare the empirical properties of the coalitional and traditional power indices keeping the game fixed or allowing for variations in its set of parameters.