Filters compatible with isomorphism testing

Like the lower central series of a nilpotent group, filters generalize the connection between nilpotent groups and graded Lie rings. However, unlike the case with the lower central series, the associated graded Lie ring may share few features with the original group: e.g. the associated Lie ring can be trivial or arbitrarily large. We determine properties of filters such that every isomorphism between groups is induced by an isomorphism between graded Lie rings.     

Boundedness of semilinear Duffing equations at resonance in a critical situation

In this paper, we propose a sufficient and necessary condition for the boundedness of all the solutions for the equation $\ddot{x}+n^{2}x+g(x)=p(t)$ with the critical situation that $|{\int }_0^{2\pi }p(t)e^{?int}dt|=2|g(+\infty )?g(?\infty )|$ on g and p, where $n\in {\mathbb{N}}^{+}$, $p(t)$ is periodic and $g(x)$ is bounded.     

Convergence of solutions for the fractional Cahn–Hilliard system

This paper deals with the Cauchy–Dirichlet problem for the fractional Cahn–Hilliard equation. The main results consist of global (in time) existence of weak solutions, characterization of parabolic smoothing effects (implying under proper condition eventual boundedness of trajectories), and convergence of each solution to a (single) equilibrium. In particular, to prove the convergence result, a variant of the so-called ?ojasiewicz–Simon inequality is provided for the fractional Dirichlet Laplacian and (possibly) non-analytic (but $C^1$) nonlinearities.     

Congruence criteria for finite subsets of complex projective and complex hyperbolic spaces

We investigate congruence classes and direct congruence classes of m-tuples in the complex projective space ℂP ⁿ . For direct congruence one allows only isometries which are induced by linear (instead of semilinear) mappings. We establish a canonical bijection between the set of direct congruence classes of m-tuples of points in ℂP ⁿ and the set of equivalence classes of positive semidefinite Hermitean m×m-matrices of rank at most n+1 with 1's on the diagonal. As a corollary we get that the direct congruence class of an m-tuple is uniquely determined by the direct congruence classes of all of its triangles, provided that no pair of points of the m-tuple has distance π/2. Examples show that the situation changes drastically if one replaces direct congruence classes by congruence classes or if distances π/2 are allowed. Finally we do the same kind of investigation also for the complex hyperbolic space ℂH ⁿ . Most of the results are completely analogous, however, there are also some interesting differences. Received: 15 January 1996     

Numerical methods for finding multiple eigenvalues of matrices depending on parameters

Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996     

Point approximation of a space-homogeneous transport equation

Summary We present an approximation method of a space-homogeneous transport equation which we prove is convergent. The method is very promising for numerical computation. Comparison of a numerical computation with an exact solution is given for the Master equation.     

Optimal tristance anticodes in certain graphs

For z₁,z₂,z₃∈Zⁿ, the tristance d₃(z₁,z₂,z₃) is a generalization of the L₁-distance on Zⁿ to a quantity that reflects the relative dispersion of three points rather than two. A tristance anticodeA_d of diameter d is a subset of Zⁿ with the property that d₃(z₁,z₂,z₃)?d for all z₁,z₂,z₃∈A_d. An anticode is optimal if it has the largest possible cardinality for its diameter d. We determine the cardinality and completely classify the optimal tristance anticodes in Z² for all diameters d?1. We then generalize this result to two related distance models: a different distance structure on Z² where d(z₁,z₂)=1 if z₁,z₂ are adjacent either horizontally, vertically, or diagonally, and the distance structure obtained when Z² is replaced by the hexagonal lattice A₂. We also investigate optimal tristance anticodes in Z³ and optimal quadristance anticodes in Z², and provide bounds on their cardinality. We conclude with a brief discussion of the applications of our results to multi-dimensional interleaving schemes and to connectivity loci in the game of Go.