Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg then the state complexity of is equal to the Wolf bound. For deg , we use Clifford's theorem to give a simple lower bound on the state complexity of . We then derive two further lower bounds on the state space dimensions of in terms of the gonality sequence of . (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.     

Convergence of the shifted algorithm for unitary Hessenberg matrices

This paper shows that for unitary Hessenberg matrices the algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover, the asymptotic rate of convergence is at least cubic, higher than that which can be shown to be quadratic only for Hermitian tridiagonal matrices, under no further assumption. A general mixed shift strategy with global convergence and cubic rates is also presented.

     

On the Matrix Equation X^{ - 1} X* = A

Solvability conditions are examined for the matrix equation , which cannot be found in the well-known reference books on matrix theory. Methods for constructing solutions to this equation are indicated.     

Solution of the Semi-Infinite Toda Lattice for Unbounded Sequences

The semi-infinite Toda lattice is the system of differential equations d _n (t)/dt = _n (t)(b _n+1(t) – b _n (t)), db _n (t)/dt = 2( _n ²(t) – _n–1 ²(t)), n = 1, 2, ..., t > 0. The solution of this system (if it exists) is a pair of real sequences _n (t), b _n (t) which satisfy the conditions _n (0) = _n ,, b _n (0) = b _n , where _n > 0 and b _n are given sequences of real numbers. It is well known that the system has a unique solution provided that both sequences _n and b _n are bounded. When at least one of the known sequences _n and b _n is unbounded, many difficulties arise and, to the best of our knowledge, there are few results concerning the solution of the system. In this letter we find a class of unbounded sequences _n and b _n such that the system has a unique solution. The results are illustrated with a typical example where the sequences _i (t), b _i (t), i = 1, 2, ... can be exactly determined. The connection of the Toda lattice with the semi-infinite differential-difference equation d²/dt ² log h _n = h _n+1 + h _n–1 – 2h _n , n = 1, 2, ... is also discussed and the above results are translated to analogous results for the last equation.     

On the Relation Between Orthogonal,Symplectic and Unitary Matrix Ensembles

For the unitary ensembles of N×N Hermitian matrices associated with a weight function w there is a kernel, expressible in terms of the polynomials orthogonal with respect to the weight function, which plays an important role. For the orthogonal and symplectic ensembles of Hermitian matrices there are 2×2 matrix kernels, usually constructed using skew-orthogonal polynomials, which play an analogous role. These matrix kernels are determined by their upper left-hand entries. We derive formulas expressing these entries in terms of the scalar kernel for the corresponding unitary ensembles. We also show that whenever w/w is a rational function the entries are equal to the scalar kernel plus some extra terms whose number equals the order of w/w. General formulas are obtained for these extra terms. We do not use skew-orthogonal polynomials in the derivations     

K-Theory for the Integer Heisenberg Groups

We give a closed formula for topological K-theory of the homogeneous space N/, where is the standard integer lattice in the simply connected Heisenberg Lie group N of dimension 2n+1, n . The main tools in our calculations are obtained by computing diagonal forms for certain incidence matrices that arise naturally in combinatorics.     

广义对角占优阵的一个等价条件

给出了实方阵为广义对角占优阵的充要条件,同时给出了判断广义对角占优阵可靠,可行,较简单方法。     

On the division of polynomial matrices

The main purpose of this paper is to determine two new algorithmsfor the division of the polynomial matrix B(s) R[s]^pxq by A(s) R[s]^pxp (a) based on the Laurent matrix expansion at s = =of the inverse of A(s), i.e. A(s)^–1, and (b) in a waysimilar to the one presented by Gantmacher (1959).     

Irregular sampling, Toeplitz matrices, and the approximation of entire functions of exponential type

In many applications one seeks to recover an entire function of exponential type from its non-uniformly spaced samples. Whereas the mathematical theory usually addresses the question of when such a function in can be recovered, numerical methods operate with a finite-dimensional model. The numerical reconstruction or approximation of the original function amounts to the solution of a large linear system. We show that the solutions of a particularly efficient discrete model in which the data are fit by trigonometric polynomials converge to the solution of the original infinite-dimensional reconstruction problem. This legitimatizes the numerical computations and explains why the algorithms employed produce reasonable results. The main mathematical result is a new type of approximation theorem for entire functions of exponential type from a finite number of values. From another point of view our approach provides a new method for proving sampling theorems.

     

Numerical detection of symmetry breaking bifurcation points with nonlinear degeneracies

A numerical tool for the detection of degenerated symmetry breaking bifurcation points is presented. The degeneracies are classified and numerically processed on -D restrictions of the bifurcation equation. The test functions that characterise each of the equivalence classes are constructed by means of an equivariant numerical version of the Liapunov-Schmidt reduction. The classification supplies limited qualitative information concerning the imperfect bifurcation diagrams of the detected bifurcation points.