Pólya's permanent problem.
Polynômes de Stanley et extensions linéaires d'un ordre partiel
Polynômes eulériens modulo
Polynomial analogues of Ramanujan congruences for Han's hooklength formula
This article considers the eta power . It is proved that the coefficients of in this expression, as polynomials in b, exhibit equidistribution of the coefficients in the nonzero residue classes mod 5 when n = 5j+4. Other symmetries, as well as symmetries for other primes and prime powers, are proved, and some open questions are raised.
Polynomial extension of Fleck's congruence
Polynomial identities which imply identities of Euler and Jacobi
Polynomial sequences generated by infinite Hessenberg matrices
We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study properties of the polynomial sequences and their corresponding matrices which are related to recurrence relations, companion matrices, matrix similarity, construction algorithms, and generating functions. When the Hessenberg matrix is also Toeplitz...
Polynomials of multipartitional type and inverse relations
Chou, Hsu and Shiue gave some applications of Faà di Bruno's formula to characterize inverse relations. Our aim is to develop some inverse relations connected to the multipartitional type polynomials involving to binomial type sequences.
Poset homology of Rees products, and -Eulerian polynomials.
Positions of value in generalized domineering and chess.
Positivity of three-term recurrence sequences.
Potenzen der Pascalmatrix und eine Identität der Kombinatorik.
Powers of a matrix and combinatorial identities.
Prefix exchanging and pattern avoidance by involutions.
Primal-dual approximation algorithms for a packing-covering pair of problems
We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the problem of finding a (weighted) minimum clique cover in an interval graph. The problem pair involves weights and capacities; we consider the case of unit weights and the case of unit capacities. In each case we describe a simple algorithm that outputs a solution to the packing problem and...
Primal-dual approximation algorithms for a packing-covering pair of problems
We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the problem of finding a (weighted) minimum clique cover in an interval graph. The problem pair involves weights and capacities; we consider the case of unit weights and the case of unit capacities. In each case we describe a simple algorithm that outputs a solution to the packing problem and...
Prime divisors of -binomial coefficients
Prime factors of binomial coefficients and related problems
Primitive words and spectral spaces.
Probabilistic proofs of hook length formulas involving trees.