An Euler‐genus approach to the calculation of the crosscap‐number polynomial

In 1994, J. Chen, J. Gross, and R. Rieper demonstrated how to use the rank of Mohar's overlap matrix to calculate the crosscap‐number distribution, that is, the distribution of the embeddings of a graph in the nonorientable surfaces. That has ever since been by far the most frequent way that these distributions have been calculated. This article introduces a way to calculate the Euler‐genus polynomial of a graph, which combines the orientable and the nonorientable embeddings, without using the overlap matrix. The crosscap‐number polynomial for the nonorientable embeddings is then easily calculated from the Euler‐genus polynomial and the genus polynomial.     

Genus polynomials and crosscap‐number polynomials for ring‐like graphs

An H‐linear graph is obtained by transforming a collection of copies of a fixed graph H into a chain. An H‐ring‐like graph is formed by binding the two end‐copies of H in such a chain to each other. Genus polynomials have been calculated for bindings of several kinds. In this paper, we substantially generalize the rules for constructing sequences of H‐ring‐like graphs from sequences of H‐linear graphs, and we give a general method for obtaining a recursion for the genus polynomials of the graphs in a sequence of ring‐like graphs. We use Chebyshev polynomials to obtain explicit formulas for the genus polynomials of several such sequences. We also give methods for obtaining recursions for partial genus polynomials and for crosscap‐number polynomials of a bar‐ring of a sequence of disjoint graphs.     

Supernumary polylogarithmic ladders and related functional equations

Summary The nature of the polylogarithmic ladder is briefly reviewed, and its close relationship to the associated cyclotomic equation explained. Generic results for the base determined by the family of equationsu ^p +u ^q = 1 are developed, and many new supernumary ladders, existing for particular values ofp andq, are discussed in relation to theirad hoc cyclotomic equations. Results for ordersn from 6 through 9, for which no relevant functional equations are known, are reviewed; and new results for the base , where ³ + = 1, are developed through the sixth order.Special results for the exponentp from 4 through 6 are determined whenever a new cyclotomic equation can be constructed. Only the equationu ⁵+u ³ = 1 has so far resisted this process. The need for the constraint (p,q) = 1 is briefly considered if redundant formulas are to be avoided.The equationu ^6m+1 +u ^6r–1 = 1 is discussed and some valid results deduced. This equation is divisible byu ² –u + 1, and the quotient polynomial is useful for constructing cyclotomic equations. The casem = 1,r = 2 is the first example encountered for which no valid ladders have yet been found.New functional equations to give the supernumary -ladders of index 24 are developed, but their construction runs into difficulty at the third order, apparently requiring the introduction of an adjoint set of variables that blocks the extension to the fourth order.A demonstration, based on the indices of existing accessible and supernumary ladders, indicates that functional equations based on arguments ±z ^m (1–z) ^r (1 +z) ^s are not capable of extension to the sixth order.There are some miscellaneous supernumary ladders that seem incapable, at this time, of analytic proof, and these are briefly discussed. In conclusion, applications of ladders are considered, and attention drawn to the existence of ladders with the base on the unit circle giving rise to Clausenfunction formulas which may play an important role inK-theory.     

Optimization over analytic functions whose founrier coefficients are constrained

This article gives necessary and sufficient conditions for local solutions to several very general constrained optimization problems over spaces of analytic functions.The results presented here have many applications, a particular instance of which is the sup-norm approximation of functions continuous on the unit circle in the complex plane by functions continuous on the circle and analytic on the open disk and whose Fourier coefficients satisfy prescribed linear relations.Also, the results in this article generalize Nevanlinna-Pick and Caratheodory-Fejer Interpolation results to allow values of arbitrary derivatives of functions to be assigned or merely bounded. Classically, NP and CF solve only problems with consecutive derivatives specified.In engineering, constraints on the Fourier coefficients of a frequency response function correspond to constraints on its time domain behavior. Indeed the central problems of control theory involve both time and frequency domain constraints. That is precisely what the results in this paper handle.Supported in part by the AFOSR and the NSF     

Further results on supernumary polylogarithmic ladders

Summary With the help of the PARI computer program a number of matters left unresolved from previous work have now been settled. It will be recalled that a ladder is a rational sum of polylogarithms, with predetermined coefficients, of powers of a given algebraic base. The simplest bases considered are the roots in (0, 1) ofu ^p +u ^q = 1 for various integersp andq.. They possess a number of generic results, together with some additional equations, termed supernumary for certain specific values ofp andq. In particular, ladders of the base (see [1]) have been extended to the sixth order, and involve a new index, 60, found by the PARI program. The base from (p, q) = (11, 7) has an additional index 20, and this combines with earlier results to produce a valid ladder. The apparent barren feature of certain equations is now explained in terms of a need to work with a sufficient number of results. It is confirmed that the equation with (p, q) = (5, 3) indeed does not possess any supernumary results.A complete investigation of the smallest Salem number of degree four is given: it possesses results to the 8th order. An introduction is given to similar studies for the smallest known Salem number, which has now been shown to extend to the 16th order.Some ladder results for combined bases are found, with one such formula deducible from a three-variable dilogarithmic functional equation. Formulas of a new type are developed in which summation over conjugate roots enables ladders to be extended fromn = 2 to 3.     

Darboux transformations of Jacobi matrices and Padé approximation

