Adjoint polynomials of bridge–path and bridge–cycle graphs and Chebyshev polynomials

The chromatic polynomial of a simple graph G with n>0 vertices is a polynomial of degree n, where α_k(G) is the number of k-independent partitions of G for all k. The adjoint polynomial of G is defined to be , where is the complement of G. We find explicit formulas for the adjoint polynomials of the bridge–path and bridge–cycle graphs. Consequence, we find the zeros of the adjoint polynomials of several families of graphs.     

An endpoint space–time estimate for the Schrödinger equation

We obtain endpoint estimates for the Schrödinger operator f→eitΔf in with initial data f in the homogeneous Sobolev space . The exponents and regularity index satisfy and . For n=2 we prove the estimates in the range q>16/5, and for n?3 in the range q>2+4/(n+1).     

Critical heights on the moduli space of polynomials

Let Md be the moduli space of one-dimensional, degree d?2, complex polynomial dynamical systems. The escape rates of the critical points determine a critical heights mapG:Md→Rd−1. For generic values of G, we show that each connected component of a fiber of G is the deformation space for twist deformations on the basin of infinity. We analyze the quotient space obtained by collapsing each connected component of a fiber of G to a point. The space is a parameter-space analog of the polynomial tree T(f) associated to a polynomial f:C→C, studied in DeMarco and McMullen (2008) [6], and there is a natural projection from to the space of trees Td. We show that the projectivization is compact and contractible; further, the shift locus in has a canonical locally finite simplicial structure. The top-dimensional simplices are in one-to-one correspondence with topological conjugacy classes of structurally stable polynomials in the shift locus.     

More Efficient Algorithm for Ordered Tree Inclusion

Given two ordered trees and , the tree inclusion problem is to determine whether it is possible to obtain from by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for structured text databases. In this paper we present anO(|leaves()| ||) time andO(|leaves()|min(depth(), |leaves()|)) space algorithm for ordered tree inclusion, by means of a sophisticated bottom-up-matching strategy. Our algorithm improves the previous best one (Kilpeläinen, 1992, Ph.D. thesis, Dept. Computer Science, Univ. Helsinki) that requiresO(|| ||) time andO(||min(depth(), |leaves()|)) space.     

Logarithmic Sobolev Inequalities for Pinned Loop Groups

LetGbe a connected compact type Lie group equipped with anAd_G-invariant inner product on the Lie algebra ofG. Given this data there is a well known left invariant “H¹-Riemannian structure” on =(G)—the infinite dimensional group of continuous based loops inG. Using this Riemannian structure, we define and construct a “heat kernel”ν_T(g₀, ·) associated to the Laplace–Beltrami operator on (G). HereT>0,g₀∈(G), andν_T(g₀,·) is a certain probability measure on (G). For fixedg₀∈(G) andT>0, we use the measureν_T(g₀,·) and the Riemannian structure on (G) to construct a “classical” pre-Dirichlet form. The main theorem of this paper asserts that this pre-Dirichlet form admits a logarithmic Sobolev inequality.     

Problems arising from jackknifing the estimate of a Kaplan-Meier integral

