Representations of certain semidirect product groups

We study a class of semidirect product groups G = N · U where N is a generalized Heisenberg group and U is a generalized indefinite unitary group. This class contains the Poincaré group and the parabolic subgroups of the simple Lie groups of real rank 1. The unitary representations of G and (in the unimodular cases) the Plancherel formula for G are written out. The problem of computing Mackey obstructions is completely avoided by realizing the Fock representations of N on certain U-invariant holomorphic cohomology spaces.     

The Baer-invariant of a semidirect product

In 1972 K.I. Tahara [7,2, Theorem 2.2.5], using cohomological methods, showed that if a finite group is the semidirect product of a normal subgroup N and a subgroup T, then M(T) is a direct factor of M(G), where M(G) is the Schur-multiplicator of G and in the finite case, is the second cohomology group of G. In 1977 W. Haebich [1, Theorem 1.7] gave another proof using a different method for an arbitrary group G.In this paper we generalize the above theorem. We will show that scN_cM(T) is a direct factor of _cM(G), where _c[3, p. 102] is the variety of nilpotent groups of class at most c ≥ 1 and _cM(G) is the Baer-invariant of the group G with respect to the variety _c [3, p. 107].     

On approximating the nearest Ω‐stable matrix

In this paper, we consider the problem of approximating a given matrix with a matrix whose eigenvalues lie in some specific region Ω of the complex plane. More precisely, we consider three types of regions and their intersections: conic sectors, vertical strips, and disks. We refer to this problem as the nearest Ω‐stable matrix problem. This includes as special cases the stable matrices for continuous and discrete time linear time‐invariant systems. In order to achieve this goal, we parameterize this problem using dissipative Hamiltonian matrices and linear matrix inequalities. This leads to a reformulation of the problem with a convex feasible set. By applying a block coordinate descent method on this reformulation, we are able to compute solutions to the approximation problem, which is illustrated on some examples.     

A short proof of the preservation of the ωω‐bounding property

There are two versions of the Proper Iteration Lemma. The stronger (but less well‐known) version can be used to give simpler proofs of iteration theorems (e.g., [7, Lemma 24] versus [9, Theorem IX.4.7]). In this paper we give another demonstration of the fecundity of the stronger version by giving a short proof of Shelah's theorem on the preservation of the ω^ω‐bounding property. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Equations on the semidirect product of a finite semilattice by a finite commutative monoid

LetCom _t,q denote the variety of finite monoids that satisfy the equationsxy=yx andx ^t =x ^t+q . The varietyCom _1,1 is the variety of finite semilattices also denoted byJ ₁. In this paper, we consider the product varietyJ ₁*Com _t,q generated by all semidirect products of the formM*N withM∈J ₁ andN∈Com _t,q . We give a complete sequence of equations forJ ₁*Com _t,q implying complete sequences of equations forJ ₁*(Com∩A),J ₁*(Com∩G) andJ ₁*Com, whereCom denotes the variety of finite commutative monoids,A the variety of finite aperiodic monoids andG the variety of finite groups. This material is based upon work supported by the National Science Foundation under Grants No. CCR-9101800 and CCR-9300738. Many thanks to the referee for his valuable comments and suggestions.     

A model of professional competences in mathematics to update mathematical and didactic knowledge of teachers

This paper describes part of a research and development project carried out in public elementary schools. Its objective was to update the mathematical and didactic knowledge of teachers in two consecutive levels in urban and rural public schools of Region de Los Lagos and Region de Los Rios of southern Chile. To that effect, and by means of an advanced training project based on a professional competences model, didactic interventions based on types of problems and types of mathematical competences with analysis of contents and learning assessment were designed. The teachers’ competence regarding the didactic strategy used and its results, as well as the students’ learning achievements are specified. The project made possible to validate a strategy of lifelong improvement in mathematics, based on the professional competences of teachers and their didactic transposition in the classroom, as an alternative to consolidate learning in areas considered vulnerable in two regions of the country.     

On genus imbeddings of the tensor product of graphs

In this article new genus results for the tensor product H ⊗ G are presented. The second factor G in H ⊗ G is a Cayley graph. The imbedding technique used to establish these results combines surgery and voltage graph theory. This technique was first used by A. T. White [17]. This imbedding technique starts with a suitable imbedding of H on some surface and proceeds by modifying H according to the structure of G to give H*. The resulting pseudograph H* is a voltage graph whose covering graph is the tensor product H ⊗ G. Using our knowledge of the order, size, and the number of regions in the imbedding of H*, together with the theory of voltage graphs, we are able to find the minimum genus of the imbedding surface for several families of the product H ⊗ G. © 1996 John Wiley & Sons, Inc.     

Exponential number of inequivalent difference sets in ℤ

