A combinatorial rule for the schur function expansion of the Plethysm S(1a,b)[Pk]

We present a simple combinatorial rule to expand the plethysm P_n[S(1^a,b)](x) of a power summetric function P_n(x) and a Schur function of hook shapeS(1^a,b)(x), as a sum of Schur functions. The key ingredient of our proof is a correspondence between the circle diagrams, introduced by Chen, Garsia and Remmel [6] in their SXP algorithm to compute the Schur function expansion of P_n[S_λ], and certain special rim hook and transposed special rim hook tabloids which is of interest in its own right. As an application of our rule, we drive explicit formulas for the coefficient of any Schur function of hook shape in the Schur function expansion of a plethysm of any two Schur functions of hook shape.     

Star partitions and the graph isomorphism problem

A canonical basis of Rⁿ associated with a graph G on n vertices has been defined in [15] in connection with eigenspaces and star partitions of G. The canonical star basis together with eigenvalues of G determines G to an isomorphism. We study algorithms for finding the canonical basis and some of its variations. The emphasis is on the following three special cases; graphs with distinct eigenvalues, graphs with bounded eigenvalue multiplicities and strongly regular graphs. We show that the procedure is reduced in some parts to special cases of some well known combinatorial optimization problems, such as the maximal matching problem. the minimal cut problem, the maximal clique problem etc. This technique provides another proof of a result of L. Babai et al. [2] that isomorphism testing for graphs with bounded eigenvalue multiplicities can be performend in a polynomial time. We show that the canonical basis in strongly regular graphs is related to the graph decomposition into two strongly regular induced subgraphs. Examples of distinguishing between cospectral strongly regular graphs by means of the canonical basis are provided. The behaviour of star partitions of regular graphs under operations of complementation and switching is studied.     

On the problem op n-stationary centers

Among the various problems of celestial mechanics related to the n-body problem, a certain amount of interest attaches to the specific situation wherein a passive gravitational point mass M moves under the assumption that the relative disposition of the other active gravitational masses experiences no large changes.

If the attracting masses are regarded as points and if changes in the relative disposition of the attracting bodies are neglected, one arrives at the problem of the motion of the point M in a field produced by n-stationary attracting centers (the point M here represents the (n+l)-th body).

In addition to the problem of central motion (n = 1), soluble dynamics problems of this category include Euler's case [1] of two (n= 2) stationary Newtonian attracting centers.

This problem, which for a long time was of solely theoretical Interest as an example of an integrable Liouville system [2], has recently been attracting attention in connection with the mechanics of artificial satellites, particularly after it was shown that the potential of an oblate spheroid can be approximated by the potential of two specifically chosen stationary Newtonian attracting centers [3 and 4].

The solution of the problem for n-attracting centers for n ≥ 3 is unknown, except for a single special case of three centers pointed out by Lagrange and considered In greater detail by J.A. Serre [5].

We shall concern ourselves here with problems on the existence of periodic trajectories in the case of n-attracting centers. An arbitrary and not necessarily Newtonian gravitational law will be assumed.

Our analysis is based on the theory of quasiindices of singular force field points as set forth in [60].     

Persymmetric determinants

The object of this paper is to develop some of the results in the author's joint paper with Dale [2] concerning the derivatives of persymmetric determinants whose elements are Appell functions.Four new double-sum identities are presented which are valid for arbitrary persymmetric determinants. Two of these identities are applied to give direct proofs of two results in [2], A simple formula is given for the derivative of a Turanian of order n with Appell polynomial elements and the result is applied repeatedly to show that its degree is far lower than expected. It is shown that one particular determinant has simple derivatives of all orders and that its degree too is far lower than expected. The formula for the derivative of (first) cofactors is shown to be extensible in a simple manner to the derivatives of second cofactors.     

Some closed form formulae for the intersection of two special matrices under the star order

In this note we present closed form formulae for the intersection A ∧ B under the star order, for certain pairs of special matrices. In particular, it is shown that for two m×n partial isometries P and QP∧Q=P[I-(I-P^*Q)^†(I-P^*Q)]. Some further possible representations for P∧Q are considered.     

A problem in the theory of mixing layers

The classical problem of the free steady mixing layer which is formed as the result of the interaction between two parallel homogeneous flows which move with different velocities and come into contact in a certain section is considered. Subject to the additional condition that the first derivative of the solution in a class of self-similar functions is positive, a boundary-value problem is studied, for values of the self-similarity index m > 0, which describes the mixing of two viscous streams of the same fluid for m = 1 [1] and for m = 2 [2]. The method of investigation used [3–5] enables the third-order non-linear equation to be reduced to a first-order equation and enables the corresponding solutions (Gz) to be constructed in a parametric form as a function of the values of m. A knowledge of the behaviour of the velocity profile of the main stream can be used to investigate the flow stability. The results obtained form the basis of the subsequent construction of the solution of Lock's problem [6] and the investigation of the uniqueness of the solutions obtained.     

Composition of binary integral quadratic forms via integral 2 × 2 matrices and composition of matrix classes

A treatment by integral matrices is given for composition of pairs of integral quadratic forms with the same discriminant. The forms are associated with a pair of similar 2 × 2 matrices AB with irrational eigen values which generate the maximal order. The most general integral similarity between AB is given by a matrix whose entries are linear forms in two indeterminates with integral coefficients. This matrix is a "compositum" of two factors of the same nature. By equating determinants a composition of two quadratic forms results. The method can be generalized to n × n matrices.     

Numerical ranges and dilations

Denote by W(A) the numerical range of a bounded linear operator A. For two operators A and B (which may act on different Hilbert spaces), we study the relation between the inclusion relation W(A)⊆W(B) and the condition that A can be dilated to an operator of the form B⊗I. We also investigate the possibilities of dilating an operator A to operators with simple structure under the assumption that W(A) is included in a special region.     

