Matrix Units for Signed Brauer’s Algebras

Brauers centerlizer algebras have a basis consisting of undirected graphs. Signed Brauers algebras have a basis consisting of directed graphs, which generalizes Brauers algebras. In this paper, we compute a complete set of matrix units of Signed Brauers algebras.AMS Subject Classification: 99c:16028, 16S99(16K20).     

Invariant Subspaces for Positive Operators Acting on a Banach Space with Markushevich Basis

We introduce weak quasinilpotence for operators. Then, by substituting Markushevich basis and weak quasinilpotence at a nonzero vector for Schauder basis and quasinilpotence at a nonzero vector, respectively, we answer a question on the invariant subspaces of positive operators in [3].     

Foundational Isomorphisms in Continuous Differentiation Theory

We provide an elementary proof of existence for the Foundational Isomorphism in each of the categories of convergence spaces, compactly generated topological spaces and sequential convergence spaces. This isomorphism embodies the germ of differentiation and its inverse the germ of integration.     

WT measure vector spaces

n- M WT- , M n–1 . . WT- . .     

Chains and Trees: ‘Strong’–‘Weak’ Order in Job Scheduling

We present a summary of recent NP-hardness and polynomial time solvability results for the distinction between strong and weak precedence for chains and trees in scheduling. We distinguish between chains and proper trees which are not chains, and demonstrate that the strong-weak precedence distinction for chains is not inclusive with regards to NP-hardness, and conjecture that the same holds for strong-weak tree precedence. The objective is to show that different interpretations for chain and tree order relations in scheduling might have far reaching computational implications.     

Experiments with an interactive paired comparison simplex method for molp problems

In this paper, an interactive paired comparison simplex based method formultipleobjectivelinearprogramming (MOLP) problems is developed and compared to other interactive MOLP methods. Thedecisionmaker (DM)'s utility function is assumed to be unknown, but is an additive function of his known linearized objective functions. A test for utilityefficiency for MOLP problems is developed to reduce the number of efficient extreme points generated and the number of questions posed to the DM. The notion of strength ofpreference is developed for the assessment of the DM's unknown utility function where he can express his preference for a pair of extreme points as strong, weak, or almost indifferent. The problem of inconsistency of the DM is formalized and its resolution is discussed. An example of the method and detailed computational results comparing it with other interactive MOLP methods are presented. Several performance measures for comparative evaluations of interactive multiple objective programming methods are also discussed.All rights reserved. This study, or parts thereof, may not be reproduced in any form without written permission of the authors.     

On the exactness of a theorem of G.A. Fomin

, . . [1] - . .     

Transient solution for a finite capacity M/G a,b /1 queueing system with vacations to the server

In this paper we consider a single server queueing system with Poisson input, general service and a waiting room that allows only a maximum of b customers to wait at any time. A minimum of a customers are required to start a service and the server goes for a vacation whenever he finds less than a customers in the waiting room after a service. If the server returns from a vacation to find less than a customers waiting, he begins another vacation immediately. Using the theory of regenerative processes we derive expressions for the time dependent system size probabilities at arbitrary epochs.     

Асимптоический Анализ Распределения Статистики Диксона

. u 60-u u     

Critical sets in parametric optimization

We deal with one-parameter families of optimization problems in finite dimensions. The constraints are both of equality and inequality type. The concept of a generalized critical point (g.c. point) is introduced. In particular, every local minimum, Kuhn-Tucker point, and point of Fritz John type is a g.c. point. Under fairly weak (even generic) conditions we study the set consisting of all g.c. points. Due to the parameter, the set is pieced together from one-dimensional manifolds. The points of can be divided into five (characteristic) types. The subset of nondegenerate critical points (first type) is open and dense in (nondegenerate means: strict complementarity, nondegeneracy of the corresponding quadratic form and linear independence of the gradients of binding constraints). A nondegenerate critical point is completely characterized by means of four indices. The change of these indices along is presented. Finally, the Kuhn-Tucker subset of is studied in more detail, in particular in connection with the (failure of the) Mangasarian-Fromowitz constraint qualification.     

On the admissibility of function spaces of typeB p,q s andF p,q s,and boundary value problems for non-linear partial differential equations

u=f(x)+S(u), S — , u-G(u), G — . B _p,q ^s () -F _p,q ^s (). R _n — . — . _p,q ^s F _p,q ^s .     

A Numerical Comparison of Some Modified Controlled Random Search Algorithms

In this paper we propose a new version of the Controlled Random Search(CRS) algorithm of Price. The new algorithmhas been tested on thirteen global optimization test problems. Numericalexperiments indicate that the resulting algorithm performs considerablybetter than the earlier versions of the CRS algorithms. The algorithm,therefore, could offer a reasonable alternative to many currently availablestochastic algorithms, especially for problems requiring direct searchtype methods. Also a classification of the CRS algorithms is made based onglobal technique – local technique and the relative performance ofclasses is numerically explored.     

