The ubiquity of generalized cluster categories

Associated with a finite-dimensional algebra of global dimension at most 2, a generalized cluster category was introduced in Amiot (2009) [1]. It was shown to be triangulated, and 2-Calabi–Yau when it is Hom-finite. By definition, the cluster categories of Buan et al. (2006) [4] are a special case. In this paper we show that a large class of 2-Calabi–Yau triangulated categories, including those associated with elements in Coxeter groups from Buan et al. (2009) [7], are triangle equivalent to generalized cluster categories. This was already shown for some special elements in Amiot (2009) [1].     

Detecting cohomology for Lie superalgebras

In this paper we use invariant theory to develop the notion of cohomological detection for Type I classical Lie superalgebras. In particular we show that the cohomology with coefficients in an arbitrary module can be detected on smaller subalgebras. These results are used later to affirmatively answer questions, which were originally posed in Boe et al. (2010) [5] and Bagci et al. (2008) [2], about realizing support varieties for Lie superalgebras via rank varieties constructed for the smaller detecting subalgebras.     

Wall crossings for double Hurwitz numbers

Double Hurwitz numbers count covers of P¹ by genus g curves with assigned ramification profiles over 0 and ∞, and simple ramification over a fixed branch divisor. Goulden, Jackson and Vakil have shown double Hurwitz numbers are piecewise polynomial in the orders of ramification (Goulden et al., 2005) [10], and Shadrin, Shapiro and Vainshtein have determined the chamber structure and wall crossing formulas for g=0 (Shadrin et al., 2008) [15]. This paper gives a unified approach to these results and strengthens them in several ways — the most important being the extension of the results of Shadrin et al. (2008) [15] to arbitrary genus.The main tool is the authors? previous work (Cavalieri et al., 2010) [6] expressing double Hurwitz number as a sum over certain labeled graphs. We identify the labels of the graphs with lattice points in the chambers of certain hyperplane arrangements, which give rise to piecewise polynomial functions. Our understanding of the wall crossing for these functions builds on the work of Varchenko (1987) [17], and could have broader applications.     

An improved monotone algorithm for scheduling related machines with precedence constraints

We answer an open question posed by Krumke et al. (2008) [6] by showing how to turn the algorithm of Chekuri and Bender for scheduling related machines with precedence constraints into an O(logm)-approximation algorithm that is monotone in expectation. This significantly improves on the previously best known monotone approximation algorithms for this problem, from Krumke et al. [6] and Thielen and Krumke (2008) [8], which have an approximation guarantee of O(m^2/3).     

Holographic formula for Q-curvature. II

We extend the holographic formula for the critical Q-curvature in Graham and Juhl (2007) [9] to all Q-curvatures. Moreover, we confirm a conjecture of Juhl (2009) [11].     

Generalized complex and Dirac structures on homogeneous spaces

The aim of this paper is to study generalized complex geometry (Hitchin, 2002) [6] and Dirac geometry (Courant, 1990) [3], (Courant and Weinstein, 1988) [4] on homogeneous spaces. We offer a characterization of equivariant Dirac structures on homogeneous spaces, which is then used to construct new examples of generalized complex structures. We consider Riemannian symmetric spaces, quotients of compact groups by closed connected subgroups of maximal rank, and nilpotent orbits in sln(R). For each of these cases, we completely classify equivariant Dirac structures. Additionally, we consider equivariant Dirac structures on semisimple orbits in a semisimple Lie algebra. Here equivariant Dirac structures can be described in terms of root systems or by certain data involving parabolic subalgebras.     

Approximations for nonlinear mappings by the hybrid method in Hilbert spaces

The hybrid method in mathematical programming was introduced by Haugazeau (1968) [1] and he proved a strong convergence theorem for finding a common element of finite nonempty closed convex subsets of a real Hilbert space. Later, Bauschke and Combettes (2001) [2] proposed some condition for a family of mappings (the so-called coherent condition) and established interesting results by the hybrid method. The authors (Nakajo et al., 2009) [10] extended Bauschke and Combettes’s results. In this paper, we introduce a condition weaker than the coherent condition and prove strong convergence theorems which generalize the results of Nakajo et al. (2009) [10]. And we get strong convergence theorems for a family of asymptotically κ-strict pseudo-contractions, a family of Lipschitz and pseudo-contractive mappings and a one-parameter uniformly Lipschitz semigroup of pseudo-contractive mappings.     

Representation theory of p-adic groups and canonical bases

In this paper, we interpret the Gindikin–Karpelevich formula and the Casselman–Shalika formula as sums over Kashiwara–Lusztig?s canonical bases, generalizing the results of Bump and Nakasuji (2010) [7] to arbitrary split reductive groups. We also rewrite formulas for spherical vectors and zonal spherical functions in terms of canonical bases. In a subsequent paper Kim and Lee (preprint) [14], we will generalize these formulas to p-adic affine Kac–Moody groups.     

Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph

Let G=(V,E) be a simple, connected and undirected graph with vertex set V(G) and edge set E(G). Also let D(G) be the distance matrix of a graph G (Jane?i? et al., 2007) [13]. Here we obtain Nordhaus–Gaddum-type result for the spectral radius of distance matrix of a graph.A sharp upper bound on the maximal entry in the principal eigenvector of an adjacency matrix and signless Laplacian matrix of a simple, connected and undirected graph are investigated in Das (2009) [4] and Papendieck and Recht (2000) [15]. Generally, an upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative matrix with zero diagonal entries and without zero diagonal entries are investigated in Zhao and Hong (2002) [21] and Das (2009) [4], respectively. In this paper, we obtain an upper bound on minimal entry in the principal eigenvector for the distance matrix of a graph and characterize extremal graphs. Moreover, we present the lower and upper bounds on maximal entry in the principal eigenvector for the distance matrix of a graph and characterize extremal graphs.     

