We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.

We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials, matching polynomials, Narayana polynomials and Eulerian polynomials. We also settle certain conjectures of Stahl on genus polynomials by proving them for cer...

Recently, the authors developed a matrix approach to multivariate polynomial sequences by using methods of Hypercomplex Function Theory (Matrix representations of a basic polynomial sequence in arbitrary dimension. Comput. Methods Funct. Theory, 12 (2012), no. 2, 371-391). This paper deals with an extension of that approach to a recurrence relation for the construction of a complete system of o...

We present a way of thinking of exponential families as geodesic surfaces in the class of positive functions considered as a (multiplicative) sub-group G of the group G of all invertible elements in the algebra A of all complex bounded functions defined on a measurable space. For that we have to study a natural geometry on that algebra. The class D of densities with respect to a given measure w...

In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with wild cards. A maximal motif is such a representative motif that is not properly contained in any larger motifs with the same location lists. Although the enumeration problem for maximal motifs with wild cards has been studied in (Parida et al., CPM’01), (Pisanti et a...

A sequence of complex numbers is holonomic if it satisfies a linear recurrence with polynomial coefficients. A power series is holonomic if it satisfies a linear differential equation with polynomial coefficients, which is equivalent to its coefficient sequence being holonomic. It is well known that all algebraic power series are holonomic. We show that the analogous statement for sequences is ...

The Shortest Path Reconfiguration problem has as input a graph G with unit edge lengths, with vertices s and t, and two shortest st-paths P and Q. The question is whether there exists a sequence of shortest st-paths that starts with P and ends with Q, such that subsequent paths differ in only one vertex. This is called a rerouting sequence. This problem is shown to be PSPACE-complete. For claw-...

In this paper, we consider the problem of finding all maximal motifs in an input string for the class of repeated motifs with wild cards. A maximal motif is such a representative motifs that is not properly contained in larger motifs with the same location lists. The enumeration problem for maximal motifs with wild cards has been introduced in (Parida et al., SODA’00, CPM’01), and has been stud...

We apply Zeilberger’s algorithm to generate relations of finite-type necessary to obtain inner bounds for the extreme zeros of orthogonal polynomial sequences with 3F2 hypergeometric representations. Using this method, we improve previously obtained upper bounds for the smallest and lower bounds for the largest zeros of the Hahn polynomials and we identify inner bounds for the extreme zeros of ...

Using random variables as motivation, this paper presents an exposition of formalisms developed in [RT1, RT2] for the classical umbral calculus. A variety of examples are presented, culminating in several descriptions of sequences of binomial type in terms of umbral polynomials.