Kantor [ 5 ] proved an exponential lower bound on the number of pairwise inequivalent difference sets in the elementary abelian group of order 2^2s+2. Dillon [ 3 ] generalized a technique of McFarland [ 6 ] to provide a framework for determining the number of inequivalent difference sets in 2‐groups with a large elementary abelian direct factor. In this paper, we consider the opposite end of the spectrum, the rank 2 group ? , and compute an exponential lower bound on the number of pairwise inequivalent difference sets in this group. In the process, we demonstrate that Dillon difference sets in groups ? can be constructed via the recursive construction from [ 2 ] and we show that there are exponentially many pairwise inequivalent difference sets that are inequivalent to any Dillon difference set. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 249–259, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10046     

On the hyperdecidability of semidirect products of pseudovarieties

The notion of hyperdecidability has been introduced as a tool which is particularly suited for granting decidability of semidirect products. It is shown in this paper that the semidirect product of an hyperdecidable pseudovariety with a pseudovariety whose finitely generated free objects are finite and effectively computable is again hyperdecidable. As instances of this result, one obtains, for example, the hyperdecidability of the pseudovarieties of ail finite completely simple semigroups and of all finite bands of left groups.     

A bijection between the adjoint and coadjoint orbits of a semidirect product

We prove that there exists a geometric bijection between the sets of adjoint and coadjoint orbits of a semidirect product, provided a similar bijection holds for particular subgroups. We also show that under certain conditions the homotopy types of any two orbits in bijection with each other are the same. We apply our theory to the examples of the affine group and the Poincaré group, and discuss the limitations and extent of this result to other groups.     

左中心rpp半群的半直积

讨论了幂等元都是左中心元的rpp半群的半直积,给出了这种半群半直积的充要条件,推广了一些已知的结果.     

ω‐saturated quasi‐minimal models of Th(ℚω, +, σ, 0)

We show that (ℚ^ω, +, σ, 0) is a quasi-minimal torsion-free divisible abelian group. After discussing the axiomatization of the theory of this structure, we present its ω-saturated quasi-minimal model. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the Roots of σ‐Polynomials

Given a graph G of order n, the σ‐polynomial of G is the generating function where is the number of partitions of the vertex set of G into i nonempty independent sets. Such polynomials arise in a natural way from chromatic polynomials. Brenti (Trans Am Math Soc 332 (1992), 729–756) proved that σ‐polynomials of graphs with chromatic number at least had all real roots, and conjectured the same held for chromatic number . We affirm this conjecture.     

On some sets of dictionaries whose ω ‐powers have a given

A dictionary is a set of finite words over some finite alphabet X. The ω ‐power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V. Lecomte studied in [10] the complexity of the set of dictionaries whose associated ω ‐powers have a given complexity. In particular, he considered the sets ??( Σ ⁰k) (respectively, ??( Π ⁰_k), ??( Δ ¹₁)) of dictionaries V ? 2* whose ω ‐powers are Σ ⁰_k‐sets (respectively, Π ⁰_k‐sets, Borel sets). In this paper we first establish a new relation between the sets ??( Σ ⁰₂) and ??( Δ ¹₁), showing that the set ??( Δ ¹₁) is “more complex” than the set ??( Σ ⁰₂). As an application we improve the lower bound on the complexity of ??( Δ ¹₁) given by Lecomte, showing that ??( Δ ¹₁) is in Σ ¹ ₂(2^2*)\ Π ⁰₂. Then we prove that, for every integer k ≥ 2 (respectively, k ≥ 3), the set of dictionaries ??( Π ⁰_k+1) (respectively, ??( Σ ⁰_{k +1})) is “more complex” than the set of dictionaries ??( Π ⁰_k) (respectively, ??( Σ ⁰_k)) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

W2, p estimates of the heat equation in Ω⊂ℝn and the restrictions on ∂Ω

This is an alternative approach of finding the W^{2, p} estimates of the heat equation in a domain, Ω??ⁿ. Methods used in (Acta Math. Sin. 2003; 19 (2):381–396) are expanded to the case of a bounded domain. As a result, milder restrictions are applied to ?Ω than previously required by using the classical singular integral approach. Copyright © 2005 John Wiley & Sons, Ltd.     

Recursiveness of ω-Operations

It is well known that any finitary operation is recursive in a suitable total numeration. A. Orlicki showed that there is an ω-operation not recursive in any total numeration. We will show that any ω-operation is recursive in a partial numeration. Mathematics Subject Classification: 03D45.     

ω, Δ, and χ

We discuss bounding the chromatic number of a graph by a convex combination of its clique number and its maximum degree plus 1. We will often have recourse to the probabilistic method. © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 177–212, 1998