The notion of mixed quermassintegrals in the classical Brunn-Minkowski theory is extended to that of Orlicz mixed quermassintegrals in the Orlicz Brunn-Minkowski theory. The analogs of the classical Cauchy- Kubota formula, the Minkowski isoperimetric inequality and the Brunn-Minkowski inequality are established for this new Orlicz mixed quermassintegrals.

In [2], J. Arthur classifies the automorphic discrete spectrum of symplectic groups up to global Arthur packets. We continue with our investigation of Fourier coefficients and their implication to the structure of the cuspidal spectrum for symplectic groups ([16] and [20]). As result, we obtain certain characterization and construction of small cuspidal automorphic representations and gain a better understanding of global Arthur packets and of the structure of local unramified components of the cuspidal spectrum, which has impacts to the generalized Ramanujan problem as posted by P. Sarnak in [43].

Let W be an extended affine Weyl group. We prove that the minimal length elements W of any conjugacy class W of W satisfy some nice properties, generalizing results of Geck and Pfeiffer [<i>On the irreducible characters of Hecke algebras</i>, Adv. Math. <b>102</b> (1993), 7994] on finite Weyl groups. We also study a special class of conjugacy classes, the straight conjugacy classes. These conjugacy classes are in a natural bijection with the Frobenius-twisted conjugacy classes of some W -adic group and satisfy additional interesting properties. Furthermore, we discuss some applications to the affine Hecke algebra W

In the description of isolated gravitating systems in General Relativity a spacelike timeslice has the structure of a complete Riemannian three-manifold with an asymptotically at end. Let (N; g) denote an end of such a complete Riemannian three-manifold, ie N is diffeomorphic to R3\B1 (0), and the metric on N asymptotically approaches the Euclidean metric near infinity: gij=

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and algorithms for various settings of this problem. In particular, we show that if there is only one machine with an arbitrary number of linear constraints, or there is an arbitrary number of machines with no more than two linear constraints, or both the number of machines and the number of linear constraints are fixed constants, then the problem is polynomial-time solvable via solving a series of linear programming problems. If both the number of machines and the number of constraints are inputs of the problem instance, then the problem is NP-Hard. We further propose several approximation algorithms for the latter case.