特征与可解性

本文研究了具有不可约特征x使得x(1)²=|G:Z(G)|成立的群G的可解性,并证明了:对于这样的群G,当|Irr(G)|≤4时,G是可解群;当4<|Irr(G)|≤6时,在某些条件下,G是有解群.     

Generalized Noether theorems and applications

We generalize the first and second Noether theorems (Noether identities) to a constrained system in phase space. As an example, the conservation law deriving from Lagrange's formalism cannot be obtained fromH _E via the generalized first Noether theorem (GFNT); Dirac's conjecture regarding secondary first-class constraints (SFCC) is invalid in this example. A preliminary application of the generalized Noether identities (GNI) to nonrelativistic charged particles in an electromagnetic field shows that on the constrained hypersurface in phase space one obtains electric charge conservation. This conservation law is valid whether Dirac's conjecture holds true or not.     

On bent functions with some symmetric properties

This paper discusses a kind of bent functions that have some symmetric properties about some variables. Section 2 mainly discusses the bent functions symmetric about some two variables and gives the necessary and sufficient condition for these functions. Section 3 gives algebraic expressions of some bent functions.     

Theoretical Research on a Kind of Quantum Left-handed Metamaterial

Recently, research on left-handed materials （LHMs） has attracted considerable attentions. The LHMs are a kind of metameterial which have negative permittivity and negative permeability, which lead to negative refractive index in a frequency range. The LHMs that have been available so far are in the microwave range and are usually composed of classical particles, such as split-ring resonators. Some quantum phenomena such as spontaneous emission of atoms in the LHMs which are considered to be ＇classical background＇ have also been investigated. Many potential applications of LHMs have been proposed, such as superlenses which, in principle, can achieve arbitrary subwavelength resolution.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

Generalized Longo–Rehren Subfactors and α-Induction

We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if we apply this construction to a non-degenerately braided subfactor N⊂M and α^±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor M⊗M ^opp⊂R arising from the entire system of irreducible endomorphisms of M resulting from α^plusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors on S ¹ to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context. Received: 11 September 2001 / Accepted: 7 October 2001     

Complete ideals and singularities of space curves

We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002