On the embedding problem with non-Abelian kernel of orderp 4. V

A survey of solvability conditions for the embedding problem of number fields, in which the kernel is a non-Abelian group of order p⁴, is completed. As a kernel, the two 2-groups with two generators a, b and with the following relations are considered: a ⁸ =1, b ² =1, [a,b]=a⁻² in the first group, and a ⁸ =1, b ² =a ⁴ , [a,b]=a⁻² in the second. Bibliography: 7 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 211, 1994, pp. 127–132. Translated by V. V. Ishkhanov.     

Bounding the Derived Length for a Given Set of Character Degrees

Let G be a finite solvable group with {1, a, b, c, ab, ac} as the character degree set, where a ,b, and c are pairwise coprime integers greater than 1. We show that the derived length of G is at most 4. This verifies that the Taketa inequality, dl(G) ≤ |cd(G)|, is valid for solvable groups with {1, a, b, c, ab, ac} as the character degree set. Also, as a corollary, we conclude that if a, b, c, and d are pairwise coprime integers greater than 1 and G is a solvable group such that cd(G) = {1, a, b, c, d, ac, ad, bc, bd}, then dl(G) ≤ 5. Finally, we construct a family of solvable groups whose derived lengths are 4 and character degree sets are in the form {1, p, b, pb, q ^p , pq ^p }, where p is a prime, q is a prime power of an odd prime, and b > 1 is integer such that p, q, and b are pairwise coprime. Hence, the bound 4 is the best bound for the derived length of solvable groups whose character degree set is in the form {1, a, b, c, ab, ac} for some pairwise coprime integers a, b, and c.     

On the Terai-Jésmanowicz conjecture

In this paper, we prove that if a, b and c are pairwise coprime positive integers such that a^2＋b^2=c^r,a〉b,a≡3 （mod4）,b≡2 （mod4） and c-1 is not a square, thena a^x＋b^y=c^z has only the positive integer solution （x, y, z） = （2, 2, r）.
Let m and r be positive integers with 2｜m and 2 r, define the integers Ur, Vr by （m ＋√-1）^r=Vr＋Ur√-1. If a = ｜Ur｜,b=｜Vr｜,c = m^2＋1 with m ≡ 2 （mod 4）,a ≡ 3 （mod 4）, and if r 〈 m/√1.5log3（m^2＋1）-1, then a^x ＋ b^y = c^z has only the positive integer solution （x,y, z） = （2, 2, r）. The argument here is elementary.     

Dense inverse subsemigroups of a topological inverse semigroup

In this paper we study dense inverse subsemigroups of topological inverse semigroups. We construct a topological inverse semigroup from a semilattice. Finally, we give two examples of the closure of B _{( −∞, ∞ )}¹, a topological inverse semigroup obtained by starting with the real numbers as a semilattice with the operation a ∨ b=sup{a,b}. The author would like to thank to the referee for useful suggestions.     

Persistence, contractivity and global stability in logistic equations with piecewise constant delays

We establish sufficient conditions for the persistence and the contractivity of solutions and the global asymptotic stability for the positive equilibrium N^*=1/(a+∑_i=0^mb_i) of the following differential equation with piecewise constant arguments:

where r(t) is a nonnegative continuous function on [0,+∞), r(t)0, ∑_i=0^mb_i>0, b_i0, i=0,1,2,…,m, and a+∑_i=0^mb_i>0. These new conditions depend on a,b₀ and ∑_i=1^mb_i, and hence these are other type conditions than those given by So and Yu (Hokkaido Math. J. 24 (1995) 269–286) and others. In particular, in the case m=0 and r(t)≡r>0, we offer necessary and sufficient conditions for the persistence and contractivity of solutions. We also investigate the following differential equation with nonlinear delay terms:

where r(t) is a nonnegative continuous function on [0,+∞), r(t)0, 1−ax−g(x,x,…,x)=0 has a unique solution x^*>0 and g(x₀,x₁,…,x_m)C¹[(0,+∞)×(0,+∞)××(0,+∞)].     

Groups of typeF a,b,−c

For integersa, b andc, the groupF ^a,b,−c is defined to be the group 〈R, S : R ²=RS ^aRS^bRS^−c=1〉. In this paper we identify certain subgroups of the group of affine linear transformations of finite fields of orderp ⁿ (for certainp andn) as groups of typeF ^a,b,−c for certain (not unique) choices ofa, b andc.     

