The connected partition lattice of a graph and the reconstruction conjecture

Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.     

Graded annihilators of modules over the Frobenius skew polynomial ring, and tight closure

This paper is concerned with the tight closure of an ideal in a commutative Noetherian local ring of prime characteristic . Several authors, including R. Fedder, K-i. Watanabe, K. E. Smith, N. Hara and F. Enescu, have used the natural Frobenius action on the top local cohomology module of such an to good effect in the study of tight closure, and this paper uses that device. The main part of the paper develops a theory of what are here called `special annihilator submodules' of a left module over the Frobenius skew polynomial ring associated to ; this theory is then applied in the later sections of the paper to the top local cohomology module of and used to show that, if is Cohen-Macaulay, then it must have a weak parameter test element, even if it is not excellent.

     

On an extremal problem of Selberg II

Let m_p be the minimum of the product under the conditions that and . In our previous paper [J. Kaneko, On an extremal problem of Selberg, J. Approx. Theory 142 (2006) 129–137], we showed that the following estimates hold. provided p255. In this note, we prove that the limit of as p→∞ exists and is expressed by the (unique) solution of some simultaneous transcendental equations. By using this expression we obtain numerically.     

Relaxation of variational problems in two-dimensional nonlinear elasticity

Consider a plate occupying in a reference configuration a bounded open set Ω ⊂ ℝ ² , and let be its stored-energy function. In this paper we are concerned with relaxation of variational problems of type:

Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients

^** Email: todor{at}math.ethz.ch^*** Corresponding author. Email: schwab{at}math.ethz.ch A scalar, elliptic boundary-value problem in divergence formwith stochastic diffusion coefficient a(x, ) in a bounded domainD ^d is reformulated as a deterministic, infinite-dimensional,parametric problem by separation of deterministic (x D) andstochastic ( ) variables in a(x, ) via Karhúnen–Loèveor Legendre expansions of the diffusion coefficient. Deterministic,approximate solvers are obtained by projection of this probleminto a product probability space of finite dimension M and sparsediscretizations of the resulting M-dimensional parametric problem.Both Galerkin and collocation approximations are considered.Under regularity assumptions on the fluctuation of a(x, ) inthe deterministic variable x, the convergence rate of the deterministicsolution algorithm is analysed in terms of the number N of deterministicproblems to be solved as both the chaos dimension M and themultiresolution level of the sparse discretization resp. thepolynomial degree of the chaos expansion increase simultaneously.     

Complete Solutions and Extremality Criteria to Polynomial Optimization Problems

This paper presents a set of complete solutions to a class of polynomial optimization problems. By using the so-called sequential canonical dual transformation developed in the author’s recent book [Gao, D.Y. (2000), Duality Principles in Nonconvex Systems: Theory, Method and Applications, Kluwer Academic Publishers, Dordrecht/Boston/London, xviii + 454 pp], the nonconvex polynomials in can be converted into an one-dimensional canonical dual optimization problem, which can be solved completely. Therefore, a set of complete solutions to the original problem is obtained. Both global minimizer and local extrema of certain special polynomials can be indentified by Gao-Strang’s gap function and triality theory. For general nonconvex polynomial minimization problems, a sufficient condition is proposed to identify global minimizer. Applications are illustrated by several examples.     

也谈厄米多项式的递推关系

由厄米多项式的母函数出发,推导出厄米多项式的递推关系以及厄米多项式中系数的递推关系.     

Lemniscates and inequalities for the logarithmic capacities of continua

It is shown that if P(z) = z ⁿ + ? is a polynomial with connected lemniscate E(P) = {z: ¦P(z)¦ ≤ 1} and m critical points, then, for any n? m+1 points on the lemniscate E(P), there exists a continuum γ ? E(P) of logarithmic capacity cap γ ≤ 2^?1/n which contains these points and all zeros and critical points of the polynomial. As corollaries, estimates for continua of minimum capacity containing given points are obtained.     

Estimates for the Eigenvalues of Matrices

For matrices whose eigenvalues are real (such as Hermitian or real symmetric matrices), we derive simple explicit estimates for the maximal (λ_max) and the minimal (λ_min) eigenvalues in terms of determinants of order less than 3. For 3 × 3 matrices, we derive sharper estimates, which use det A but do not require to solve cubic equations.     

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure

We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative error ɛ in time polynomial in the problem size and in 1/ɛ. Such a scheme was developed by van Hoesel and Wagelmans [8] for a capacitated economic lot-sizing problem with monotone concave (convex) production and backlogging cost functions. We omit concavity and convexity restrictions. Furthermore, we take advantage of a straightforward dynamic programming algorithm applied to a rounded problem.