Polynomial factorization over

We describe algorithms for polynomial factorization over the binary field , and their implementation. They allow polynomials of degree up to to be factored in about one day of CPU time, distributing the work on two processors.

     

A fluctuation theory for Markov chains

A fluctuation theory for Markov chains on an ordered countable state space is developed, using ladder processes. These are shown to be Markov renewal processes. Results are given for the joint distribution of the extremum (maximum or minimum) and the first time the extremum is achieved. Also a new classification of the states of a Markov chain is suggested. Two examples are given.     

Kp,q-factorization of complete bipartite graphs

Let K_(m,n) be a complete bipartite graph with two partite sets having m and nvertices, respectively. A K_(p,q)-factorization of K_(m,n) is a set of edge-disjoint K_(p,q)-factorsof K_(m,n) which partition the set of edges of K_(m,n). When p=i and q is a prime number,Wang, in his paper "On K_(1,k)-factorizations of a complete bipartite graph" (Discrete Math,1994, 126; 359-364), investigated the K_(1,q)-factorization of K_(m,n) and gave a sufficientcondition for such a factorization to exist. In the paper "K_(1,k)-factorizations of completebipartite graphs" (Discrete Math, 2002, 259: 301-306), Du and Wang extended Wang'sresult to the case that q is any positive integer In this paper, we give a sufficient conditionfor K_(m,n) to have a K_(p,q)-factorization. As a special case, it is shown that the Martin's BACconjecture is true when p: q=k: (k+1) for any positive integer k.     

Factorization in finite-codimensional ideals of group algebras

Let G be a -compact, locally compact group and I be a closed2-sided ideal with finite codimension in L¹(G). It is shownthat there are a closed left ideal L having a right boundedapproximate identity and a closed right ideal R having a leftbounded approximate identity such that I = L + R. The proofuses ideas from the theory of boundaries of random walks ongroups. 2000 Mathematics Subject Classification: primary 43A20;secondary 42A85, 43A07, 46H10, 46H40, 60B11.     

Factorization Systems and Adjunctions

Several results on the translation of factorization systems along adjunctions are proved. The first of these results is the answer to the question posed by G.Janelidze.     

Quantum Computation in a Ising Spin Chain Taking into Account Second Neighbor Couplings

We consider the realization of a quantum computer in a chain of nuclear spins coupled by an Ising interaction. Quantum algorithms can be performed with the help of appropriate radio-frequency pulses. In addition to the standard nearest-neighbor Ising coupling, we also allow for a second neighbor coupling. It is shown, how to apply the 2π k method in this more general setting, where the additional coupling eventually allows to save a few pulses. We illustrate our results with two numerical simulations: the Shor prime factorization of the number 4 and the teleportation of a qubit along a chain of 3 qubits. In both cases, the optimal Rabi frequency (to suppress non-resonant effects) depends primarily on the strength of the second neighbor interaction.     

n次单位根在代数问题中的应用

主要论述n次单位根在一些组合数求和、多项式的整除、因式分解中的应用,说明了n次单位根法可拓宽解题思路,是一种方便、快捷的数学解题方法.     

Reconstruction of the shape of object with near field measurements in a half-plane

We consider a mathematical problem modelling some characteristics of near field optical microscope.We take a monofrequency line source to illuminate a sample with constant index of refraction and use the scattered field data measured near the sample to reconstruct the shape of it. Mixed reciprocity relation and factorization method are applied to solve our problem.Some numerical examples to show the feasibility of the method are presented.     

A unification of some matrix factorization results

A unification of some factorization results regarding products of positive-definite matrices, commutators, and products of involutions is presented. This topic was first presented by Sourour for fields with, in the latter two classes, sufficiently many elements in terms of the order of the matrix being factored. The current presentation is valid for matrices over any field with at least four elements, and is independent of the order of the matrix being factored.