We provide two algorithms to solve branching from K to M for the real split reductive group of type An, one inductive and one related to semistandard Young tableaux. The results extend to branching from Ke to M fnl Ke for the real split reductive groups of type Bn and Dn. Thesis Supervisor: David A. Vogan, Jr. Title: Professor of Mathematics

We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover all the vertices of a given graph. We prove the NP-hardness of some cases. We derive approximation results for Min Split-coloring and Min Cocoloring in line graphs, comparability graphs and general graphs. This provide...

Discrete Fourier transform (DFT) is one of the most important tools used in almost all fields of science and engineering. DFT can be implemented with efficient algorithms generally classified as fast Fourier transforms (FFT). The most widely used approaches are so-called the algorithms for, such as radix-2, radix 4 and split radix FFT (SRFFT). Considerable researches have carried out and result...

In the early 1980’s, Cunningham described a unique decomposition of a strongly-connected graph. A linear time bound for finding it in the special case of an undirected graph has been given previously, but up until now, the best bound known for the general case has been O(n). We give an O(m log n) bound.

This study investigated tennis players' speed before, during and after the split-step, deceleration before and acceleration after the split-step in four different stroke groups in three age categories. Seven male professional, eleven male and ten female junior tennis players were recorded with video cameras at official tournaments. Using the SAGIT system, we gathered data on 8,545 split-steps. ...

to study the effect of planting dates and genistein application on nitrogen content and nodulation of three annual medic species (medicago polymorpha cv. santiago m. rigidula cv. ragidula, and m. radiata cv. radiata), an experiment was conducted during 2005-2006 in the research farm of faculty of agriculture, shahed university, tehran. the treatments were arranged as split split plot in a rando...

Although Kirby and Siebenmann [13] showed that there are manifolds which do not admit PL structures, the possibility remained that all manifolds could be triangulated. In the late seventies Galewski and Stern [10] constructed a closed 5–manifold M 5 so that every n–manifold, with n 5, can be triangulated if and only if M 5 can be triangulated. Moreover, M 5 admits a triangulation if and only if...

Let m be the least cardinal θ such that MA θ fails. The only known model for " m is singular " was constructed by Kunen [K1]. In Kunen's model cof (m) = ω 1. It is unknown whether " ω 1 < cof (m) < m " is consistent. The purpose of this paper is to present a proof of Kunen's result and to identify the difficulties of generalizing this result to an arbitrary uncountable cofinality. The following...

There is an increasing variety of pervasive devices in use today. More and more applications are being supported on such devices. This requires device-specific application adaptation. We address the problem of speech application adaptation by dialog call-flow reorganisation for pervasive devices with different memory constraints. Given a dialog call-flow C and device memory size M , we present ...

We present pseudo-code for the basic algorithm only, without the bounded fringe technique described in Section 3.6. The addition of a bounded fringe is straightforward, but complicates the presentation significantly. Candidate split dimension A dimension along which a split may be made. Candidate split point One of the first m structure points to arrive in a leaf. Candidate split A combination ...