项链李代数的性质

研究项链李代数的性质,给出了其中心元的表示形式,证明了项链李代数非半单、非可解,通过构造项链李代数的可解非幂零子代数,证明了当箭图中有长度大于1的循环时,项链李代数非幂零.还给出了没有圈的箭图上项链李代数的分解.     

Towards the generalized purely wild inertia conjecture for product of alternating and symmetric groups

We obtain new evidence for the Purely Wild Inertia Conjecture posed by Abhyankar and for its generalization. We show that this generalized conjecture is true for any product of simple Alternating groups in odd characteristics, and for any product of certain Symmetric or Alternating groups in characteristic two. We also obtain important results towards the realization of the inertia groups which can be applied to more general set up. We further show that the Purely Wild Inertia Conjecture is true for any product of perfect quasi p-groups (groups generated by their Sylow p-subgroups) if the conjecture is established for individual groups.     

Binary Quasi-Cyclic Goppa Codes

We obtain here a necessary and sufficient condition for a certain class of binary Goppa code to be quasi-cyclic. We also give another sufficient condition which is easier to check. We define a class of quasi-cyclic Goppa codes. We find the true dimension for a part of those quasi-cyclic codes. and also a class of extended quasi-cyclic codes the minimum distance of which is equal to the designed distance.     

Approximation by matrices with restricted spectra

We investigate the properties of the approximation of a matrix by matrices whose spectra are in a closed convex set of the complex plane. We explain why the Khalil and Maher characterization of an approximant, which spectrum is in a strip, is not quite correct. We prove that their characterization is valid but for another kind of approximation. We formulate a conjecture which leads to some algorithm for computing approximants. The conjecture is motivated by numerical experiments and some theoretical considerations. Separately we consider the approximation of normal matrices.     

On the Guignard constraint qualification for mathematical programs with equilibrium constraints

We recapitulate the well-known fact that most of the standard constraint qualifications are violated for mathematical programs with equilibrium constraints (MPECs). We go on to show that the Abadie constraint qualification is only satisfied in fairly restrictive circumstances. In order to avoid this problem, we fall back on the Guignard constraint qualification (GCQ). We examine its general properties and clarify the position it occupies in the context of MPECs. We show that strong stationarity is a necessary optimality condition under GCQ. Also, we present several sufficient conditions for GCQ, showing that it is usually satisfied for MPECs.     

Characterization and Enumeration of Certain Classes of Tenable Pólya Urns Grown by Drawing Multisets of Balls

We study necessary and sufficient conditions for the strong tenability of Pólya urn schemes under the sampling of multisets of balls. We also investigate sufficient conditions for the tenability (not necessarily in the strong sense) of Pólya urn schemes under the sampling of multisets of balls. We enumerate certain balanced classes and give algorithmic constructions for the replacement matrices for members in the class. We probabilistically analyze the zero-balanced tenable class, and find the asymptotic average proportion of each color, when the starting number of balls is large. We also give an algorithm to determine tenability and construct the Markov chain underlying the scheme, when it is tenable.     

Spherical basis functions and uniform distribution of points on spheres

The main purpose of the present paper is to employ spherical basis functions (SBFs) to study uniform distribution of points on spheres. We extend Weyl's criterion for uniform distribution of points on spheres to include a characterization in terms of an SBF. We show that every set of minimal energy points associated with an SBF is uniformly distributed on the spheres. We give an error estimate for numerical integration based on the minimal energy points. We also estimate the separation of the minimal energy points.     

Paradoxical Decomposition of Semigroups

We introduce the concept of paradoxical decomposition for semigroups. We show that a semigroup S admits a left paradoxical decomposition if and only if S is not left amenable. Also Rosenbelatt and Willis introduced the configuration concept for groups and showed that amenability of groups is equivalent with existence of normalised solution for any system of configuration equations. We generalise it for semigroups.     

Regularity of harmonic maps into a static Lorentzian manifold

We study the regularity of harmonic maps from Riemannian manifold into a static Lorentzian manifold. We show that when the domain manifold is two-dimensional, any weakly harmonic map is smooth. We also show that when dimension n of the domain manifold is greater than two, there exists a weakly harmonic map for the Dirichlet problem which is smooth except for a closed set whose (n − 2)-dimensional Hausdorff measure is zero.     

An Algebraic Approach to Knowledge Base Models Informational Equivalence

In this paper we study the notion of knowledge from the positions of universal algebra and algebraic logic. We consider first order knowledge which is based on first order logic. We define categories of knowledge and knowledge base models. These notions are defined for the fixed subject of knowledge. The key notion of informational equivalence of two knowledge base models is introduced. We use the idea of equivalence of categories in this definition. We prove that for finite models there is a clear way to determine whether the knowledge base models are informationally equivalent.     

Rings of invariants for modular representations of elementary abelian <Emphasis Type="Italic">p</Emphasis>-groups

We initiate a study of the rings of invariants of modular representations of elementary abelian p-groups. With a few notable exceptions, the modular representation theory of an elementary abelian p-group is wild. However, for a given dimension, it is possible to parameterise the representations. We describe parameterisations for modular representations of dimension two and of dimension three. We compute the ring of invariants for all two-dimensional representations; these rings are generated by two algebraically independent elements. We compute the ring of invariants of the symmetric square of a two-dimensional representation; these rings are hypersurfaces. We compute the ring of invariants for all three-dimensional representations of rank at most three; these rings are complete intersections with embedding dimension at most five. We conjecture that the ring of invariants for any three-dimensional representation of an elementary abelian p-group is a complete intersection.     

Existence,uniqueness and ergodicity of Markov branching processes with immigration and instantaneous resurrection

