CTI: A novel charge-related topological index with low degeneracy

A new type of topological index is proposed. Its definition is based on the concept of atomic charge distributions in organic molecules. Introduction of electronic in addition to purely topologic factors allows consideration of heteroatom-containing structures as well. It is demonstrated that the index has a low degree of degeneracy, thus suggesting it can be used for coding chemical structures, discrimination of redundancies in structure generation programs, and studies of quantitative structure-activity relationships for heteroatom-containing structures.     

Involutions for upper triangular matrix algebras

In this paper we describe completely the involutions of the first kind of the algebra UT_n(F) of n×n upper triangular matrices. Every such involution can be extended uniquely to an involution on the full matrix algebra. We describe the equivalence classes of involutions on the upper triangular matrices. There are two distinct classes for UT_n(F) when n is even and a single class in the odd case.Furthermore we consider the algebra UT₂(F) of the 2×2 upper triangular matrices over an infinite field F of characteristic different from 2. For every involution *, we describe the *-polynomial identities for this algebra. We exhibit bases of the corresponding ideals of identities with involution, and compute the Hilbert (or Poincaré) series and the codimension sequences of the respective relatively free algebras.Then we consider the *-polynomial identities for the algebra UT₃(F) over a field of characteristic zero. We describe a finite generating set of the ideal of *-identities for this algebra. These generators are quite a few, and their degrees are relatively large. It seems to us that the problem of describing the *-identities for the algebra UT_n(F) of the n×n upper triangular matrices may be much more complicated than in the case of ordinary polynomial identities.     

Difference Equations and Discriminants for Discrete Orthogonal Polynomials

We prove that any set of polynomials orthogonal with respect to a discrete measure supported on equidistant points contained in a half line satisfy a second order difference equation. We also give a discrete analogue of the discriminant and give a general formula for the discrete discriminant of a discrete orthogonal polynomial. As an application we give explicit evaluations of the discrete discriminants of the Meixner and the Hahn polynomials. A difference analogue of the Bethe Ansatz equations is also mentioned.Research partially supported by NSF grant DMS 99-70865     

Travel Time Tomography

We survey some results on travel time tomography. The question is whether we can determine the anisotropic index of refraction of a medium by measuring the travel times of waves going through the medium. This can be recast as geometry problems, the boundary rigidity problem and the lens rigidity problem. The boundary rigidity problem is whether we can determine a Riemannian metric of a compact Riemannian manifold with boundary by measuring the distance function between boundary points. The lens rigidity problem problem is to determine a Riemannian metric of a Riemannian manifold with boundary by measuring for every point and direction of entrance of a geodesic the point of exit and direction of exit and its length. The linearization of these two problems is tensor tomography. The question is whether one can determine a symmetric two-tensor from its integrals along geodesics. We emphasize recent results on boundary and lens rigidity and in tensor tomography in the partial data case, with further applications.     

q-Blossoming for analytic functions

Numerical Algorithms - We construct a q-analog of the blossom for analytic functions, the analytic q-blossom. This q-analog also extends the notion of q-blossoming from polynomials to analytic...     

Accurate SVDs of weakly diagonally dominant M-matrices

Summary. We present a new O(n³) algorithm which computes the SVD of a weakly diagonally dominant M-matrix to high relative accuracy. The algorithm takes as an input the offdiagonal entries of the matrix and its row sums.Mathematics Subject Classification (1991): 65F15Revised version received September 19, 2003This material is based in part upon work supported by the LLNL Memorandum Agreement No. B504962 under DOE Contract No. W-7405-ENG-48, DOE Grants No. DE-FG03-94ER25219, DE-FC03-98ER25351 and DE-FC02-01ER25478, NSF Grant No. ASC-9813362, and Cooperative Agreement No. ACI-9619020.     

Nonlinear equations for the recurrence coefficients of discrete orthogonal polynomials

We study polynomials orthogonal on a uniform grid. We show that each weight function gives two potentials and each potential leads to a structure relation (lowering operator). These results are applied to derive second order difference equations satisfied by the orthogonal polynomials and nonlinear difference equations satisfied by the recursion coefficients in the three-term recurrence relations.     

Tau Function Solutions to a q-Deformation of the KP Hierarchy

We construct tau-function solutions to the q-KP hierarchy as deformations of classical tau functions.     

Modified construction of nuclear Fréchet spaces without basis

Recently, B. Mitiagin and N. Zobin constructed an example of nuclear Fréchet space without basis. The essential modification of their constructions gives the following results. There exists such a nuclear Fréchet space X that for any nuclear Fréchet space Y the space X × Y has no basis (Sections 1 and 2). This fact has a lot of corollaries (Sect. 3); e.g., the space X × C^∞(R¹) having the maximal diametral dimension among nuclear Fréchet spaces nevertheless has no basis. One can also construct (Sect. 4) a nuclear Fréchet space $\text{X}\text{?}$ without strongly finite-dimensional decomposition (see Definition 0.1). In Section 5 some comments and open questions are given.