This paper presents explicit formulas and algorithms to compute the eigenvalues and eigenvectors of order-one-quasiseparable matrices. Various recursive relations for characteristic polynomials of their principal submatrices are derived. The cost of evaluating the characteristic polynomial of an N × N matrix and its derivative is only O(N). This leads immediately to several versions of a fast q...

Copyright q 2010 Lee-Chae Jang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We investigate several arithmetic properties of h, q-Genocchi polynomials and numbers of higher order.

Pólya’s enumeration theorem states that the number of labelings of a finite set up to symmetry is given by a polynomial in the number of labels. We give a new perspective on this theorem by generalizing it to partially ordered sets and order preserving maps. Further we prove a reciprocity statement in terms of strictly order preserving maps generalizing a classical result by Stanley (1970). We ...

Let p be a fixed prime number. Throughout this paper Zp, Qp, and Cp will, respectively, denote the ring of p-adic rational integers, the field of p-adic rational numbers, and the completion of algebraic closure of Qp. For x ∈ Cp, we use the notation x q 1 − q / 1 − q . Let UD Zp be the space of uniformly differentiable functions on Zp, and let vp be the normalized exponential valuation of Cp wi...

Differential microphone arrays have the potential to be widely deployed in hands-free communication systems thanks to their frequency-invariant beampatterns, high directivity factors, and small apertures. Traditionally, they are designed and implemented in a multistage way with uniform linear geometries. This paper presents an approach to the design of differential microphone arrays with orthog...

A given polynomial, possibly with multiple roots, is factored into several lower-degree distinct-root polynomials with natural-order-integer powers. All the roots, including multiplicities, of the original polynomial may be obtained by solving these lowerdegree distinct-root polynomials, instead of the original high-degree multiple-root polynomial directly. The approach requires polynomial Grea...

One expansion of the chromatic polynomial n(G,x) of a graph G relies on spanning trees of a graph. In fact, for a connected graph G of order n, one can express n(G,x) = (1 )“-‘x cyi’=;’ ti (1 -x)‘, where ti is the nun&r of spanning trees with external activity 0 and internal activity i. Moreover, it is known (via commutative ring theory) that ti arises as the number of monomials of degree n i 1...

We consider Koornwinder’s method for constructing orthogonal polynomials in two variables from orthogonal polynomials in one variable. If semiclassical orthogonal polynomials in one variable are used, then Koornwinder’s construction generates semiclassical orthogonal polynomials in two variables. We consider two methods for deducing matrix Pearson equations for weight functions associated with ...