Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles and paths, respectively. They satisfy recurrence relations with respect to elementary edge or vertex operations. They are related to other polynomials and ca...

A foundation polynomial is used to induce polynomial bases for F n?1 x], the vector space of polynomials of degree less than n over an arbitrary eld F. The associated bases are then used to block diagonalize the Bezout matrix of two polynomials under congruence.

A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique, called continuous scaling. The main measure of progress is that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution, and thus can be contracted. The full version is available on arXiv:1307.680...

Brylawski proved the coefficients of the Tutte polynomial of a matroid satisfy a set of linear relations. We extend these relations to a generalization of the Tutte polynomial that includes greedoids and antimatroids. This leads to families of new identities for antimatroids, including trees, posets, chordal graphs and finite point sets in Rn. It also gives a “new” linear relation for matroids ...

The aim of this note is to study a set of paravector valued homogeneous monogenic polynomials that can be used for a construction of sequences of generalized Appell polynomials in the context of Clifford analysis. Therefore, we admit a general form of the vector part of the first degree polynomial in the Appell sequence. This approach is different from the one presented in recent papers on this...

Generalized nonnegative polynomials were studied in a sequence of recent papers [4], [6], [7], [8], and [9]. A number of well-known inequalities in approximation theory were extended to them, by utilizing the generalized degree in place of the ordinary one. Our motivation was to find tools to examine systems of orthogonal polynomials simultaneously, associated with generalized Jacobi, or at lea...

We introduce the notions of unsigned and signed generalized Lucas sequences and prove certain polynomial recurrence relations on their characteristic polynomials. We also characterize when these characteristic polynomials are irreducible polynomials over a finite field. Moreover, we obtain the explicit expressions of the remainders of Dickson polynomials of the first kind divided by the charact...

In this paper we present a Multi-Element generalized Polynomial Chaos (MEgPC) method to deal with stochastic inputs with arbitrary probability measures. Based on the decomposition of the random space of the stochastic inputs, we construct numerically a set of orthogonal polynomials with respect to a conditional probability density function (PDF) in each element and subsequently implement genera...

We present several variations on the harmonic Rayleigh–Ritz method. First, we introduce a relative harmonic approach for the standard, generalized, and polynomial eigenproblem. Second, a harmonic extraction method is studied for rightmost eigenvalues of generalized eigenvalue problems. Third, we propose harmonic extraction methods for large eigenvalues of generalized and polynomial eigenproblem...