In this paper we present new algorithms for non–commutative Gröbner ready algebras, which enable one to perform advanced operations with ideals and modules. In spite of the big interest in algorithmic treatment of related problems, preimage of ideal and central character decomposition were not discussed before. An important algorithm for computation of the kernel of a homomorphism of left modul...

A k-element subset D of a finite multiplicative group G of order v is called a (v, k, λ, μ)partial difference set in G (PDS) provided that the multiset of ‘differences’ {d1d −1 2 | d1, d2 ∈ D, d1 6= d2} contains each nonidentity element of D exactly λ times and each nonidentity element in G\D exactly μ times. See [11] for background on partial difference sets. We will limit our attention to abe...

Preface These notes are based on a course given at the Tata Institute of Fundamental Research in the beginning of 1990. The aim of the course was to describe the solution by O. Mathieu of some conjectures in the representation theory of semi-simple algebraic groups. These conjectures concern the inner structure of dual Weyl modules and some of their analogues. Recall that if G is a (connected, ...

The National Library of Medicine (NLM) is developing an automated system to produce bibliographic records for its MEDLINE database. This system, named Medical Article Record System (MARS), employs document image analysis and understanding techniques and optical character recognition (OCR). This paper describes a key module in MARS called the Automated Labeling (AL) module, which labels all zon...

A noncommutative-geometric generalization of classical Weil theory of characteristic classes is presented, in the conceptual framework of quantum principal bundles. A particular care is given to the case when the bundle does not admit regular connections. A cohomological description of the domain of the Weil homomorphism is given. Relations between universal characteristic classes for the regul...

We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD04] and models introduced and studied by Mazurkiewicz [Maz04a,Maz04b]. We encode these models by labelled (hyper)graphs and relabelling rules on this labelled (hyper)graphs called negotiations. Then for these models, we give complete characterisations of labell...

We show how the classical notions of cohomology with local coefficients, CW-complex, covering space, homeomorphism equivalence, simple homotopy tubular neighbourhood, and spinning can be encoded on a computer used to calculate ambient isotopy invariants continuous embeddings N ↪ M one topological manifold into another. More specifically, we describe an algorithm for computing homology H n ( X ,...

in this paper, we show that every surjective $n$-homomorphism ($n$-anti-homomorphism) from a banach algebra $a$ into a semisimple banach algebra $b$ is continuous.