Bayes estimation of number of signals

Bayes estimation of the number of signals, q, based on a binomial prior distribution is studied. It is found that the Bayes estimate depends on the eigenvalues of the sample covariance matrix S for white-noise case and the eigenvalues of the matrix S ₂ (S ₁+A)^–1 for the colored-noise case, where S ₁ is the sample covariance matrix of observations consisting only noise, S ₂ the sample covariance matrix of observations consisting both noise and signals and A is some positive definite matrix. Posterior distributions for both the cases are derived by expanding zonal polynomial in terms of monomial symmetric functions and using some of the important formulae of James (1964, Ann. Math. Statist., 35, 475–501).     

Boolean Hierarchies of Partitions over a Reducible Base

The Boolean hierarchy of partitions was introduced and studied by Kosub and Wagner, primarily over the lattice of NP-sets. Here, this hierarchy is treated over lattices with the reduction property, showing that it has a much simpler structure in this instance. A complete characterization is given for the hierarchy over some important lattices, in particular, over the lattices of recursively enumerable sets and of open sets in the Baire space.     

The Gaussian Polynomial,Restricted k-Rowed Plane Partitions and Hopf Algebras

Resorting to suitable representations of q-algebras, we give a new proof of the theorem stating that the Gaussian polynomial defined by the q-binomial coefficient is the weight (polynomial generating function) of the restricted (i.e. limited in number and size of summands) k-rowed plane partitions.     

Divisibility of Certain Partition Functions by Powers of Primes

Let be the prime factorization of a positive integer k and let b _k (n) denote the number of partitions of a non-negative integer n into parts none of which are multiples of k. If M is a positive integer, let S _k (N; M) be the number of positive integers N for which b _k(n ) 0(mod M). If we prove that, for every positive integer j In other words for every positive integer j, b _k(n) is a multiple of for almost every non-negative integer n. In the special case when k=p is prime, then in representation-theoretic terms this means that the number ofp -modular irreducible representations of almost every symmetric groupS _n is a multiple of p ^j. We also examine the behavior of b _k(n) (mod ) where the non-negative integers n belong to an arithmetic progression. Although almost every non-negative integer n (mod t) satisfies b _k(n) 0 (mod ), we show that there are infinitely many non-negative integers n r (mod t) for which b _k(n) 0 (mod ) provided that there is at least one such n. Moreover the smallest such n (if there are any) is less than 2 .     

Universal encoding for unimodal maps

The standard encoding procedure to describe the chaotic orbits of unimodal maps is accurately investigated. We show that the grammatical rules of the underlying language can be easily classified in a compact form by means of a universal parameter . Two procedures to construct finite graphs which approximate non-Markovian cases are discussed, showing also the intimate relation with the corresponding construction of approximate Markov partitions. The convergence of the partial estimates of the topological entropy is discussed, proving that the error decreases exponentially with the length of the sequences considered. The rate is shown to coincide with the topological entropyh itself. Finally, a superconvergent method to estimateh is introduced.     

An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging

This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions.     

Expression for restricted partition function through Bernoulli polynomials

Explicit expressions for restricted partition function W(s,d ^m ) and its quasiperiodic components W _j (s,d ^m ) (called Sylvester waves) for a set of positive integers d ^m ={d ₁,d ₂,…,d _m } are derived. The formulas are represented in a form of a finite sum over Bernoulli polynomials of higher order with periodic coefficients.