Discrete Series Characters for GL(n, q)

The discrete series characters of the finite general linear group GL(n, q) are expressed as uniquely defined integral linear combinations of characters induced from linear characters on certain subgroups Hd, n of GL(n, q). The coefficients in these linear combinations are determined (for all n, q) by a family of polynomials r(T) Z[T] indexed by the set of all partitions .     

Pairs of Convex Bodies with Centrally Symmetric Intersections of Translates

For a pair of convex bodies $K$ and $K$ in $E^d$, the $d$-dimensional intersections $K \cap (x + K),$ $x \in E^d,$ are centrally symmetric if and only if $K$ and $K$ are represented as direct sums $K = R \oplus P$ and $K = R \oplus P$ such that: (i) $R$ is a compact convex set of some dimension $m$, $0 \le m \le d,$ and $R = z - R$ for a suitable vector $z \in E^d$, (ii) $P$ and $P$ are isothetic parallelotopes, both of dimension $d-m$.     

Sur les puissances de l’idéal fondamental de l’anneau de Witt

We reformulate a recent result of Arason and Elman by giving a very simple presentation of the powers of the fundamental ideal of the Witt ring of a field of characteristic 2.

---

Sur les puissances de lidéal fondamental de lanneau de Witt

Nous reformulons un résultat récent de Arason et Elman en donnant une présentation très simple des puissances de lidéal fondamental de lanneau de Witt dun corps de caractéristique 2.

     

Stability of the High Frequency Fast Multipole Method for Helmholtz’ Equation in Three Dimensions

Stability limits for the high frequency plane wave expansion, which approximates the free space Greens function in Helmholtz equation, are derived. This expansion is often used in the Fast Multipole Method for scattering problems in electromagnetics and acoustics. It is shown that while the original approximation of the Greens function, based on Gegenbauers addition theorem, is stable except for overflows, the plane wave expansion becomes unstable due to errors from roundoff, interpolation, choice of quadrature rule and approximation of the translation operator. Numerical experiments validate the theoretical estimates. AMS subject classification (2000) 65B10, 65G99.Received November 2003. Revised July 2004. Communicated by Anders Szepessy.Martin Nilsson: Financial support has been obtained from Parallel and Scientific Computing Institute (PSCI), which is a competence center financed by Vinnova, The Swedish Agency for Innovation Systems, and the Swedish National Aeronautical Research Program, NFFP.     

d≤1 ∪d≥25 and constrained KP hierarchy from BRST invariance in thec≠3 topological algebra

The BRST invariance condition in a highest-weight representation of the topological ( twisted N=2) algebra captures the invariant content of two-dimensional gravity coupled to matter. The topological algebra allows reductions to either the DDK-dressed matter or the Kontsevich-Miwa-dressed matter related to Virasoro-constrained KP hierarchy. The standard DDK formulation is recovered by splitting the topological generators into c=–26 reparametrization ghosts + matter + Liouville, while a similar splitting involving c=–2 ghosts gives rise to the matter dressed in exactly the way required in order that the theory be equivalent to Virasoro constraints on the KP hierarchy. The two dressings of matter with the Liouville differ also by their ghost numbers, which is similar to the existence of representatives of BRST cohomologies with different ghost numbers. The topological central charge c3 provides a two-fold covering of the allowed regiond1 d25 of the matter central charge d via d=(c+1)(c+6)/(c–3). The Liouville field is identified as the ghost-free part of the topological U(1) current. The construction thus allows one to establish a direct relation (presumably an equivalence) between the Virasoro-constrained KP hierarchies, minimal models, and the BRST invariance condition for highest-weight states of the topological algebra.Published in Teoreticheskaya i Matematicheskaya Fizika, Vol. 95, No. 2, pp. 239–250, May, 1993.     

О числе Делителей “Сдвинутых” Простых чисел-Близнецов

.      

Produktintegration mit nicht-äquidistanten Stützstellen

Summary For the numerical evaluation of , 0<<1 andx smooth, product integration rules are applied. It is known that high-order rules, e.g. Gauss-Legendre quadrature, become normal-order rules in this case. In this paper it is shown that the high order is preserved by a nonequidistant spacing. Furthermore, the leading error terms of this product integration method and numerical examples are given.

     

New examples of Kobayashi hyperbolic surfaces in ℂℙ3

We show that a generic small deformation of the union of two generic cones in ³ of degree 4 is Kobayashi hyperbolic. Hence we obtain new examples of hyperbolic surfaces in ³ of any given degree d 8.__________Translated from Funktsionalnyi Analiz i Ego Prilozheniya, Vol. 39, No. 1, pp. 90–94, 2005Original Russian Text Copyright © by B. Shiffman and M. ZaidenbergThe second authors research was supported in part by NSF grant No. DMS-0100474.Translated by B. Shiffman and M. Zaidenberg