Abstract. Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function obtained from Blattner’s formula. This expression involves a product with a character of an irreducible finite dimensional representation of K and...

It is shown that, in the 1{jet space of the circle, the swapping and the flyping procedures, which produce topologically equivalent links, can produce nonequivalent legendrian links. Each component of the links considered is legendrian isotopic to the 1{jet of the 0{function, and thus cannot be distinguished by the classical rotation number or Thurston{Bennequin invariants. The links are distin...

every digital transmission system requires frame alignment. it is necessary to identify the varius signal componets and to bring receiver into phase with respect to the transmission format so that the digits can be properly assembled for demultiplexing. fast and reliable frame alignmant is important, and therefore has been a subject for study. this paper a comprehensive analysis of frame alignm...

We present three new combinatorial problems with solutions involving generating functions and asymptotic approximations.

One of the main reasons why the Hamiltonian formalism is more useful than the Lagrangian formalism is that the set of coordinate transformations that leave invariant the form of the Hamilton equations is much wider than the set of coordinate transformations that leave invariant the form of the Lagrange equations. Furthermore, each of the so-called canonical transformations leaves invariant the ...

In a 1977 paper, Diaconis and Graham studied what Knuth calls the total displacement of a permutation w, which is the sum of the distances |w(i)−i|. In recent work of the first author and Tenner, this statistic appears as twice the type An−1 version of a statistic for Coxeter groups called the depth of w. There are various enumerative results for this statistic in the work of Diaconis and Graha...

The Network Function Virtualization (NFV) paradigm has been devised as an enabler of next generation network infrastructures by speeding up the provisioning and composition novel services. latter are implemented via a chain virtualized functions, process known Service Chaining. In this paper, we evaluate availability multi-tenant SFC infrastructures, where every function is modeled multi-state ...