The Goulden—Jackson cluster method: extensions,applications and implementations

Th powerful (and so far under-utilized) Goulden—Jackson Cluster method for finding the generating function for the number of words avoiding, as factors, the members of a prescribed set of ‘dirty words’, is tutorialized and extended in various directions. The authors' Maple implementations, contained in several Maple packages available from this paper's website www.math.temple.edu/zeilberg/gj.html, ar described and explained.     

Subsonic irrotational flows in a two-dimensional finitely long curved nozzle

This is a continuation of our previous paper Du et al. (http://www.ims.cuhk.edu.hk/publications/reports/2012-06.pdf), where we have characterized a set of physical boundary conditions that ensures the existence and uniqueness of subsonic irrotational flow in a flat nozzle. In this paper, we will investigate the influence of the incoming flow angle and the geometry structure of the nozzle walls on subsonic flows in a finitely long curved nozzle. It turns out to be interesting that the incoming flow angle and the angle of inclination of nozzle walls play the same role as the end pressure for the stabilization of subsonic flows. In other words, the L ² and L ^∞ bounds of the derivative of these two quantities cannot be too large, similar as we have indicated in Du et al. (http://www.ims.cuhk.edu.hk/publications/reports/2012-06.pdf) for the end pressure. The curvatures of the nozzle walls will also play an important role in the stability of the subsonic flow.     

Local minimizers of the Ginzburg-Landau functional with prescribed degrees

We consider, in a smooth bounded multiply connected domain D⊂R², the Ginzburg-Landau energy subject to prescribed degree conditions on each component of ∂D. In general, minimal energy maps do not exist [L. Berlyand, P. Mironescu, Ginzburg-Landau minimizers in perforated domains with prescribed degrees, preprint, 2004]. When D has a single hole, Berlyand and Rybalko [L. Berlyand, V. Rybalko, Solution with vortices of a semi-stiff boundary value problem for the Ginzburg-Landau equation, J. Eur. Math. Soc. (JEMS), in press, 2008, http://www.math.psu.edu/berlyand/publications/publications.html] proved that for small ε local minimizers do exist. We extend the result in [L. Berlyand, V. Rybalko, Solution with vortices of a semi-stiff boundary value problem for the Ginzburg-Landau equation, J. Eur. Math. Soc. (JEMS), in press, 2008, http://www.math.psu.edu/berlyand/publications/publications.html]: Eε(u) has, in domains D with 2,3,… holes and for small ε, local minimizers. Our approach is very similar to the one in [L. Berlyand, V. Rybalko, Solution with vortices of a semi-stiff boundary value problem for the Ginzburg-Landau equation, J. Eur. Math. Soc. (JEMS), in press, 2008, http://www.math.psu.edu/berlyand/publications/publications.html]; the main difference stems in the construction of test functions with energy control.     

Algorithms for extracting motifs from biological weighted sequences

In this paper we present three algorithms for the Motif Identification Problem in Biological Weighted Sequences. The first algorithm extracts repeated motifs from a biological weighted sequence. The motifs correspond to repetitive words which are approximately equal, under a Hamming distance, with probability of occurrence 1/k, where k is a small constant. The second algorithm extracts common motifs from a set of N2 weighted sequences. In this case, the motifs consists of words that must occur with probability 1/k, in 1qN distinct sequences of the set. The third algorithm extracts maximal pairs from a biological weighted sequence. A pair in a sequence is the occurrence of the same word twice. In addition, the algorithms presented in this paper improve previous work on these problems.     

A derivative free iterative method for finding multiple roots of nonlinear equations

For an equation f(x)=0 having a multiple root of multiplicity m>1 unknown, we propose a transformation which converts the multiple root to a simple root of H(x)=0. The transformed function H(x) of f(x) with a small >0 has appropriate properties in applying a derivative free iterative method to find the root. Moreover, there is no need to choose a proper initial approximation. We show that the proposed method is superior to the existing methods by several numerical examples.     

On periodicity and low complexity of infinite permutations

We define an infinite permutation as a sequence of reals taken up to value, or, equivalently, as a linear ordering of or of . We introduce and characterize periodic permutations; surprisingly, for each period t there is an infinite number of distinct t-periodic permutations. At last, we study a complexity notion for permutations analogous to subword complexity for words, and consider the problem of minimal complexity of non-periodic permutations. Its answer is not analogous to that for words and is different for the right infinite and the bi-infinite case.     

Newton's method on Riemannian manifolds: Smale's point estimate theory under the {gamma}-condition

^** Email: cli{at}zju.edu.cn^*** Email: wjh{at}zjut.edu.cn The -conditions for vector fields on Riemannian manifolds areintroduced. The -theory and the -theory for Newton's methodon Riemannian manifolds are established under the -conditions.Applications to analytic vector fields are provided and theresults due to Dedieu et al. (2003, IMA J. Numer. Anal., 23,395–419) are improved.     

Cut points in metric spaces

In this note, we will define topological and virtual cut points of finite metric spaces and show that, though their definitions seem to look rather distinct, they actually coincide. More specifically, let X denote a finite set, and let denote a metric defined on X. The tight span T(D) of D consists of all maps for which f(x)=sup_yX(xy−f(x)) holds for all xX. Define a map fT(D) to be a topological cut point of D if T(D)−{f} is disconnected, and define it to be a virtual cut point of D if there exists a bipartition (or split) of the support of f into two non-empty sets A and B such that ab=f(a)+f(b) holds for all points aA and bB. It will be shown that, for any given metric D, topological and virtual cut points actually coincide, i.e., a map fT(D) is a topological cut point of D if and only if it is a virtual cut point of D.     

On a Method of J. H. C. Whitehead

In this article which is partly a continuation of Goldstein (1999 Goldstein , R. Z. ( 1999 ). The length and thickness of words in a free group . Proc. Amer. Math. Soc. 127 ( 10 ): 2857 – 2863 . [CSA] [CROSSREF]  [Google Scholar]), we give some necessary and sufficient conditions for an element of a free group to be primitive. For certain words x, we also give a lower bound on the length of words obtained from x by an automorphism. In the last section we give another proof of the Primitivity Theorem recently proven by Lee, using ideas from the first part of the article.     

Post-processing with computable error bounds for the finite element approximation of a nonlinear heat conduction problem

Email: ain{at}mcs.le.ac.uk Email: D.Kelly{at}unsw.edu.au^* Email: I.Sloan{at}unsw.edu.au^** Email: swang{at}cs.curtin.edu.au It is shown how the finite element approximation of a nonlinearheat conduction problem may be post-processed to yield enhancedapproximations to the solution and the flux at any point inthe domain. Sharp computable bounds on the accuracy of the post-processedapproximations are derived. A criterion is identified for guidingadaptive refinements of the finite element discretization. Anumerical example is given illustrating the theoretical results.     

Systems of fuzzy equations in structural mechanics

Systems of linear and nonlinear equations with fuzzy parameters are relevant to many practical problems arising in structure mechanics, electrical engineering, finance, economics and physics. In this paper three methods for solving such equations are discussed: method for outer interval solution of systems of linear equations depending linearly on interval parameters, fuzzy finite element method proposed by Rama Rao and sensitivity analysis method. The performance and advantages of presented methods are described with illustrative examples. Extended version of the present paper can be downloaded from the web page of the UTEP [I. Skalna, M.V. Rama Rao, A. Pownuk, Systems of fuzzy equations in structural mechanics, The University of Texas at El Paso, Department of Mathematical Sciences Research Reports Series, 〈$〈$http://www.math.utep.edu/preprints/2007/2007-01.pdf〉$〉$, Texas Research Report No. 2007-01, 2007].     

Symplectic 2 × 2 matrices over free algebras

P.M. Cohn has proved the remarkable theorem, that every invertible n × n matrix over a free algebra is the product of elementary n × n matrices, see [C1], [C2]. In this note we prove the analogue for symplectic 2 × 2 matrices over free algebras relative to a homogeneous involution: every symplectic 2 × 2 matrix is the product of elementary symplectic 2 × 2 matrices.In Section 1 we define the group Sp₂(R) of symplectic 2 × 2 matrices over an involutive ring R. The group ESp₂(R) generated by elementary symplectic matrices is introduced in Section 3.In Section 2 we prove a reducibility criterion for homogeneous polynomials in a free algebra KX over a commutative field K. It leads to a special form in the factorization of symmetric homogeneous polynomials, see Corollary to Proposition 2.2.We prove in Section 4 that ESp₂(KX) = Sp₂(KX), if the involution on KX is homogeneous.In a subsequent article we will show that the main result is also true for 2g × 2g symplectic matrices over free algebras relative to homogeneous involutions, g ≥ 1. It seems that a proof of this result will be much more complicated than the case g = 1.     

Strong Haagerup inequalities with operator coefficients

We prove a Strong Haagerup inequality with operator coefficients. If for an integer d, denotes the subspace of the von Neumann algebra of a free group F_I spanned by the words of length d in the generators (but not their inverses), then we provide in this paper an explicit upper bound on the norm on , which improves and generalizes previous results by Kemp–Speicher (in the scalar case) and Buchholz and Parcet–Pisier (in the non-holomorphic setting). Namely the norm of an element of the form ∑_{i=(i1,…,id)}a_iλ(g_i1g_id) is less than , where M₀,…,M_d are d+1 different block-matrices naturally constructed from the family (a_i)_iI^d for each decomposition of I^dI^l×I^d−l with l=0,…,d. It is also proved that the same inequality holds for the norms in the associated non-commutative L_p spaces when p is an even integer, pd and when the generators of the free group are more generally replaced by *-free -diagonal operators. In particular it applies to the case of free circular operators. We also get inequalities for the non-holomorphic case, with a rate of growth of order d+1 as for the classical Haagerup inequality. The proof is of combinatorial nature and is based on the definition and study of a symmetrization process for partitions.