A Neighborhood Condition for Graphs to Have [a, b]-Factors II

 Let a, b, m, and t be integers such that 1≤a<b and 1≤t≤⌉(b−m+1)/a⌉. Suppose that G is a graph of order |G| and H is any subgraph of G with the size |E(H)|=m. Then we prove that G has an [a,b]-factor containing all the edges of H if the minimum degree is at least a, |G|>((a+b)(t(a+b−1)−1)+2m)/b, and |N _G (x ₁)∪⋯ ∪N _G (x _t )|≥(a|G|+2m)/(a+b) for every independent set {x ₁,…,x _t }⊆V(G). This result is best possible in some sense and it is an extension of the result of H. Matsuda (A neighborhood condition for graphs to have [a,b]-factors, Discrete Mathematics 224 (2000) 289–292). Received: October, 2001 Final version received: September 17, 2002 RID="*" ID="*" This research was partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Encouragement of Young Scientists, 13740084, 2001     

A Generalized Radon Transform on the Plane

A new generalized Radon transform R _α, β on the plane for functions even in each variable is defined which has natural connections with the bivariate Hankel transform, the generalized biaxially symmetric potential operator Δ _α, β , and the Jacobi polynomials P_k^(b, a)(t)P_{k}^{(\beta,\,\alpha)}(t). The transform R _α, β and its dual R_a, b^*R_{\alpha,\,\beta}^{\ast} are studied in a systematic way, and in particular, the generalized Fuglede formula and some inversion formulas for R _α, β for functions in L_a, b^p(\mathbbR²₊)L_{\alpha,\,\beta}^{p}(\mathbb{R}^{2}_{+}) are obtained in terms of the bivariate Hankel–Riesz potential. Moreover, the transform R _α, β is used to represent the solutions of the partial differential equations Lu:=?_j=1^ma_jD_a, b^ju=fLu:=\sum_{j=1}^{m}a_{j}\Delta_{\alpha,\,\beta}^{j}u=f with constant coefficients a _j and the Cauchy problem for the generalized wave equation associated with the operator Δ _α, β . Another application is that, by an invariant property of R _α, β , a new product formula for the Jacobi polynomials of the type P_k^(b, a)(s)C_2k^a+b+1(t)=còòP_k^(b, a)P_{k}^{(\beta,\,\alpha)}(s)C_{2k}^{\alpha+\beta+1}(t)=c\int\!\!\int P_{k}^{(\beta,\,\alpha)} is obtained.     

Exceptional cases of Terai’s conjecture on Diophantine equations

Let a, b, c be relatively prime positive integers such that a ^p  + b ^q  = c ^r for fixed integers p, q, r ≥ 2. Terai conjectured that the equation a ^x  + b ^y  = c ^z in positive integers has only the solution (x, y, z) = (p, q, r) except for specific cases. In this paper, we consider the case q = r = 2 and give some results related to exceptional cases.     

Graphs of Non-Crossing Perfect Matchings

 Let P _n be a set of n=2m points that are the vertices of a convex polygon, and let ℳ _m be the graph having as vertices all the perfect matchings in the point set P _n whose edges are straight line segments and do not cross, and edges joining two perfect matchings M ₁ and M ₂ if M ₂=M ₁−(a,b)−(c,d)+(a,d)+(b,c) for some points a,b,c,d of P _n . We prove the following results about ℳ _m : its diameter is m−1; it is bipartite for every m; the connectivity is equal to m−1; it has no Hamilton path for m odd, m>3; and finally it has a Hamilton cycle for every m even, m≥4. Received: October 10, 2000 Final version received: January 17, 2002 RID="*" ID="*" Partially supported by Proyecto DGES-MEC-PB98-0933 Acknowledgments. We are grateful to the referees for comments that helped to improve the presentation of the paper.     

Near-interpolation

Summary.  A parametric curve fL ₂ ^(m) ([a,b]ℝ ^d ) is a ``near-interpolant' to prescribed data z <sub>ij</sub> ℝ <sup>d</sup> at data sites t <sub>i</sub> [a,b] within tolerances 0<ɛ <sub>ij</sub> ≤∞ if |f <sup>(j−1)</sup> (t <sub>i</sub> )−z <sub>ij</sub> |≤ɛ <sub>ij</sub> for i=1:n and j=1:m, and a ``best near-interpolant' if it also minimizes ∫ _a ^b |f ^(m) |². In this paper optimality conditions are derived for these best near-interpolants. Based on these conditions it is shown that the near-interpolants are actually smoothing splines with weights that appear as Lagrange multipliers corresponding to the constraints. The optimality conditions are applied to the computation of near-interpolants in the last sections of the paper. Received September 4, 2001 / Revised version received July 22, 2002 / Published online October 29, 2002 Mathematics Subject Classification (1991): 41A05, 41A15, 41A29     

