Point approximation of a space-homogeneous transport equation

Summary We present an approximation method of a space-homogeneous transport equation which we prove is convergent. The method is very promising for numerical computation. Comparison of a numerical computation with an exact solution is given for the Master equation.     

The Gelfand-Kirillov conjecture and Gelfand-Tsetlin modules for finite W-algebras

We address two problems with the structure and representation theory of finite W-algebras associated with general linear Lie algebras. Finite W-algebras can be defined using either Kostant's Whittaker modules or a quantum Hamiltonian reduction. Our first main result is a proof of the Gelfand-Kirillov conjecture for the skew fields of fractions of finite W-algebras. The second main result is a parameterization of finite families of irreducible Gelfand-Tsetlin modules using Gelfand-Tsetlin subalgebra. As a corollary, we obtain a complete classification of generic irreducible Gelfand-Tsetlin modules for finite W-algebras.     

Singularity analysis of a p-Ginzburg-Landau type minimizer

This paper is concerned with the convergence of a p-Ginzburg-Landau type functional when the parameter goes to zero. By estimating the singularity of the energy and establishing the Pohozaev identity, we find the singularity of the energy concentrates on the domain near the singularities of a p-harmonic map.     

Minimal sets in monotone and sublinear skew-product semiflows I: The general case

The dynamics of a general monotone and sublinear skew-product semiflow is analyzed, paying special attention to the long-term behavior of the strongly positive semiorbits and to the minimal sets. Four possibilities arise depending on the existence or absence of strongly positive minimal sets and bounded semiorbits, as well as on the coexistence or not of bounded and unbounded strongly positive semiorbits. Previous results are unified and extended, and scenarios which are impossible in the autonomous or periodic cases are described.     

Completeness for flat modal fixpoint logics

This paper exhibits a general and uniform method to prove axiomatic completeness for certain modal fixpoint logics. Given a set Γ of modal formulas of the form γ(x,p₁,…,p_n), where x occurs only positively in γ, we obtain the flat modal fixpoint language L_?(Γ) by adding to the language of polymodal logic a connective ?_γ for each γ∈Γ. The term ?_γ(φ₁,…,φ_n) is meant to be interpreted as the least fixed point of the functional interpretation of the term γ(x,φ₁,…,φ_n). We consider the following problem: given Γ, construct an axiom system which is sound and complete with respect to the concrete interpretation of the language L_?(Γ) on Kripke structures. We prove two results that solve this problem.First, let be the logic obtained from the basic polymodal by adding a Kozen-Park style fixpoint axiom and a least fixpoint rule, for each fixpoint connective ?_γ. Provided that each indexing formula γ satisfies a certain syntactic criterion, we prove this axiom system to be complete.Second, addressing the general case, we prove the soundness and completeness of an extension of . This extension is obtained via an effective procedure that, given an indexing formula γ as input, returns a finite set of axioms and derivation rules for ?_γ, of size bounded by the length of γ. Thus the axiom system is finite whenever Γ is finite.     

The multiplicity of solutions for perturbed second-order Hamiltonian systems with impulsive effects

In this paper, we study the existence of multiple solutions for a class of second-order impulsive Hamiltonian systems. We give some new criteria for guaranteeing that the impulsive Hamiltonian systems with a perturbed term have at least three solutions by using a variational method and some critical points theorems of B. Ricceri. We extend and improve on some recent results. Finally, some examples are presented to illustrate our main results.     

Meta densities and the shape of their sample clouds

This paper compares the shape of the level sets for two multivariate densities. The densities are positive and continuous, and have the same dependence structure. The density f is heavy-tailed. It decreases at the same rate-up to a positive constant-along all rays. The level sets {f>c} for c↓0, have a limit shape, a bounded convex set. We transform each of the coordinates to obtain a new density g with Gaussian marginals. We shall also consider densities g with Laplace, or symmetric Weibull marginal densities. It will be shown that the level sets of the new light-tailed density g also have a limit shape, a bounded star-shaped set. The boundary of this set may be written down explicitly as the solution of a simple equation depending on two positive parameters. The limit shape is of interest in the study of extremes and in risk theory, since it determines how the extreme observations in different directions relate. Although the densities f and g have the same copula-by construction-the shapes of the level sets are not related. Knowledge of the limit shape of the level sets for one density gives no information about the limit shape for the other density.     

Hypergeometric systems of Gelfand-type equations and series in orthogonal polynomials

We describe multivariable hypergeometric series in orthogonal polynomials. These series are solutions of special systems of Gelfand-type equations. The difference andq-analogs are also given.     

On the stochastic independence properties of hard-core distributions

A probability measurep on the set of matchings in a graph (or, more generally 2-bounded hypergraph) ishard-core if for some : [0,), the probabilityp(M) ofM is proportional to . We show that such distributions enjoy substantial approximate stochastic independence properties. This is based on showing that, withM chosen according to the hard-core distributionp, MP () the matching polytope of , and >0, if the vector ofmarginals, (Pr(AM):A an edge of ), is in (1–) MP (), then the weights (A) are bounded by someA(). This eventually implies, for example, that under the same assumption, with fixed, as the distance betweenA, B tends to infinity.Thought to be of independent interest, our results have already been applied in the resolutions of several questions involving asymptotic behaviour of graphs and hypergraphs (see [14, 16], [11]–[13]).Supported in part by NSFThis work forms part of the author's doctoral dissertation [16]; see also [17]. The author gratefully acknowledges NSERC for partial support in the form of a 1967 Science and Engineering Scholarship.     

Universality of a dynamical percolative approach to 1/f γ noise

A dynamical percolative model explaining the universality of 1/ f ^γ noise is reported. Exponents γ ranging from 0 to 2 are obtained under the hypothesis that noise originates from random switching events between two ON-OFF states in elemental parts (switchers) of a physical system. The usual noise behaviour with γ very close to 1 in an arbitrarily wide frequency range is obtained assuming a statistical distribution of switcher relaxation time τ proportional to τ ^-1 , as in McWhorter's model. The impact of these results with respect to recent self-organised criticality models is discussed. Received 6 November 2000 and Received in final form 22 May 2001