Compositions of n as alternating sequences of weakly increasing and strictly decreasing partitions

Compositions and partitions of positive integers are often studied in separate frameworks where partitions are given by q-series generating functions and compositions exhibiting specific patterns are designated by generating functions for these patterns. Here, we view compositions as alternating sequences of weakly increasing and strictly decreasing partitions (i.e. alternating blocks). We obtain generating functions for the number of such partitions in terms of the size of the composition, the number of parts and the total number of “valleys” and “peaks”. From this, we find the total number of “peaks” and “valleys” in the composition of n which have the mentioned pattern. We also obtain the generating function for compositions which split into just two partition blocks. Finally, we obtain the two generating functions for compositions of n that start either with a weakly increasing partition or a strictly decreasing partition.     

The convolution structure for Jacobi function expansions

The product ϕ _λ ^(α,β) (t₁)ϕ _λ ^(α,β) (t₂) of two Jacobi functions is expressed as an integral in terms of ϕ _λ ^(α,β) (t₃) with explicit non-negative kernel, when α≧β≧−1/2. The resulting convolution structure for Jacobi function expansions is studied. For special values of α and β the results are known from the theory of symmetric spaces.     

Irreducible characters of the group S n that are semiproportional on A n

Previously, we dubbed the conjecture that the alternating group A_n has no semiproportional irreducible characters for any natural n [1]. This conjecture was then shown to be equivalent to the following [3]. Let α and β be partitions of a number n such that their corresponding characters χ^α and χ^β in the group S_n are semiproportional on A_n. Then one of the partitions α or β is self-associated. Here, we describe all pairs (α, β) of partitions satisfying the hypothesis and the conclusion of the latter conjecture. Supported by RFBR (grant No. 07-01-00148) and by RFBR-NSFC (grant No. 05-01-39000). __________ Translated from Algebra i Logika, Vol. 47, No. 2, pp. 135–156, March–April, 2008.     

Trees with non-regular fractal boundary

For any given 0 〈α 〈 β 〈 ∞, we construct a tree such that under tree metric, the Hausdorff dimension of the corresponding boundary is α, but both the Packing dimension and the boxing dimension are β. Applying the connection between tree and iterated functions system, non- regular fractal sets on real line are constructed. Moreover, the method adopted in our paper is different from those which have been used before for constructing non-regular fractal set in general metric space.     

Multiple sums and integrals as neutral BKP tau functions

We consider multiple sums and multiple integrals as tau functions of the so-called neutral Kadomtsev-Petviashvili hierarchy on a root lattice of type B; neutral fermions, as the simplest tool, are used to derive them. The sums are taken over projective Schur functions Q_α for strict partitions α. We consider two types of such sums: weighted sums of Q_α over strict partitions α and sums over products Q_αQ_γ. We thus obtain discrete analogues of the beta ensembles (β = 1, 2, 4). Continuous versions are represented as multiple integrals, which are interesting in several problems in mathematics and physics.     

Zeros in Tables of Characters for the Groups <Emphasis Type="Italic">S</Emphasis><Subscript>n</Subscript> and <Emphasis Type="Italic">A</Emphasis><Subscript>n</Subscript>. II