Let J be a monic Jacobi matrix associated with the Cauchy transform F of a probability measure. We construct a pair of the lower and upper triangular block matrices L and U such that J=LU and the matrix J_C=UL is a monic generalized Jacobi matrix associated with the function F_C(λ)=λF(λ)+1. It turns out that the Christoffel transformation J_C of a bounded monic Jacobi matrix J can be unbounded. This phenomenon is shown to be related to the effect of accumulating at ∞ of the poles of the Padé approximants of the function F_C although F_C is holomorphic at ∞. The case of the UL-factorization of J is considered as well.     

Almost everywhere convergence of Ciesielski-Fourier series of <Emphasis Type="Italic">H</Emphasis><Subscript>1</Subscript>functions

It is proved that a lacunary sequence of the Ciesielski-Fourier series of converges almost everywhere to f. Received: 8 September 2003     

Restricted even permutations and Chebyshev polynomials

We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.     

Semi-Harmonicity,Integral Means and Euler Type Vector Fields

The Dirichlet product of functions on a semi-Riemann domain and generalized Euler vector fields, which include the radial, -Euler, and the -Neumann vector fields, are introduced. The integral means and the harmonic residues of functions on a Riemann domain are studied. The notion of semi-harmonicity of functions on a complex space is introduced. It is shown that, on a Riemann domain, the semi-harmonicity of a locally integrable function is characterized by local mean-value properties as well as by weak harmonicity. In particular, the Weyl’s Lemma is extended to a Riemann domain. Supports by Minnesota State University, Mankato and the Grant “Globale Methoden in der komplexen Geometrie” of the German research society DFG are gratefully acknowledged.     

Robustness of the controllability for the heat equation under the influence of multiple impulses and delays

For many control systems in real life, impulses and delays are intrinsic properties that do not modify their behavior. Thus, we conjecture that under certain conditions the abrupt changes and delays as perturbations of a system, that could model a real situation, do not modify properties such as controllability. In this regard, we prove the approximate controllability of the semilinear heat equation under the influence of multiple impulses and delays, this is done by using new techniques, avoiding fixed point theorems, employed by A.E. Bashirov et al.     

On the support of tempered distributions

We show that, given a tempered distribution S whose Fourier transform is a function of polynomial growth, a point x in is outside the support of S if and only if the Fourier integral of S is summable in Bochner-Riesz means to zero uniformly on a neighbourhood of x. Received: 29 December 2005     

A fractional version of the Erdős-Faber-Lovász conjecture

LetH be any hypergraph in which any two edges have at most one vertex in common. We prove that one can assign non-negative real weights to the matchings ofH summing to at most |V(H)|, such that for every edge the sum of the weights of the matchings containing it is at least 1. This is a fractional form of the Erds-Faber-Lovász conjecture, which in effect asserts that such weights exist and can be chosen 0,1-valued. We also prove a similar fractional version of a conjecture of Larman, and a common generalization of the two.Supported in part by NSF grant MCS 83-01867, AFOSR Grant 0271 and a Sloan Research Fellowship     

Ordered OLPS and CF Nth numerators

Definitions, theorems and examples are established for a general model of Laurent polynomial spaces and ordered orthogonal Laurent polynomial sequences, ordered with respect to ordered bases and orthogonal with respect to inner products ·=L°⊙ decomposed into transition functional ⊙ and strong moment functional, or, more generally, sample functional L couplings. Under this formulation that is shown to subsume those in the existing literature, new fundamental results are produced, including necessary and sufficient conditions for ordered OLPS to be sequences of nth numerators of continued fractions, in contrast to the classical result concerning nth denominators which is shown to hold only in special cases.     

Coverings of the Vertices of a Graph by Small Cycles

Given a graph G with n vertices, we call c_k(G) the minimum number of elementary cycles of length at most k necessary to cover the vertices of G. We bound c_k(G) from the minimum degree and the order of the graph.     

Optimal dual frames for erasures II

We continue the investigation on optimal dual frames for erasures. We obtain an necessary and sufficient condition under which the canonical dual frames are the unique optimal dual frames for erasures. We examine several special simple conditions under which the canonical dual is either not optimal or it is optimal dual but not unique one.     

On discrete and continuous norms in Paley-Wiener spaces and consequences for exponential frames

It is well known that for certain sequences {t_n}_n the usual L^p norm ·_p in the Paley-Wiener space PW ^p is equivalent to the discrete norm f_p,{tn}:=( _n=– |f(t_n)|^p)^1/p for 1 p = < and f_,{tn}:=sup _n|f(t_n| for p=). We estimate f_p from above by Cf_p, _n and give an explicit value for C depending only on p, , and characteristic parameters of the sequence {t_n}_n. This includes an explicit lower frame bound in a famous theorem of Duffin and Schaeffer.     

Modulation spaces and pseudodifferential operators

We use methods from time-frequency analysis to study boundedness and traceclass properties of pseudodifferential operators. As natural symbol classes, we use the modulation spaces onR ^2d , which quantify the notion of the time-frequency content of a function or distribution. We show that if a symbol lies in the modulation spaceM _,1 (R ^2d ), then the corresponding pseudodifferential operator is bounded onL ²(R ^d ) and, more generally, on the modulation spacesM _p,p (R ^d ) for 1p. If lies in the modulation spaceM _2,2 ^s (R ^2d )=L _s ^/2 (R ^2d )H ^s (R ^2d ), i.e., the intersection of a weightedL ²-space and a Sobolev space, then the corresponding operator lies in a specified Schatten class. These results hold for both the Weyl and the Kohn-Nirenberg correspondences. Using recent embedding theorems of Lipschitz and Fourier spaces into modulation spaces, we show that these results improve on the classical Calderòn-Vaillancourt boundedness theorem and on Daubechies' trace-class results.