Certain classes of potentials for p ‐Laplacian to be non‐degenerate

Given a positive integer n and an exponent 1 ≤ α ≤ ∞. We will find explicitly the optimal bound r_n such that if the L^α norm of a potential q (t ) satisfies ‖q ‖equation/tex2gif-inf-2.gif < r_n then the n ^th Dirichlet eigenvalue of the onedimensional p ‐Laplacian with the potential q (t ): (|u ′|^{p –2} u ′)′ + (λ + q (t )) |u |^{p –2}u = 0 (1 < p < ∞) will be positive. Using these bounds, we will construct, for the Dirichlet, the Neumann, the periodic or the antiperiodic boundary conditions, certain classes of potentials q (t ) so that the p ‐Laplacian with the potential q (t ) is non‐degenerate, which means that the above equation with λ = 0 has only the trivial solution verifying the corresponding boundary condition. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

拟线性双曲组在半有界初始轴上的柯西问题整体经典解的渐近性态

In this paper we study the asymptotic behavior of global classical solutions to the Cauchy problem with initial data given on a semi-bounded axis for quasilinear hyperbolic systems. Based on the existence result on the global classical solution, we prove that, when t tends to the infinity, the solution approaches a combination of C1 travelling wave solutions with the algebraic rate （1 ＋ t）^-u, provided that the initial data decay with the rate （1 ＋ x）^-（l＋u） （resp. （1 - x）^-（1＋u）） as x tends to ＋∞ （resp. -∞）, where u is a positive constant.     

Logarithmic SUMT limits in convex programming

The limits of a class of primal and dual solution trajectories associated with the Sequential Unconstrained Minimization Technique (SUMT) are investigated for convex programming problems with non-unique optima. Logarithmic barrier terms are assumed. For linear programming problems, such limits – of both primal and dual trajectories – are strongly optimal, strictly complementary, and can be characterized as analytic centers of, loosely speaking, optimality regions. Examples are given, which show that those results do not hold in general for convex programming problems. If the latter are weakly analytic (Bank et al. [3]), primal trajectory limits can be characterized in analogy to the linear programming case and without assuming differentiability. That class of programming problems contains faithfully convex, linear, and convex quadratic programming problems as strict subsets. In the differential case, dual trajectory limits can be characterized similarly, albeit under different conditions, one of which suffices for strict complementarity. Received: November 13, 1997 / Accepted: February 17, 1999?Published online February 22, 2001     

Degeneracy in infinite horizon optimization

We consider sequential decision problems over an infinite horizon. The forecast or solution horizon approach to solving such problems requires that the optimal initial decision be unique. We show that multiple optimal initial decisions can exist in general and refer to their existence as degeneracy. We then present a conceptual cost perturbation algorithm for resolving degeneracy and identifying a forecast horizon. We also present a general near-optimal forecast horizon.This material is based on work supported by the National Science Foundation under Grants ECS-8409682 and ECS-8700836.     

Bounds on the localization number

We consider the localization game played on graphs, wherein a set of cops attempt to determine the exact location of an invisible robber by exploiting distance probes. The corresponding optimization parameter for a graph G is called the localization number and is written as ζ(G). We settle a conjecture of Bosek et al by providing an upper bound on the chromatic number as a function of the localization number. In particular, we show that every graph with ζ(G) ≤ k has degeneracy less than 3^k and, consequently, satisfies χ(G) ≤ 3^ζ(G). We show further that this degeneracy bound is tight. We also prove that the localization number is at most 2 in outerplanar graphs, and we determine, up to an additive constant, the localization number of hypercubes.     

Alternating signs of quiver coefficients

We prove a formula for the Grothendieck class of a quiver variety, which generalizes the cohomological component formulas of Knutson, Miller, and Shimozono. Our formula implies that the -theoretic quiver coefficients have alternating signs and gives an explicit combinatorial formula for these coefficients. We also prove some new variants of the factor sequences conjecture and a conjecture of Knutson, Miller, and Shimozono, which states that their double ratio formula agrees with the original quiver formulas of the author and Fulton. For completeness we include a short proof of the ratio formula.

     

GLOBAL EXISTENCE OF WEAKLY DISCONTIN UOUS SOLUTIONS TO THE CAUCHY PROBLEM WITH A KIND OF NON-SMOOTH INITIAL DATA FOR QUASILINEAR HYPERBOLIC SYSTEMS

The authors consider the Cauchy problem with a kind of non-smooth initial datafor quasilinear hyperbolic systems and obtain a necessary and sufficient condition toguarantee the existence and uniqueness of global weakly discontinuous solution.     

Global Classical Solutions to Partially Dissipative Quasilinear Hyperbolic Systems with One Weakly Linearly Degenerate Characteristic

For a kind of partially dissipative quasilinear hyperbolic systems without Shizuta-Kawashima condition,in which all the characteristics,except a weakly linearly degenerate one,are involved in the dissi...     

Degeneracy graphs: theory and application an updated survey

A survey of various aspects of the theory and application of degeneracy graphs (DGs for short) is given. The notion and some basic properties of DGs are introduced, cycling of the simplex method is discussed, the neighborhood problem is tackled, and the application of the so-called optimum DGs to particular problems which are connected with optimal degenerate solutions of a linear programming problem is presented. The impact of weakly redundant constraints on various postoptimal analyses under degeneracy is briefly described.     

Eight-vertex model: Anisotropic interfacial tension and equilibrium crystal shape

The anisotropic interfacial tension of the eight-vertex model is found by a new method, which introduces two inhomogeneous systems. As the width of the system becomes large, a doublet of the largest eigenvalues of the row-row transfer matrix is asymptotically degenerate. The anisotropic interfacial tension is calculated from their finite-size correction terms in this limit. By the use of the anisotropic interfacial tension, the equilibrium crystal shape of the eight-vertex model is derived via Wulff's construction. The equilibrium crystal shape is represented as a simple algebraic curve. We discuss the close relation between the algebraic curve and the form of an elliptic function appearing in the expression of the interfacial tension.