Fundamental representations of quantum groups at roots of 1

To every finite-dimensional irreducible representation V of the quantum group U(g) where is a primitive lth root of unity (l odd) and g is a finite-dimensional complex simple Lie algebra, de Concini, Kac and Procesi have associated a conjugacy class C _V in the adjoint group G of g. We describe explicitly, when g is of type A _n , B _n , C _n , or D _n , the representations associated to the conjugacy classes of minimal positive dimension. We call such representations fundamental and prove that, for any conjugacy class, there is an associated representation which is contained in a tensor product of fundamental representations.     

Star-products and phase space realizations of quantum groups

It is shown for a family of *-products (i.e. different ordering rules) that, under a strong invariance condition, the functions of the quadratic preferred observables (which generate the Cartan subalgebra in phase space realization of Lie algebras) take only the linear or exponential form. An exception occurs for the case of a symmetric ordering *-product where trigonometric functions and two special polynomials can also be included. As an example, the quantized algebra of the oscillator Lie algebra is argued.     

(R)-3-氨基丁醇的合成研究进展

(R)-3-氨基丁醇是合成抗艾滋病整合酶抑制剂度鲁特韦的重要中间体,其品质的好坏以及价格的高低对于度鲁特韦的品质及生产成本有着很重要的影响。本文从化学拆分法、手性原料合成、化学诱导法、制备色谱法和生物酶法五个方面对合成(R)-3-氨基丁醇的方法进行了综述。     

实时多路雷达视频处理的嵌入式设计方法

针对某型单脉冲测量雷达对A/ R 型显示终端提出的多路、高带宽、多目标、连续全量程视频实时显示,雷达工作日志录取及与指控中心数据交互的需求,设计了一种基于嵌入式计算机和现场可编程门阵列的A 显处理模块,解决了高速视频传输、大带宽数据实时处理、数据录取远程交互等技术问题,实现了显示终端的小型化,满足了雷达系统战术要求。工程实践表明:A 显处理模块实现了多输入多输出的雷达视频处理功能,提高了雷达A 显实时显示分析及雷达目标人工辅助辨性的能力。     

Distributed near-optimal matching

In this paper, we consider the following distributed bipartite matching problem: LetG=(L,R;E) be a bipartite graph in which boys are partL (left nodes), and girls are partR (right nodes.) There is an edge(l _i ,r _j )E iff boyl _i is interested in girlr _j . Every boyl _i will propose to a girlr _j among all those he is interested in, i.e., his adjacent right nodes in the bipartite graphG. If several boys propose to the same girl, only one of them will be accepted by the girl. We assume that none of the boys communicate with others. This matching problem is typical of distributed computing under incomplete information: Each boy only knows his own preference but none of the others. We first study the one-round matching problem: each boy proposes to at most one girl, so that the total number of girls receiving a proposal is maximized. If the maximum matching isM, then no deterministic algorithm can produce a matching of size not bounded by a constant, but a randomized algorithm achieves — and this is shown optimal by an adversary argument. If we allow many rounds in matching, with the senders learning from their failures, then, for deterministic algorithms, the ratio (of the optimal solution to the solution of the algorithm) is unbounded when the number of rounds is smaller than (G), and becomes bounded (two) at the (G)-th round. In contrast, an extension of the one-round randomized algorithm establishes that there is no such discontinuity in the randomized case. This randomized result is also matched by an upper bound of asymptotically the same order.     

Implicit elliptic boundary-value problems with discontinuous nonlinearities

Let be a bounded domain in ⁿ (n3) having a smooth boundary, let be an essentially bounded real-valued function defined on × ^h, and let be a continuous real-valued function defined on a given subset Y of Y ^h. In this paper, the existence of strong solutions u W ^2,p (, ^h) W _o ^1,p (n/2<p<+) to the implicit elliptic equation (–u)=(x,u), with u=(u₁, u₂, ..., u_h) and u=(u ₁, u ₂, ..., u _h), is established. The abstract framework where the problem is placed is that of set-valued analysis.     

Coordinates of the quantum plane as q-tensor operators in (\mathfrak{s}\mathfrak{u}(2)*\mathfrak{s}\mathfrak{u}(2))

The relation between the set of transformations of the quantum plane and the quantum universal enveloping algebra U _q (u(2)) is investigated by constructing representations of the factor algebra U _q (u(2))* . The noncommuting coordinates of , on which U _q (2) * U _q (2) acts, are realized as q-spinors with respect to each U _q (u(2)) algebra. The representation matrices of U _q (2) are constructed as polynomials in these spinor components. This construction allows a derivation of the commutation relations of the noncommuting coordinates of directly from properties of U _q (u(2)). The generalization of these results to U _q (u(n)) and is also discussed.     

Constructing one-parameter transformations on white noise functions in terms of equicontinuous generators

Let be a barreled locally convex space. A continuous operator on is called anequicontinuous generator if { ⁿ /n!;n=0,1,2,...} is an equicontinuous family of operators. For each equicontinuous generator a one-parameter group of operators is constructed by means of power series. There is a one-to-one correspondence between the equicontinuous generators and the locally equicontinuous holomorphic one-parameter groups of operators. If two equicontinuous generators ₁, ₂ satisfy [₁,₂]=₂ for some thena₁+b₂ is also an equicontinuous generator for anya, b. These general results are applied to a study of operators on white noise functions. In particular, a linear combination of the number operator and the Gross Laplacian, which are natural infinite dimensional analogues of a finite dimensional Laplacian, is always an equicontinuous generator. This result contributes to the Cauchy problems in white noise (Gaussian) space.Work supported by Alexander von Humboldt-Stiftung and Japan Society for Promotion of Sciences     

On the approximation of singular integral equations by equations with smooth kernels

Singular integral equations with Cauchy kernel and piecewise-continuous matrix coefficients on open and closed smooth curves are replaced by integral equations with smooth kernels of the form(t–)[(t–) ²–n ² (t) ²]^–1,0, wheren(t), t , is a continuous field of unit vectors non-tangential to . we give necessary and sufficient conditions under which the approximating equations have unique solutions and these solutions converge to the solution of the original equation. For the scalar case and the spaceL ₂() these conditions coincide with the strong ellipticity of the given equation.This work was fulfilled during the first author's visit to the Weierstrass Institute for Applied Analysis and Stochastics, Berlin in October 1993.     

An analysis of bilinear transform polynomial methods of inversion of Laplace transforms

Summary. Methods for the numerical inversion of a Laplace transform which use a special bilinear transformation of are particularly effective in many cases and are widely used. The main purpose of this paper is to analyze the convergence and conditioning properties of a special class of such methods, characterized by the use of Lagrange interpolation. The results derived apply both to complex and real inversion, and show that some known inversion methods are in fact in this class. Received June 21, 1993 / Revised version received March 10, 1994