Higher-order convolutions for Bernoulli and Euler polynomials

We prove convolution identities of arbitrary orders for Bernoulli and Euler polynomials, i.e., sums of products of a fixed but arbitrary number of these polynomials. They differ from the more usual convolutions found in the literature by not having multinomial coefficients as factors. This generalizes a special type of convolution identity for Bernoulli numbers which was first discovered by Yu. Matiyasevich.     

Multivariate matching polynomials of cyclically labelled graphs

We consider the matching polynomials of graphs whose edges have been cyclically labelled with the ordered set of t labels {x₁,…,x_t}.We first work with the cyclically labelled path, with first edge label x_i, followed by N full cycles of labels {x₁,…,x_t}, and last edge label x_j. Let Φ_i,Nt+j denote the matching polynomial of this path. It satisfies the (τ,Δ)-recurrence: , where τ is the sum of all non-consecutive cyclic monomials in the variables {x₁,…,x_t} and . A combinatorial/algebraic proof and a matrix proof of this fact are given. Let G_N denote the first fundamental solution to the (τ,Δ)-recurrence. We express G_N (i) as a cyclic binomial using the symmetric representation of a matrix, (ii) in terms of Chebyshev polynomials of the second kind in the variables τ and Δ, and (iii) as a quotient of two matching polynomials. We extend our results from paths to cycles and rooted trees.     

A refined Gallai-Edmonds structure theorem for weighted matching polynomials

In this work, we prove a refinement of the Gallai-Edmonds structure theorem for weighted matching polynomials by Ku and Wong. Our proof uses a connection between matching polynomials and branched continued fractions. We also show how this is related to a modification by Sylvester of the classical Sturm's theorem on the number of zeros of a real polynomial in an interval. In addition, we obtain some other results about zeros of matching polynomials.     

On the location of zeros of the Laplacian matching polynomials of graphs

Journal of Algebraic Combinatorics - The Laplacian matching polynomial of a graph G, denoted by $$mathscr {LM}(G,x)$$ , is a new graph polynomial whose all zeros are nonnegative real numbers. In...     

Self-reciprocal polynomials and coterm polynomials

We classify all self-reciprocal polynomials arising from reversed Dickson polynomials over \(\mathbb {Z}\) and \(\mathbb {F}_p\), where p is prime. As a consequence, we also obtain coterm polynomials arising from reversed Dickson polynomials.     

On Eisenstein polynomials and zeta polynomials

Eisenstein polynomials, which were defined by Oura, are analogues of the concept of an Eisenstein series. Oura conjectured that there exist some analogous properties between Eisenstein series and Eisenstein polynomials. In this paper, we provide new analogous properties of Eisenstein polynomials and zeta polynomials. These properties are finite analogies of certain properties of Eisenstein series.     

Higher-order elasticity tensors

The independent components of the elasticity tensors of fourth to twelfth order are computed for several types of anisotropic media. Considerations relating to the experimental determination of the constants of nonlinearly elastic anisotropic materials are presented.Mekhanika Polimerov, Vol. 1, No. 6, pp. 40–48, 1965     

Generalized Lucas polynomials and relationships between the Fibonacci polynomials and Lucas polynomials

In this article, we find elements of the Lucas polynomials by using two matrices. We extend the study to the n-step Lucas polynomials. Then the Lucas polynomials and their relationship are generalized in the paper. Furthermore, we give relationships between the Fibonacci polynomials and the Lucas polynomials.     

Higher-order Carmichael numbers

We define a Carmichael number of order to be a composite integer such that th-power raising defines an endomorphism of every -algebra that can be generated as a -module by elements. We give a simple criterion to determine whether a number is a Carmichael number of order , and we give a heuristic argument (based on an argument of Erdos for the usual Carmichael numbers) that indicates that for every there should be infinitely many Carmichael numbers of order . The argument suggests a method for finding examples of higher-order Carmichael numbers; we use the method to provide examples of Carmichael numbers of order .

     

Higher-order symmetrization inequalities and applications

We prove new extended forms of the Pólya-Szegö symmetrization principle. As a consequence new sharp embedding theorems for generalized Sobolev and Besov spaces are proved.     

Alternating Eulerian polynomials and left peak polynomials

We first present grammatical interpretations for the alternating Eulerian polynomials of types A and B. As applications, we then derive several properties of the type B alternating Eulerian polynomials, including recurrence relations, generating function and unimodality. And then, we establish an interesting connection between alternating Eulerian polynomials of type B and left peak polynomials, which implies that the type B alternating Eulerian polynomials have gamma-vectors that alternate in sign.     

On difference polynomials and hereditarily irreducible polynomials

A difference polynomial is one of the form P(x, y) = p(x) ? q(y). Another proof is given of the fact that every difference polynomial has a connected zero set, and this theorem is applied to give an irreducibility criterion for difference polynomials. Some earlier problems about hereditarily irreducible polynomials (HIPs) are solved. For example, P(x, y) is called a HIP (two-variable case) if P(a(x), b(y)) is always irreducible, and it is shown that such two-variable HIPs actually exist.     

Note on Bernstein polynomials and Kantorovich polynomials

We obtain two asymptotic representations of remainder of approximation of derivable functions by Bernstein polynomials and Kantorovich polynomials separately.     

Higher-order Sobolev embeddings and isoperimetric inequalities

Optimal higher-order Sobolev type embeddings are shown to follow via isoperimetric inequalities. This establishes a higher-order analogue of a well-known link between first-order Sobolev embeddings and isoperimetric inequalities. Sobolev type inequalities of any order, involving arbitrary rearrangement-invariant norms, on open sets in Rⁿ${\mathbb{R}}^n$, possibly endowed with a measure density, are reduced to much simpler one-dimensional inequalities for suitable integral operators depending on the isoperimetric function of the relevant sets. As a consequence, the optimal target space in the relevant Sobolev embeddings can be determined both in standard and in non-standard classes of function spaces and underlying measure spaces. In particular, our results are applied to any-order Sobolev embeddings in regular (John) domains of the Euclidean space, in Maz'ya classes of (possibly irregular) Euclidean domains described in terms of their isoperimetric function, and in families of product probability spaces, of which the Gauss space is a classical instance.     

Higher-order energy expansions and spike locations

We consider the following singularly perturbed semilinear elliptic problem: where is a bounded domain in R ^N with smooth boundary , is a small constant and f is some superlinear but subcritical nonlinearity. Associated with (I) is the energy functional defined by where . Ni and Takagi ([29, 30]) proved that for a single boundary spike solution , the following asymptotic expansion holds: where c ₁ > 0 is a generic constant, is the unique local maximum point of and is the boundary mean curvature function at . In this paper, we obtain a higher-order expansion of where c ₂, c ₃ are generic constants and is the scalar curvature at . In particular c ₃ > 0. Some applications of this expansion are given.Received: 14 January 2003, Accepted: 28 July 2003, Published online: 15 October 2003Mathematics Subject Classification (2000): Primary 35B40, 35B45; Secondary 35J25     

Another connection between orthogonal polynomials and L-orthogonal polynomials

We consider a connection that exists between orthogonal polynomials associated with positive measures on the real line and orthogonal Laurent polynomials associated with strong measures of the class S³[0,β,b]. Examples are given to illustrate the main contribution in this paper.     

Infinite sums for Fibonacci polynomials and Lucas polynomials

The Ramanujan Journal - In this paper we establish certain infinite sums involving many arithmetical functions and the Fibonacci polynomials or the Lucas polynomials. Several of the sums are given...