Arithmetical properties of the number of t-core partitions

Let Λ={λ ₁≥⋅⋅⋅≥λ _s ≥1} be a partition of an integer n. Then the Ferrers-Young diagram of Λ is an array of nodes with λ _i nodes in the ith row. Let λ _j ′ denote the number of nodes in column j in the Ferrers-Young diagram of Λ. The hook number of the (i,j) node in the Ferrers-Young diagram of Λ is denoted by H(i,j):=λ _i +λ _j ′−i−j+1. A partition of n is called a t-core partition of n if none of the hook numbers is a multiple of t. The number of t-core partitions of n is denoted by a(t;n). In the present paper, some congruences and distribution properties of the number of 2 ^t -core partitions of n are obtained. A simple convolution identity for t-cores is also given.      

Normal Approximations for Descents and Inversions of Permutations of Multisets

Normal approximations for descents and inversions of permutations of the set {1,2,…,n} are well known. We consider the number of inversions of a permutation π(1),π(2),…,π(n) of a multiset with n elements, which is the number of pairs (i,j) with 1≤i<j≤n and π(i)>π(j). The number of descents is the number of i in the range 1≤i<n such that π(i)>π(i+1). We prove that, appropriately normalized, the distribution of both inversions and descents of a random permutation of the multiset approaches the normal distribution as n→∞, provided that the permutation is equally likely to be any possible permutation of the multiset and no element occurs more than α n times in the multiset for a fixed α with 0<α<1. Both normal approximation theorems are proved using the size bias version of Stein’s method of auxiliary randomization and are accompanied by error bounds. This work was supported by a research fellowship from the Sloan Foundation.     

A process variability control chart