We consider a modified Markov branching process incorporating with both state-independent immigration and instantaneous resurrection.The existence criterion of the process is firstly considered.We prove that if the sum of the resurrection rates is finite,then there does not exist any process.An existence criterion is then established when the sum of the resurrection rates is infinite.Some equivalent criteria,possessing the advantage of being easily checked,are obtained for the latter case.The uniqueness criterion for such process is also investigated.We prove that although there exist infinitely many of them,there always exists a unique honest process for a given q-matrix.This unique honest process is then constructed.The ergodicity property of this honest process is analysed in detail.We prove that this honest process is always ergodic and the explicit expression for the equilibrium distribution is established.     

Pluricanonical maps of varieties of maximal Albanese dimension

Let X be a smooth complex projective algebraic variety of maximal Albanese dimension. We give a characterization of in terms of the set . An immediate consequence of this is that the Kodaira dimension is invariant under smooth deformations. We then study the pluricanonical maps . We prove that if X is of general type, is generically finite for and birational for . More generally, we show that for the image of is of dimension equal to and for , is the stable canonical map. Received July 7, 2000 / Published online April 12, 2001     

Existence, uniqueness and ergodicity of Markov branching processes with immigration and instantaneous resurrection

We consider a modified Markov branching process incorporating with both state-independent immigration and instantaneous resurrection. The existence criterion of the process is firstly considered. We prove that if the sum of the resurrection rates is finite, then there does not exist any process. An existence criterion is then established when the sum of the resurrection rates is infinite. Some equivalent criteria, possessing the advantage of being easily checked, are obtained for the latter case. The uniqueness criterion for such process is also investigated. We prove that although there exist infinitely many of them, there always exists a unique honest process for a given q-matrix. This unique honest process is then constructed. The ergodicity property of this honest process is analysed in detail. We prove that this honest process is always ergodic and the explicit expression for the equilibrium distribution is established.     

The stochastic fluid–fluid model: A stochastic fluid model driven by an uncountable-state process,which is a stochastic fluid model itself

We introduce the Stochastic Fluid–Fluid Model, which offers powerful modeling ability for a wide range of real-life systems of significance. We first derive the infinitesimal generator, with respect to time, of the driving stochastic fluid model. We then use this to derive the infinitesimal generator of a particular Laplace–Stieltjes transform of the model, which is the foundation of our analysis. We develop expressions for the Laplace–Stieltjes transforms of various performance measures for the transient and limiting analysis of the model. This work is the first direct analysis of a stochastic fluid model that is Markovian on a continuous state space.     

Stochastic Recursive Equations with Applications to Queues with Dependent Vacations

We focus on a special class of nonlinear multidimensional stochastic recursive equations in which the coefficients are stationary ergodic (not necessarily independent). Under appropriate conditions, an explicit ergodic stationary solution for these equations is obtained and the convergence to this stationary regime is established. We use these results to analyze several queueing models with vacations. We obtain explicit solutions for several performance measures for the case of general non-independent vacation processes. We finally extend some of these results to polling systems with general vacations.     

A global optimization algorithm for generalized semi-infinite,continuous minimax with coupled constraints and bi-level problems

We propose an algorithm for the global optimization of three problem classes: generalized semi-infinite, continuous coupled minimax and bi-level problems. We make no convexity assumptions. For each problem class, we construct an oracle that decides whether a given objective value is achievable or not. If a given value is achievable, the oracle returns a point with a value better than or equal to the target. A binary search is then performed until the global optimum is obtained with the desired accuracy. This is achieved by solving a series of appropriate finite minimax and min-max-min problems to global optimality. We use Laplace’s smoothing technique and a simulated annealing approach for the solution of these problems. We present computational examples for all three problem classes.     

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.     

Energy and coherence loss rates in a one-dimensional vibrational system interacting with a bath

We consider the problem of the dynamics of a Gaussian wave packet in a one-dimensional harmonic ocsillator interacting with a bath. This problem arises in many chemical and biochemical applications related to the dynamics of chemical reactions. We take the bath-oscillator interaction into account in the framework of the Redfield theory. We obtain closed expressions for Redfield-tensor elements, which allows finding the explicit time dependence of the average vibrational energy. We show that the energy loss rate is temperature-independent, is the same for all wave packets, and depends only on the spectral function of the bath. We determine the degree of coherence of the vibrational motion as the trace of the density-matrix projection on a coherently moving wave packet. We find an explicit expression for the initial coherence loss rate, which depends on the wave packet width and is directly proportional to the intensity of the interaction with the bath. The minimum coherence loss rate is observed for a “coherent” Gaussian wave packet whose width corresponds to the oscillator frequency. We calculate the limiting value of the degree of coherence for large times and show that it is independent of the structural characteristics of the bath and depends only on the parameters of the wave packet and on the temperature. It is possible that residual coherence can be preserved at low temperatures. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 153, No. 1, pp. 130–144, October, 2007.     

Covering partially directed graphs with directed paths

We consider graphs which contain both directed and undirected edges (partially directed graphs). We show that the problem of covering the edges of such graphs with a minimum number of edge-disjoint directed paths respecting the orientations of the directed edges is polynomially solvable. We exhibit a good characterization for this problem in the form of a min-max theorem. We introduce a more general problem including weights on possible orientations of the undirected edges. We show that this more general weighted formulation is equivalent to the weighted bipartite b-factor problem. This implies the existence of a strongly polynomial algorithm for this weighted generalization of Euler's problem to partially directed graphs (compare this with the negative results for the mixed Chinese postman problem). We also provide a compact linear programming formulation for the weighted generalization that we propose.