Bolthausen used a variation of Stein's method to give an inductive proof of the Berry-Esseen theorem for sums of independent, identically distributed random variables. We modify this technique to prove a Berry-Esseen theorem for character ratios of a random representation of the symmetric group on transpositions. An analogous result is proved for Jack measure on partitions.

In this paper we examine a collective decision problem, where the set of heterogeneous individuals is partitioned into several groups, each choosing its own policy (e.g., location of a public project) from the given policy space. The model is that of “horizontal product differentiation” where individuals display distinct preferences over the policy space. We first consider the notion of “effici...

Let P1, . . . ,Pn be properties of graphs. A (P1, . . . ,Pn)-partition of a graph G is a partition {V1, . . . , Vn} of V (G) such that, for each i = 1, . . . , n, the subgraph of G induced by Vi has property Pi. If a graph G has a unique (P1, . . . ,Pn)-partition we say it is uniquely (P1, . . . ,Pn)partitionable. We establish best lower bounds for the order of uniquely (P1, . . . ,Pn)-partitio...

Spatial partitioning is commonly used for parallel simulation of spatial–temporal systems, such as simulations of wildfires. Achieving effective spatial partitioning is a challenging task due to the dynamic behavior of the simulation models. This paper presents a partitioning method named profile-based spatial partitioning for parallel simulation of large scale wildfires. The profile-based part...

Vertical partitioning is a crucial step in physical database design in row-oriented databases. A number of vertical partitioning algorithms have been proposed over the last three decades for a variety of niche scenarios. In principle, the underlying problem remains the same: decompose a table into one or more vertical partitions. However, it is not clear how good different vertical partitioning...

In this article we present an application of decompositions of automata to obtain distributed controllers. The decomposition technique is derived from the classical method of partitions. Tiffs is then applied to the domain of discrete event systems. We show that it is possible to decompose a monolithic controller into smaller controllers which are non-conflicting. This is derived from the notio...

Generating functions of plane overpartitions are obtained using various methods: non–intersecting paths, RSK type algorithms and symmetric functions. We extend some of the results to cylindric partitions. Also, we show that plane overpartitions correspond to domino tilings and we give some basic properties of this correspondence.

A multi-parafermion basis of states for the Zk parafermionic models is derived. Its generating function is constructed by elementary steps. It corresponds to the Andrews multiple-sum which enumerates partitions whose parts separated by the distance k− 1 differ by at least 2. Two analogous bases are derived for graded parafermions; one of these entails a new expression for their fermionic charac...