Let P(n) be the set of all partitions of a natural number n. In the representation theory of symmetric groups, for every partition α ∈ P(n), the partition h(α) ∈ P(n) is defined so as to produce a certain set of zeros in the character table for S_n. Previously, the analog f(α) of h(α) was obtained pointing out an extra set of zeros in the table mentioned. Namely, h(α) is greatest (under the lexicographic ordering ≤) of the partitions β of n such that χ^α(g_β) ≠ 0, and f(α) is greatest of the partitions γ of n that are opposite in sign to h(α) and are such that χ^α(g_γ) ≠ 0, where χ^α is an irreducible character of S_n, indexed by α, and g_β is an element in the conjugacy class of S_n, indexed by β. For α ∈ P(n), under some natural restrictions, here, we construct new partitions h′(α) and f′(α) of n possessing the following properties. (A) Let α ∈ P(n) and n ⩾ 3. Then h′(α) is identical is sign to h(α), χ^α(g_h′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of h(α), and h′(α) < γ < h(α). (B) Let α ∈ P(n), α ≠ α′, and n ⩾ 4. Then f′(α) is identical in sign to f(α), χ^α(g_f′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of f(α), and f′(α) < γ < f(α). The results obtained are then applied to study pairs of semiproportional irreducible characters in A_n. Supported by RFBR grant No. 04-01-00463. __________ Translated from Algebra i Logika, Vol. 44, No. 6, pp. 643–663, November–December, 2005.     

Characterizations of life distributions from percentile residual lifetimes

Summary An α-percentile residual life function does not uniquely determine a life distribution; however, a continuous life distribution can be uniquely determined by its α-percentile and β-percentile residual life functions if α and β satisfy a certain condition. Two characterizations in terms of percentle residual lifetimes are given for the Beta (1, θ,K), Exponential (λ) and Pareto (θ,K) family of distributions.     

Arbitrary groups as two-point stabilisers of symmetric groups acting on partitions

We give a short, direct proof that given any finite group G there exist positive integers k and l and partitions α₁and α₂ of {1, …, kl } into l subsets of size k such that (S _kl ) _{α 1}, _{α 2}≅ G.The method used will also show that given any finite group G there exists a regular bipartite graph whose automorphism group is isomorphic to G     

Existence of unbiased estimate of regression parameters in simple linear EV models

It is well known that for one-dimensional normal EV regression model X = x u,Y =α βx e, where x, u, e are mutually independent normal variables and Eu=Ee=0, the regression parameters a and βare not identifiable without some restriction imposed on the parameters. This paper discusses the problem of existence of unbiased estimate for a and βunder some restrictions commonly used in practice. It is proved that the unbiased estimate does not exist under many such restrictions. We also point out one important case in which the unbiased estimates of a and βexist, and the form of the MVUE of a and βare also given.     

Irreducible characters with equal roots in the groups Sn and An

We show that treating of (non-trivial) pairs of irreducible characters of the group S_n sharing the same set of roots on one of the sets A_n and S_n \ A_n is divided into three parts. This, in particular, implies that any pair of such characters χ^α and χ^β (α and β are respective partitions of a number n) possesses the following property: lengths d(α) and d(β) of principal diagonals of Young diagrams for α and β differ by at most 1. Supported by RFBR grant No. 04-01-00463 and by RFBR-NSFC grant No. 05-01-39000. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 3–25, January–February, 2007.     

Exponents for the tails of distributions in some polling models

The tail asymptotics of the distribution of the waiting-time W in some polling models is investigated. When this is of the form P[W > ϰ] ∼ αϰ^βe ^-ηϰ for some α,β,η, we show how to calculate the exponents β and η, and we establish the extent and form of their dependence on the distributions of the service-time and switchover-time. The exponents are expressed in terms of the fixed points and Lyapunov exponents of a dynamical system which we associate with the recursion which is used to calculate the moment generating functions of the waiting time. This revised version was published online in June 2006 with corrections to the Cover Date.     

Two-parameter family of infinite-dimensional diffusions on the Kingman simplex

We construct a two-parameter family of diffusion processes X _α,θ on the Kingman simplex, which consists of all nonincreasing infinite sequences of nonnegative numbers with sum less than or equal to one. The processes on this simplex arise as limits of finite Markov chains on partitions of positive integers. For α = 0, our process coincides with the infinitely-many-neutral-alleles diffusion model constructed by Ethier and Kurtz (1981) in population genetics. The general two-parameter case apparently lacks population-genetic interpretation. In the present paper, we extend Ethier and Kurtz’s main results to the two-parameter case. Namely, we show that the (two-parameter) Poisson-Dirichlet distribution PD(α,θ) is the unique stationary distribution for the process X _α,θ and that the process is ergodic and reversible with respect to PD(α, θ). We also compute the spectrum of the generator of X _α,θ . The Wright-Fisher diffusions on finite-dimensional simplices turn out to be special cases of X _α,θ for certain degenerate parameter values.     

On polynomial equations

The set of all triples of positive integers (α, β, γ) for which there exist polynomials f, g, h (with or without common factors) which satisfy the equationf ^α + ^β =h ^γ , is determined.     

Optimization for products of concave functions

Ifh denotes the product of finitely many concave non-negative functions on a compact interval [a, b], then it is shown that there exist pointsα andβ witha≤α≤β≤b such thath is strictly increasing on [α, α), constant on (α, β), and strictly decreasing on (β, b]. This structure theorem leads to an extension of several classical optimization results for concave functions on convex sets to the case of products of concave functions.     

Enumeration of plane partitions

Using some recent results involving Young tableaux and matrices of non-negative integers [10], it is possible to enumerate various classes of plane partitions by actual construction. One of the results is a simple proof of MacMahon's [12] generating function for plane partitions. Previous results of this type [12, 4, 3, 8, 7] involved complicated algebraic methods which did not reveal any intrinsic “reason” why the corresponding generating functions have such a simple form.     

On the embedding problem with noncommutative kernel of order p4. VI

In the case of number fields the embedding problem of a p-extension with non-Abelian kernel of order p⁴ is studied. The two kernels of order 3⁴ with generators α, γ and relations α⁹ = 1, [α,α]³=1,[α,αγγ]==1,[αγγ]=α³,γ³=1 or γ³=α³ and the kernel of order 2⁴ with generators α, β, γ and relations α⁴=1 β²,[αγ]=1, [α,γ]=1,[βγ]=α² are considered. For kernels of odd order the embedding problem is always solvable. For the kernel of order 16 the solvability conditions are reduced to those for the associated problems at the Archimedean points, and to the compatibility condition. Bibliography: 9 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 227, 1995, pp. 74–82.     

Lattice-universal Orlicz spaces on probability spaces

Lattice-universal Orlicz function spacesL ^F _α,β[0, 1] with prefixed Boyd indices are constructed. Namely, given 0<α<β<∞ arbitrary there exists Orlicz function spacesL ^F _α,β[0, 1] with indices α and β such that every Orlicz function spaceL ^G [0, 1] with indices between α and β is lattice-isomorphic to a sublattice ofL ^F _α,β[0, 1]. The existence of classes of universal Orlicz spacesl ^Fα,β(I) with uncountable symmetric basis and prefixed indices α and β is also proved in the uncountable discrete case. Partially supported by BFM2001-1284.     

Localized Polynomial Frames on the Interval with Jacobi Weights

As is well known the kernel of the orthogonal projector onto the polynomials of degree n in L²(w_α,β, [−1, 1]), w_α,β(t) = (1 − t)^α(1 + t)^β, can be written in terms of Jacobi polynomials. It is shown that if the coefficients in this kernel are smoothed out by sampling a compactly supported C^∞ function then the resulting function has nearly exponential (faster than any polynomial) rate of decay away from the main diagonal. This result is used for the construction of tight polynomial frames for L²(w_α,β) with elements having almost exponential localization.     

Score Lists in Tripartite Hypertournaments

Given non-negative integers l, m, n, α, β and γ with l ≥ α ≥ 1, m ≥ β ≥ 1 and n ≥ γ ≥ 1, an [α,β,γ]-tripartite hypertournament on l + m + n vertices is a four tuple (U, V, W, E), where U, V and W are three sets of vertices with |U| = l , |V| = m and |W| = n, and E is a set of (α + β + γ)-tuples of vertices, called arcs, with exactly α vertices from U, exactly β vertices from V,and exactly γ vertices from W, such that any subset U₁∪ V₁∪ W₁ of U∪ V∪ W, E contains exactly one of the (α + β + γ)! (α + β + γ) − tuples whose entries belong to U₁∪ V₁∪ W₁. We obtain necessary and sufficient conditions for three lists of non-negative integers in non-decreasing order to be the losing score lists or score lists of some [α, β, γ]-tripartite hypertournament. Supported by National Science Foundation of China (No.10501021).     

Exchangeable Gibbs partitions and Stirling triangles

For two collections of nonnegative and suitably normalized weights W = (W_j) and V = (V_n,k), a probability distribution on the set of partitions of the set {1, …, n} is defined by assigning to a generic partition {A_j, j ≤ k} the probability V_n,k , where |A_j| is the number of elements of A_j. We impose constraints on the weights by assuming that the resulting random partitions Π _n of [n] are consistent as n varies, meaning that they define an exchangeable partition of the set of all natural numbers. This implies that the weights W must be of a very special form depending on a single parameter α ∈ [− ∞, 1]. The case α = 1 is trivial, and for each value of α ≠ = 1 the set of possible V-weights is an infinite-dimensional simplex. We identify the extreme points of the simplex by solving the boundary problem for a generalized Stirling triangle. In particular, we show that the boundary is discrete for − ∞ ≤ α < 0 and continuous for 0 ≤ α < 1. For α ≤ 0 the extremes correspond to the members of the Ewens-Pitman family of random partitions indexed by (α,θ), while for 0 < α < 1 the extremes are obtained by conditioning an (α,θ)-partition on the asymptotics of the number of blocks of Π_n as n tends to infinity. Bibliography: 29 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 325, 2005, pp. 83–102.