In this study a Shewhart type control chart namely the V _t chart, is proposed for improved monitoring of the process variability of a quality characteristic of interest Y. The proposed control chart is based on the ratio type estimator of the variance using a single auxiliary variable X. It is assumed that (Y, X) follows a bivariate normal distribution. The design structure of the V _t chart is developed for Phase-I quality control and its comparison is made with those of the S ² chart (a well-known Shewhart control chart) and the V _r chart (a Shewhart type control chart proposed by Riaz (Comput Stat, 2008a) used for the same purpose. It is observed that the proposed V _t chart outperforms the S ² and V _r charts, in terms of discriminatory power, for detecting moderate to large shifts in the process variability. It is observed that the performance of the V _t chart keeps improving with an increase in |ρ _yx | , where ρ _yx is the correlation between Y and X.     

Symmetric Schröder paths and restricted involutions

Let A_k be the set of permutations in the symmetric group S_k with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns A_k. We present a bijection between symmetric Schröder paths of length 2n and involutions of length n+1 avoiding A₄. Statistics such as the number of right-to-left maxima and fixed points of the involution correspond to the number of steps in the symmetric Schröder path of a particular type. For each k≥3 we determine the generating function for the number of involutions avoiding the subsequences in A_k, according to length, first entry and number of fixed points.     

On the spectral function of the Poisson–Voronoi cells

Denote by (t)=∑_n1e^−λ_nt, t>0, the spectral function related to the Dirichlet Laplacian for the typical cell of a standard Poisson–Voronoi tessellation in . We show that the expectation E(t), t>0, is a functional of the convex hull of a standard d-dimensional Brownian bridge. This enables us to study the asymptotic behaviour of E(t), when t→0⁺,+∞. In particular, we prove that the law of the first eigenvalue λ₁ of satisfies the asymptotic relation lnP{λ₁t}−2^dω_dj_(d−2)/2^d·t^−d/2 when t→0⁺, where ω_d and j_(d−2)/2 are respectively the Lebesgue measure of the unit ball in and the first zero of the Bessel function J_(d−2)/2.     

Polynomial Approximation of Conformal Maps

Let G be a finite domain, bounded by a Jordan curve Γ , and let f ₀ be a conformal map of G onto the unit disk. We are interested in the best rate of uniform convergence of polynomial approximation to f ₀ , in the case that Γ is piecewise-analytic without cusps. In particular, we consider the problem of approximating f ₀ by the Bieberbach polynomials π _n and derive results better than those in [5] and [6] for the case that the corners of Γ have interior angles of the form π/N . In the proof, the Lehman formulas for the asymptotic expansion of mapping functions near analytic corners are used. We study the question when these expansions contain logarithmic terms. December 6, 1995. Date revised: August 5, 1996.     

Fully invariant transformations and associated groups

It is well known that the symmetric group S _ntogether with one idempotent of rank n- 1 on a finite n-element set Nserves as a set of generators for the semigroup T _nof all the total transformations on N. It is also well known that the singular part Sing _n of T _n can be generated by a set of idempotents of rank n- 1. The purpose of this paper is to begin an investigation of the way in which Sing_nand its subsemigroups can be generated by the conjugates of a subset of elements of T _n by a subgroup of S _n . We look for the smallest subset of elements of T _n that will serve and, correspondingly, for a characterization of those subgroups of S _n that will serve. Using some techniques from graph theory we prove our main result:the conjugates of a single transformation of rank n- 1 under Gsuffice to generate Sing_nif and only if Gis what we define to be a 2-block transitive subgroup of S _n .     

On L 1 Bounds for Asymptotic Normality of Some Weakly Dependent Random Variables

In the present paper, we consider L ₁ bounds for asymptotic normality for the sequence of r.v.’s X ₁,X ₂,… (not necessarily stationary) satisfying the ψ-mixing condition. The L ₁ bounds have been obtained in terms of Lyapunov fractions which, in a particular case, under finiteness of the third moments of summands and the finiteness of ∑ _r≥1 r ² ψ(r), are of order O(n ^−1/2), where the function ψ participates in the definition of the ψ-mixing condition.      

Superconvergence of Legendre projection methods for the eigenvalue problem of a compact integral operator

In this paper, we consider the Galerkin and collocation methods for the eigenvalue problem of a compact integral operator with a smooth kernel using the Legendre polynomials of degree ≤n. We prove that the error bounds for eigenvalues are of the order O(n^−2r) and the gap between the spectral subspaces are of the orders O(n^−r) in L₂-norm and O(n^1/2−r) in the infinity norm, where r denotes the smoothness of the kernel. By iterating the eigenvectors we show that the iterated eigenvectors converge with the orders of convergence O(n^−2r) in both L₂-norm and infinity norm. We illustrate our results with numerical examples.     

A dynamic adaptive local search algorithm for the circular packing problem

This paper studies the circular packing problem (CPP) which consists of packing n non-identical circles C_i of known radius r_i, i ∈ N = {1, … , n}, into the smallest containing circle C. The objective is to determine the coordinates (x_i, y_i) of the center of C_i, i ∈ N, as well as the radius r and center (x, y) of C. This problem, which is a variant of the two-dimensional open dimension problem, is solved using a two-step, dynamic, adaptive, local search algorithm. At each iteration, the algorithm identifies the set of potential “best local positions” of a circle C_i, i ∈ N, given the positions of the previously packed circles, and determines for each of these positions the coordinates and radius of the smallest containing circle. The “best local position” minimizes the radius of the current containing circle. That is, every time an additional circle is packed, both the center and the radius of the containing circle are dynamically updated, and the smallest containing circle is known. The experimental results reflect the good performance of the algorithm.     

Classification of Simple C-Algebras: Inductive Limits of Matrix Algebras Over One-Dimensional Spaces

In this article, we will give a complete classification of simple C^*-algebras which can be written as inductive limits of algebras of the form A_n=⊕_i=1^k_nM_[n,i](C(X_n,i)), where X_n,i are arbitrary variable one-dimensional compact metrizable spaces. The results unify and generalize the previous results for the case X_n,i=S¹ and for the case of X_n,i being trees. We obtain our classification results by reducing the case of general one-dimensional spaces to the case of circles. The techniques in this paper play important roles in the study of the case of higher-dimensional spaces.     

Factoring and decomposing a class of linear functional systems

Within a constructive homological algebra approach, we study the factorization and decomposition problems for a class of linear functional (determined, over-determined, under-determined) systems. Using the concept of Ore algebras of functional operators (e.g., ordinary/partial differential operators, shift operators, time-delay operators), we first concentrate on the computation of morphisms from a finitely presented left module M over an Ore algebra to another one M′, where M (resp., M′) is a module intrinsically associated with the linear functional system Ry = 0 (resp., R′z = 0). These morphisms define applications sending solutions of the system R′z = 0 to solutions of R y = 0. We explicitly characterize the kernel, image, cokernel and coimage of a general morphism. We then show that the existence of a non-injective endomorphism of the module M is equivalent to the existence of a non-trivial factorization R = R₂R₁ of the system matrix R. The corresponding system can then be integrated “in cascade”. Under certain conditions, we also show that the system Ry = 0 is equivalent to a system R′z = 0, where R′ is a block-triangular matrix of the same size as R. We show that the existence of idempotents of the endomorphism ring of the module M allows us to reduce the integration of the system Ry = 0 to the integration of two independent systems R₁y₁ = 0 and R₂y₂ = 0. Furthermore, we prove that, under certain conditions, idempotents provide decompositions of the system Ry = 0, i.e., they allow us to compute an equivalent system R′z = 0, where R′ is a block-diagonal matrix of the same size as R. Applications of these results in mathematical physics and control theory are given. Finally, the different algorithms of the paper are implemented in the Maple package Morphisms based on the library oremodules.     

On the ε-entropy of classes of holomorphic functions

Suppose thatB _R ^d is a ball of radiusR in ℂ ^d and σ is the standard measure on the unit sphere in ℂ ^d . ForR>1, 1≤p≤∞, and for the natural numbersl, d, byH _R ⁰ (l, p, d) we denote the class of functionsf holomorphic inB _R ^d and such that in the homogeneous polynomial expansion of the firstl summands the zero and radial derivatives of orderl belong to the closed unit ball of the Hardy spaceH ^p (B _R ^d ). In this paper an asymptotic formula for the ε-entropy of the classH _R ⁰ (l, p, d) in the spacesL ^p (σ), 1≤p<∞, and is obtained. Translated fromMatematicheskie Zametki, Vol. 68, No. 2, pp. 286–293, August, 2000.     

Interval Valued Intuitionistic （S, T）-fuzzy Hv-submodules

On the basis of the concept of the interval valued intuitionistic fuzzy sets introduced by K. Atanassov, the notion of interval valued intuitionistic fuzzy Hv-submodules of an Hv-module with respect to a t-norm T and an s-norm S is given and the characteristic properties are described. The homomorphic image and the inverse image are investigated. In particular, the connections between interval valued intuitionistic （S, T）-fuzzy Hv-submodules and interval valued intuitionistic （S, T）-fuzzy submodules are discussed.     

When Some Complement of a Submodule Is a Summand

A module M is said to satisfy the C ₁₁ condition if every submodule of M has a (i.e., at least one) complement which is a direct summand. It is known that the C ₁ condition implies the C ₁₁ condition and that the class of C ₁₁-modules is closed under direct sums but not under direct summands. We show that if M = M ₁ ⊕ M ₂, where M has C ₁₁ and M ₁ is a fully invariant submodule of M, then both M ₁ and M ₂ are C ₁₁-modules. Moreover, the C ₁₁ condition is shown to be closed under formation of the ring of column finite matrices of size Γ, the ring of m-by-m upper triangular matrices and right essential overrings. For a module M, we also show that all essential extensions of M satisfying C ₁₁ are essential extensions of C ₁₁-modules constructed from M and certain subsets of idempotent elements of the ring of endomorphisms of the injective hull of M. Finally, we prove that if M is a C ₁₁-module, then so is its rational hull. Examples are provided to illustrate and delimit the theory.     

Coincidences of projections and linear n-valued maps of tori

We prove that the Nielsen fixed point number N(φ) of an n-valued map φ:X?X of a compact connected triangulated orientable q-manifold without boundary is equal to the Nielsen coincidence number of the projections of the graph of φ, a subset of X×X, to the two factors. For certain q×q integer matrices A, there exist “linear” n-valued maps Φn,A,σ:Tq?Tq of q-tori that generalize the single-valued maps fA:Tq→Tq induced by the linear transformations TA:Rq→Rq defined by TA(v)=Av. By calculating the Nielsen coincidence number of the projections of its graph, we calculate N(Φn,A,σ) for a large class of linear n-valued maps.     

Extensions and biextensions of locally constant group schemes,tori and abelian schemes

Let S be a scheme. We compute explicitly the group of homomorphisms, the S-sheaf of homomorphisms, the group of extensions, and the S-sheaf of extensions involving locally constant S-group schemes, abelian S-schemes, and S-tori. Using the obtained results, we study the categories of biextensions involving these geometrical objects. In particular, we prove that if G _i (for i = 1, 2, 3) is an extension of an abelian S-scheme A _i by an S-torus T _i , the category of biextensions of (G ₁, G ₂) by G ₃ is equivalent to the category of biextensions of the underlying abelian S-schemes (A ₁, A ₂) by the underlying S-torus T ₃.      

On the Hardness of Computing Intersection,Union and Minkowski Sum of Polytopes

For polytopes P ₁,P ₂⊂ℝ ^d , we consider the intersection P ₁∩P ₂, the convex hull of the union CH(P ₁∪P ₂), and the Minkowski sum P ₁+P ₂. For the Minkowski sum, we prove that enumerating the facets of P ₁+P ₂ is NP-hard if P ₁ and P ₂ are specified by facets, or if P ₁ is specified by vertices and P ₂ is a polyhedral cone specified by facets. For the intersection, we prove that computing the facets or the vertices of the intersection of two polytopes is NP-hard if one of them is given by vertices and the other by facets. Also, computing the vertices of the intersection of two polytopes given by vertices is shown to be NP-hard. Analogous results for computing the convex hull of the union of two polytopes follow from polar duality. All of the hardness results are established by showing that the appropriate decision version, for each of these problems, is NP-complete.