Semi-cosymplectic manifolds

SoitM(Ω, η, ξ,g) une variété à (2m+1)-dimensions presque cosymplectique (i. e. Ω∈Λ² M est de rang 2m et Ω ^m Λη≠0). On définitM comme étant une variété semi-cosymplectique si en termes ded ^ω-cohomologie la paire (Ω, η) satisfait àdη=0,d ^−cη Ω=Ψ∈Λ³ M,c=constant. Dans ce cas le champ vectoriel de structure ξ=b ⁻¹(η) est un champ conforme horizontal et siM est une forme-espace elle est nécessairement du type hyperbolique. Différentes propriétés de cette structure sont étudiés et le cas oùM est une variété para Sasakienne dans le sens large est discuté.     

Left-divisibility and word problems in single relation monoids

LetM be a monoid presented by <Σ;u=v> whereu andv are words on the finite alphabet Σ./ Deciding the world problem forM is still an open question, though it seems decidable and partial results exist. The remaining cases to solve are presentations of the form <a, b; bva=aua>,u, v∈{a, b}^⋆ The word problem is then closely related to the left-divisibility problem, as shown by S.I. Adjan who introduced a procedure that “almost” allows to decide the problem. The main contribution, due to Adjan and Oganesjan, states that ifbva is an unbordered factor ofaua then the word problem is deciable. We restrict Adjan's procedure to study the case whenbva is unbordered, which allows us to extend Adjan and Oganesjan's theorem. More specifically, we show (Proposition 4.24) that the word problem is decidable for presentations <a, b; bva=aua> with the only following condition: Inbva, the leftmost train ofb is strictly longer than the others. The following corollary naturally holds: The word problem is decidable for presentations of the form <a, b; b ^m a ⁿ =aua>,u∈{a, b}^⋆,m, n>0     

On the Hamilton-Waterloo Problem

 The Hamilton-Waterloo problem asks for a 2-factorisation of K _v in which r of the 2-factors consist of cycles of lengths a ₁,a ₂,…,a _t and the remaining s 2-factors consist of cycles of lengths b ₁,b ₂,…,b _u (where necessarily ∑ _i=1 ^t a _i =∑ _j=1 ^u b _j =v). In this paper we consider the Hamilton-Waterloo problem in the case a _i =m, 1≤i≤t and b _j =n, 1≤j≤u. We obtain some general constructions, and apply these to obtain results for (m,n)∈{(4,6),(4,8),(4,16),(8,16),(3,5),(3,15),(5,15)}. Received: July 5, 2000     

On the algebraic independence in the selberg class

We prove that a functionF of the Selberg class ℐ is ab-th power in ℐ, i.e.,F=H ^b for someHσ ℐ, if and only ifb divides the order of every zero ofF and of everyp-componentF _p. This implies that the equationF ^a=G^b with (a, b)=1 has the unique solutionF=H ^b andG=H ^a in ℐ. As a consequence, we prove that ifF andG are distinct primitive elements of ℐ, then the transcendence degree of ℂ[F,G] over ℂ is two.     

Diagonal equations over function fields

LetK be a function field in one variable over ℂ anda ₁,...,a _m ,b non-zero elements ofK, such thatb is linearly independent froma ₁,...,a _m over ℂ. We show that forn sufficiently large, the equation ∑ _i=1 ^m a _i x _i ⁿ has no non-constant solutions inK.     

Multiplicative Products of Dedekind η-Functions and Group Representations

In this paper, we findall metacyclic groups (a,b:a^m=e,b^s=e,b^-1ab=a^r), where m=10,14,15,20,21,22, such that the cusp forms associated with all elements of these groups by an exact representation are multiplicative-products. We also consider the correspondence between multiplicative -products and elements of finite order in SL(5,C) by the adjoint representation.     

Properties of certain semigroups and their potential as platforms for cryptosystems

In this paper, we study some properties of semigroups with presentation 〈a,b ; a ^p =b ^r ,a ^q =b ^s 〉. We will also study their potential as platforms for the Diffie-Hellman key exchange protocol.     

On Rado numbers for

For all integers m3 and all natural numbers a₁,a₂,…,a_m−1, let n=R(a₁,a₂,…,a_m−1) represent the least integer such that for every 2-coloring of the set {1,2,…,n} there exists a monochromatic solution to

a₁x₁+a₂x₂++a_m−1x_m−1=x_m.