The realization graph of a degree sequence with majorization gap 1 is Hamiltonian

It is known that the degree sequences of threshold graphs are characterized by the property that they are not majorized strictly by any degree sequence. Consequently every degree sequence d can be transformed into a threshold sequence by repeated operations consisting of subtracting I from a degree and adding 1 to a larger or equal degree. The minimum number of these operations required to transform d into a threshold sequence is called the majorization gap of d. A realization of a degree sequence d of length n is a graph on the vertices 1, …, n, where the degree of vertex i is d_i. The realization graph %plane1D;4A2;(d) of a degree sequence d has as vertices the realizations of d, and two realizations are neighbors in %plane1D;4A2;(d) if one can be obtained from the other by deleting two existing edges [a, b], [c, d] and adding two new edges [a, d]; [b, c] for some distinct vertices a, b, c, d. It is known that %plane1D;4A2;(d) is connected. We show that if d has a majorization gap of 1, then %plane1D;4A2;(d) is Hamiltonian.     

Computing the determinants of matrix Padé approximation

This paper is devoted to a computational problem of two special determinants which appear in the construction of generalized inverse matrix Padé approximants of type [n/2k] for the given power series with matrix coefficients. The main tools to be used are well-known Schur complement theorem and Arnoldi process for skew-symmetric systems.     

A solvable case of the variance minimization problem

An algorithm is derived, which solves the completion time variance (CTV) problem with equal processing times in O(n log n) time. This result indicates that the special case formulated by Merten and Muller [1] is well solvable.     

Determination of a double Lie groupoid by its core diagram

In a double groupoid S, we show that there is a canonical groupoid structure on the set of those squares of S for which the two source edges are identities; we call this the core groupoid of S. The target maps from the core groupoid to the groupoids of horizontal and vertical edges of S are now base-preserving morphisms whose kernels commute, and we call the diagram consisting of the core groupoid and these two morphisms the core diagram of S. If S is a double Lie groupoid, and each groupoid structure on S satisfies a natural double form of local triviality, we show that the core diagram determines S and, conversely, that a locally trivial double Lie groupoid may be constructed from an abstractly given core diagram satisfying some natural additional conditions.

In the algebraic case, the corresponding result includes the known equivalences between crossed modules, special double groupoids with special connection (Brown and Spencer), and cat¹-groups (Loday). These cases correspond to core diagrams for which both target morphisms are (compatibly) split surjections.     

Commutative quantum operator algebras

A key notion bridging the gap between quantum operator algebras [26] and vertex operator algebras [4, 9] is the definition of the commutativity of a pair of quantum operators (see Section 2). This is not commutativity in any ordinary sense, but it is clearly the correct generalization to the quantum context. In [26] we give a definition of a commutative quantum operator algebra. We show in [26] that a vertex operator algebra gives rise to a special case of a CQOA. The main purpose of the current paper is to further develop the foundations for a complete mathematical theory of CQOAs. We give proofs of most of the relevant results announced in [26], and we carry out some calculations with sufficient detail to enable the interested reader to become proficient with the algebra of commuting quantum operators.     

Explicit and exact special solutions for BBM-like B(m, n) equations with fully nonlinear dispersion

In this paper, the BBM-like equations with fully nonlinear dispersion, B(m, n) equations: u_t + (u^m)_x − (uⁿ)_xxt = 0 which exhibit solutions with compact support and with solitary patterns, are studied. The exact solitary-wave solutions with compact support and exact special solutions with solitary patterns of the equations are found by a new method. The special cases, B(2, 2) and B(3, 3), are used to illustrate the concrete scheme of our approach presented by this paper in B(m, n) equations. The nonlinear equations B(m, n) are addressed for two different cases, namely when m = n being odd and even integers. General formulas for the solutions of B(m, n) equations are established.     

Chapter 4:algebraic sets, polynomials, and other functions

Let T be a linear operator on the vector space V ofn×n matrices over a field F. We discuss two types of problems in this chapter. First, what can we say about T if we assume that T maps a given algebraic set such as the special linear group into itself? Second, let p(x) be a polynomial function (such as det) on V into F. What can we say about T if Tpreserves p(x), i.e. p(T(X)) = p(X) for all X in V?     

On the generalized Erdös-Szekeres Conjecture — a new upper bound

We prove the following result: For every two natural numbers n and q, n q + 2, there is a natural number E(n, q) satisfying the following:

1. (1) Let S be any set of points in the plane, no three on a line. If |S| E(n, q), then there exists a convex n-gon whose points belong to S, for which the number of points of S in its interior is 0 (mod q).

2. (2) For fixed q, E(n,q) 2^c(q)·n, c(q) is a constant depends on q only.

Part (1) was proved by Bialostocki et al. [2] and our proof is aimed to simplify the original proof. The proof of Part (2) is completely new and reduces the huge upper bound of [2] (a super-exponential bound) to an exponential upper bound.     

Computational Aspect For Function-Valued Padé-Type Approximation

The computational problems of two special determinants are investigated. Those determinants appear in the construction of the function-valued Pade-type approximation for computing Fredholm integral equation of the second kind. The main tool to be used in this paper is the well-known Schur complement theorem.     

Feasible strategies for the control of a disk rolling on a moving horizontal plane

Let (X,Y,Z) be an inertial coordinate system and suppose that a horizontal plane is moving in a uniform velocity parallel to the (X,Y)-plane. A disk is rolling on the moving plane. Given two points A and B fixed in the (X,Y)-plane. Open-loop strategies are computed, for rolling the disk, on the moving plane, from A to B, during a given time interval [0, _f] and subject to state and control constraints.