Archimedean copulas in finite and infinite dimensions—with application to ruin problems

In this paper we discuss the link between Archimedean copulas and L₁ Dirichlet distributions for both finite and infinite dimensions. With motivation from the recent papers Weng et al. (2009) and Albrecher et al. (2011) we apply our results to certain ruin problems.     

The modular branching rule for affine Hecke algebras of type A

For the affine Hecke algebra of type A at roots of unity, we make explicit the correspondence between geometrically constructed simple modules and combinatorially constructed simple modules and prove the modular branching rule. The latter generalizes work by Vazirani (2002) [22].     

Iterative character constructions for algebra groups

We construct a family of orthogonal characters of an algebra group which decompose the supercharacters defined by Diaconis and Isaacs (2008) [6]. Like supercharacters, these characters are given by nonnegative integer linear combinations of Kirillov functions and are induced from linear supercharacters of certain algebra subgroups. We derive a formula for these characters and give a condition for their irreducibility; generalizing a theorem of Otto (2010) [20], we also show that each such character has the same number of Kirillov functions and irreducible characters as constituents. In proving these results, we observe as an application how a recent computation by Evseev (2010) [7] implies that every irreducible character of the unitriangular group UTn(q) of unipotent n×n upper triangular matrices over a finite field with q elements is a Kirillov function if and only if n?12. As a further application, we discuss some more general conditions showing that Kirillov functions are characters, and describe some results related to counting the irreducible constituents of supercharacters.     

The asymptotic distribution of traces of Maass–Poincaré series

We establish an asymptotic formula with a power savings in the error term for traces of CM values of a family of Maass–Poincaré series which contains the modular j-function as a special case. By work of Borcherds (1998) [2], Zagier (2002) [31], and Bringmann and Ono (2007) [4], these traces are Fourier coefficients of half-integral weight weakly holomorphic modular forms and Maass forms.     

Operator ergodic theory for one-parameter decomposable groups

After initial treatment of the Fourier analysis and operator ergodic theory of strongly continuous decomposable one-parameter groups of operators in the Banach space setting, we show that in the setting of a super-reflexive Banach space X these groups automatically transfer from the setting of R to X the behavior of the Hilbert kernel, as well as the Fourier multiplier actions of functions of higher variation on R. These considerations furnish one-parameter groups with counterparts for the single operator theory in Berkson (2010) [4]. Since no uniform boundedness of one-parameter groups of operators is generally assumed in the present article, its results for the super-reflexive space setting go well beyond the theory of uniformly bounded one-parameter groups on UMD spaces (which was developed in Berkson et al., 1986 [13]), and in the process they expand the scope of vector-valued transference to encompass a genre of representations of R that are not uniformly bounded.     

An algebraic slice in the coadjoint space of the Borel and the Coxeter element

Let g be a complex simple Lie algebra and b a Borel subalgebra. The algebra Y of polynomial semi-invariants on the dual b^? of b is a polynomial algebra on rank g generators (Grothendieck and Dieudonné (1965–1967)) [16]. The analogy with the semisimple case suggests there exists an algebraic slice to coadjoint action, that is an affine translate y+V of a vector subspace of b^? such that the restriction map induces an isomorphism of Y onto the algebra R[y+V] of regular functions on y+V. This holds in type A and even extends to all biparabolic subalgebras (Joseph (2007)) [20]; but the construction fails in general even with respect to the Borel. Moreover already in type C(2) no algebraic slice exists.Very surprisingly the exception of type C(2) is itself an exception. Indeed an algebraic slice for the coadjoint action of the Borel subalgebra is constructed for all simple Lie algebras except those of types B(2m), C(n) and F(4).Outside type A, the slice obtained meets an open dense subset of regular orbits, even though the special point y of the slice is not itself regular. This explains the failure of our previous construction.     

Minimizing the total completion time in a unit-time open shop with release times

We consider the problem of minimizing the total completion time in a unit-time open shop with release times where the number of machines is constant. Brucker and Krämer (1994) proved that this problem is solvable in polynomial time. However, the time complexity of the algorithm presented there is a polynom of a very high degree and, thus, the algorithm is not practicable even for a small number of machines. We give an O(n²) algorithm for the considered problem which is based on dynamic programming. The result is applied to solve a previously open problem with a special resource constraint raised by De Werra et al. (1991).     

Graphs of arbitrary excessive class

We show that there exists a family of r-regular graphs of arbitrarily large excessive index for each integer r greater than 3. Furthermore, we answer a question in Bonisoli and Cariolaro (2007) [1] showing that all the positive integers can be attained as excessive classes of regular graphs.     

Consistent multiple testing for change points

The change point problem for independent normal means is considered as a multiple testing problem. Two stepwise methods are considered. Namely, the binary segmentation method of Vostrikova (1981) [7] and the maximum residual down method of Cohen et al. (2009) [5]. Both of these methods are shown to be consistent. Consistent here means that as sample sizes tend to infinity, the probability of making an error (false rejection or false acceptance) tends to zero.