Stute and Wang (1994) considered the problem of estimating the integral S^θ = ∫ θ dF, based on a possibly censored sample from a distribution F, where θ is an F-integrable function. They proposed a Kaplan-Meier integral to approximate S^θ and derived an explicit formula for the delete-1 jackknife estimate . differs from only when the largest observation, X_(n), is not censored (δ_(n) = 1 and next-to-the-largest observation, X_(n-1), is censored (δ_(n-1) = 0). In this note, it will pointed out that when X_(n) is censored is based on a defective distribution, and therefore can badly underestimate . We derive an explicit formula for the delete-2 jackknife estimate . However, on comparing the expressions of and , their difference is negligible. To improve the performance of and , we propose a modified estimator according to Efron (1980). Simulation results demonstrate that is much less biased than and and .     

Backward Shift Invariant Operator Ranges

Results on first order Ext groups for Hilbert modules over the disk algebra are used to study certain backward shift invariant operator ranges, namely de Branges–Rovnyak spaces and a more general class called (W; B) spaces. Necessary and sufficient conditions are given for the groups Ext¹_A()(, (W; B)) to vanish whereis thedualof the vector-valued Hardy module, H². One condition involves an extension problem for the Hankel operator with symbolB,Γ_B, but viewed as a module map from H²into (W; B). The group Ext¹_A()(, (W; B))=(0) precisely whenΓ_Bextends to a module map from L²into (W; B) and this in turn is equivalent to the injectivity of (W; B) in the category of contractive HilbertA()-modules. This result applied to the de Branges–Rovnyak spaces yields a connection between the extension problem for the HankelΓ_B and the operator corona problem.     

On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification

Let be identically distributed random vectors in R^d, independently drawn according to some probability density. An observation is said to be a layered nearest neighbour (LNN) of a point if the hyperrectangle defined by and contains no other data points. We first establish consistency results on , the number of LNN of . Then, given a sample of independent identically distributed random vectors from R^d×R, one may estimate the regression function by the LNN estimate , defined as an average over the Y_i’s corresponding to those which are LNN of . Under mild conditions on r, we establish the consistency of towards 0 as n→∞, for almost all and all p≥1, and discuss the links between r_n and the random forest estimates of Breiman (2001) [8]. We finally show the universal consistency of the bagged (bootstrap-aggregated) nearest neighbour method for regression and classification.     

A Representation of Projection Lattices and Their States in Euclidean Space

We propose a representationr : ∪ Ω → ^ν, where is the collection of closed subspaces of ann-dimensional real, complex, or quaternionic Hilbert space , or equivalently, the projection lattice of this Hilbert space, where Ω is the set of all states ω : → [0, 1]. The value that ω ∈ Ω takes ina ∈ is given by the scalar product of the representative points (r(a) andr(ω)). The representationr(a ∨ b) of the join of two orthogonal elementsa, b ∈ is equal tor(a) + r(b). The convex closure of the representation of Σ, the set of atoms of , is equal to the representation of Ω.     

On Supersingular Abelian Varieties of Dimension Two over Finite Fields

In this paper we study the characteristic polynomials and the rational point group structure of supersingular varieties of dimension two over finite fields. Meanwhile, we also list allL-functions of supersingular curves of genus two over ₂and determine the group structure of their divisor class groups over all finite algebraic extension of ₂.     

A further refinement of a three critical points theorem

In this paper, we complete the refinement process, made by Ricceri (2009) [4], of a result established by Ricceri (2000) [1], which is one of the most applied abstract multiplicity theorems in the past decade. A sample of application of our new result is as follows.Let (n≥3) be a bounded domain with smooth boundary and let .Then, for each ?>0 small enough, there exists λ_?>0 such that, for every compact interval , there exists ρ>0 with the following property: for every λ∈[a,b] and every continuous function satisfying for some , there exists δ>0 such that, for each ν∈[0,δ], the problem has at least three weak solutions whose norms in are less than ρ.     

The Real Tree

In this note, it is shown that there exists a natural metric on the set[formula]of bounded subsets of containing their infimum which endowsTwith the structure of an -tree so that, for everyt∈T, the “number” of connected components ofT\{t} coincides with the cardinality #() of the set of subsets of . In addition, the set of ends ofTis explicitly determined, and various further features ofTare discussed, too.     

Euler–Lehmer constants and a conjecture of Erdös

The Euler–Lehmer constants γ(a,q) are defined as the limits We show that at most one number in the infinite list is an algebraic number. The methods used to prove this theorem can also be applied to study the following question of Erdös. If f:Z/qZ→Q is such that f(a)=±1 and f(q)=0, then Erdös conjectured that If , we show that the Erdös conjecture is true.     

Modulation spaces, Wiener amalgam spaces, and Brownian motions

We study the local-in-time regularity of the Brownian motion with respect to localized variants of modulation spaces and Wiener amalgam spaces . We show that the periodic Brownian motion belongs locally in time to and for (s−1)q<−1, and the condition on the indices is optimal. Moreover, with the Wiener measure μ on T, we show that and form abstract Wiener spaces for the same range of indices, yielding large deviation estimates. We also establish the endpoint regularity of the periodic Brownian motion with respect to a Besov-type space . Specifically, we prove that the Brownian motion belongs to for (s−1)p=−1, and it obeys a large deviation estimate. Finally, we revisit the regularity of Brownian motion on usual local Besov spaces , and indicate the endpoint large deviation estimates.     

Asymptotic distributions of maxima of complete and incomplete samples from multivariate stationary Gaussian sequences

Let be a sequence of d-dimensional stationary Gaussian vectors, and let denote the partial maxima of . Suppose that there are missing data in each component of and let denote the partial maxima of the observed variables. In this note, we study two kinds of asymptotic distributions of the random vector where the correlation and cross-correlation satisfy some dependence conditions.     

Unconditional constants and polynomial inequalities

If P is a polynomial on R^m of degree at most n, given by , and P_n(R^m) is the space of such polynomials, then we define the polynomial |P| by . Now if is a convex set, we define the norm on P_n(R^m), and then we investigate the inequality providing sharp estimates on for some specific spaces of polynomials. These ’s happen to be the unconditional constants of the canonical bases of the considered spaces.     

Indecomposable and noncrossed product division algebras over function fields of smooth p-adic curves

We construct indecomposable and noncrossed product division algebras over function fields of connected smooth curves X over Zp. This is done by defining an index preserving morphism which splits , where is the completion of K(X) at the special fiber, and using it to lift indecomposable and noncrossed product division algebras over .     

Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles

Two cycles are said to be adjacent if they share a common edge. Let G be a planar graph without triangles adjacent 4-cycles. We prove that if Δ(G)≥6, and and if Δ(G)≥8, where and denote the list edge chromatic number and list total chromatic number of G, respectively.     

Second order, multi-point problems with variable coefficients

In this paper, we consider the eigenvalue problem consisting of the equation where and λ∈R, together with the multi-point boundary conditions where m^±?1 are integers, and, for i=1,…,m^±, , , with , . We show that if the coefficients are sufficiently small (depending on r), then the spectral properties of this problem are similar to those of the usual separated problem, but if the coefficients are not sufficiently small, then these standard spectral properties need not hold. The spectral properties of such multi-point problems have been obtained before for the constant coefficient case (r≡1), but the variable coefficient case has not been considered previously (apart from the existence of ‘principal’ eigenvalues).Some nonlinear multi-point problems are also considered. We obtain a (partial) Rabinowitz-type result on global bifurcation from the eigenvalues, and various nonresonance conditions for the existence of general solutions and also of nodal solutions—these results rely on the spectral properties of the linear problem.     

On the complexity of submodular function minimisation on diamonds

Let (L;?,?) be a finite lattice and let n be a positive integer. A function f:Lⁿ→R is said to be submodular if for all . In this article we study submodular functions when L is a diamond. Given oracle access to f we are interested in finding such that as efficiently as possible. We establish

• • 

  a min–max theorem, which states that the minimum of the submodular function is equal to the maximum of a certain function defined over a certain polyhedron; and

• • 

  a good characterisation of the minimisation problem, i.e., we show that given an oracle for computing a submodular f:Ln→Z and an integer m such that , there is a proof of this fact which can be verified in time polynomial in n and ; and

• • 

  a pseudopolynomial-time algorithm for the minimisation problem, i.e., given an oracle for computing a submodular f:Ln→Z one can find in time bounded by a polynomial in n and .