Some power of an element in a Garside group is conjugate to a periodically geodesic element

We show that for each element g of a Garside group, there existsa positive integer m such that g^m is conjugate to a periodicallygeodesic element h, an element with |hⁿ| = |n| · |h|for all integers n, where |g| denotes the shortest word lengthof g with respect to the set of simple elements. We also showthat there is a finite-time algorithm that computes, given anelement of a Garside group, its stable super summit set.     

Regularity of Rees Algebras

Let B = k[x₁, ..., x_n] be a polynomial ring over a field k,and let A be a quotient ring of B by a homogeneous ideal J.Let m denote the maximal graded ideal of A. Then the Rees algebraR = A[m t] also has a presentation as a quotient ring of thepolynomial ring k[x₁, ..., x_n, y₁, ..., y_n] by a homogeneousideal J^*. For instance, if A = k[x₁, ..., x_n], then Rk[x₁,...,x_n,y₁,...,y_n]/(x_iy_j–x_jy_i|i, j=1,...,n). In this paper we want to compare the homological propertiesof the homogeneous ideals J and J^*.     

An Optimal Representation Formula for Carnot-Caratheodory Vector Fields

The simplest example of the sort of representation formula thatwe shall study is the following familiar inequality for a smooth,real-valued function f(x) defined on a ball B in N-dimensionalEuclidean space R^N: [formula] where f denotes the gradient of f, f_B is the average |B|^–1_Bf(y)dy, |B| is the Lebesgue measure of B, and C is a constantwhich is independent of f, x and B. This formula can be found,for example, in [4] and [12]; see also the closely related estimatesin [20, pp. 228{231]. Indeed, such a formula holds in any boundedconvex domain. 1991 Mathematics Subject Classification 31B10,46E35, 35A22.     

Value Distribution of Interpolating Blaschke Products

A Blaschke product B with zero-sequence (a_n) is called almostinterpolating if the inequality lim inf_n(1 – |a_n|²)|B'(a_n)|     

Formulas for Liapunov Functions for Systems of Linear Difference Equations

Explicit quadratic Liapunov functions that provide necessaryand sufficient conditions for the asymptotic stability of thesystem of linear difference equations x (t + 1) = Ax(t) areconstructed by transforming the original systems to y (t + 1)= Gy(t), where G is a companion matrix associated with the characteristicpolynomial of A. A necessary and sufficient condition for allroots of the characteristic polynomial to lie in the unit circle|z| < 1 on the complex plane is also derived. 2000 MathematicalsSubject Classification 39A11, 93D05.     

On Positive Multipeak Solutions of a Nonlinear Elliptic Problem

In this paper we continue our investigation in [5, 7, 8] onmultipeak solutions to the problem –²u+u=Q(x)|u|^q–2u, xR^N, uH¹(R^N) (1.1) where = ^N_i=1²/x²_i is the Laplace operator in R^N, 2 < q < for N = 1, 2, 2 < q < 2N/(N–2) for N3, and Q(x)is a bounded positive continuous function on R^N satisfying thefollowing conditions. (Q₁) Q has a strict local minimum at some point x₀R^N, that is,for some > 0 Q(x)>Q(x₀) for all 0 < |x–x₀| < . (Q₂) There are constants C, > 0 such that |Q(x)–Q(y)|C|x–y| for all |x–x₀| , |y–y₀| . Our aim here is to show that corresponding to each strict localminimum point x₀ of Q(x) in R^N, and for each positive integerk, (1.1) has a positive solution with k-peaks concentratingnear x₀, provided is sufficiently small, that is, a solutionwith k-maximum points converging to x₀, while vanishing as 0 everywhere else in R^N.     

Base Sizes and Regular Orbits for Coprime Affine Permutation Groups

Let G be a permutation group on a finite set . A sequence B=(₁,..., _b) of points in is called a base if its pointwise stabilizerin G is the identity. Bases are of fundamental importance incomputational algorithms for permutation groups. For both practicaland theoretical reasons, one is interested in the minimal basesize for (G, ), For a nonredundant base B, the elementary inequality2^|B||G|||^|B| holds; in particular, |B|log|G|/log||. In the casewhen G is primitive on , Pyber [8, p. 207] has conjectured thatthe minimal base size is less than Clog|G|/log|| for some (large)universal constant C. It appears that the hardest case of Pyber's conjecture is thatof primitive affine groups. Let H=GV be a primitive affine group;here the point stabilizer G acts faithfully and irreduciblyon the elementary abelian regular normal subgroup V of H, andwe may assume that =V. For positive integers m, let mV denotethe direct sum of m copies of V. If (v₁, ..., v_m)mV belongsto a regular G-orbit, then (0, v₁, ..., v_m) is a base for theprimitive affine group H. Conversely, a base (₁, ..., _b) forH which contains 0V= gives rise to a regular G-orbit on (b–1)V. Thus Pyber's conjecture for affine groups can be viewed asa regular orbit problem for G-modules, and it is therefore aspecial case of an important problem in group representationtheory. For a related result on regular orbits for quasisimplegroups, see [4, Theorem 6].     

The dilation factor of the Peano-Hilbert curve

It is proved that the maximum value of the ratio |p(x) ? p(y)|²/|x ? y| for the Peano-Hilbert curve p: [0, 1] = I → I ² is equal to 6.     

Multipliers of Qs spaces and the corona theorem

For s>0, let Q_s be the space of all analytic functions onthe unit disc such that |f'(z)|²(1–|z|²)^s dA(z) isan s-Carleson measure. Here we prove that the corona theoremholds for the algebra of pointwise multipliers of Q_s.     

Annular Functions and Gap Series

If f(z) = c_kz^nk, where n_k+1/n_k q > 1, and f(z) is analyticin |z| < 1, the f(z) is an annular function if and only ifsup |c_k| = . This answers a question posed by L. R. Sons andD.M. Campbell simplifies the proofs of many known examples ofannular functions. Present address: Dept. of Mathematical Sciences, McMaster University,Hamilton, Ontario, Canada L8S4K1     

Nonoscillation of Elliptic Integrals Related to Cubic Polynomials with Symmetry of Order Three

We study zeros of elliptic integrals I(h)=_HhR(x,y)dxdy, whereH(x,y) is a real cubic polynomial with a symmetry of order three,and R(x,y) is a real polynomial of degree at most n. It turnsout that the vector space A_n formed by such integrals is a Chebishevsystem: the number of zeros of each elliptic integral I(h)A_nis less than the dimension of the vector space A_n. 1991 MathematicsSubject Classification 34C10.     

Diophantine analysis and torsion on elliptic curves

In a recent paper of Bennett and the author, it was shown thatthe elliptic curve defined by y² = x³ + Ax + B, where A andB are integers, has no rational points of finite order if Ais sufficiently large relative to B (at least if one assumesthe abc Conjecture of Masser and Oesterlé). In the presentarticle we show, perhaps surprisingly, that the rational torsionon the above curve is also quite restricted if B is sufficientlylarge relative to A. In particular, we demonstrate that forany > 0 there is a constant c such that if A and B are integerssatisfying |B| > c |A|⁶⁺, then the elliptic curve definedabove has no rational torsion points, other than a possiblepoint of order 2 (again making use of the abc Conjecture insome cases). We then extend this by proving similar resultsfor elliptic curves admitting non-trivial -isogenies, ellipticcurves written in other forms, and elliptic curves over certainnumber fields. Curiously, the results on isogenies lead to twounexpected irrationality measures for certain algebraic numbers.     

A Class of Pencils of Matrices

A linear machine is one in which the time dependent input yis related to the output z by P(D). z = S(D). y where P andS are polynomials in D = d/dt with constant coefficients. Fornumerical computation it is necessary to replace this relationby a set of simultaneous first order differential equationsand this paper shows how to construct such equations by methodswhich extend the results of Gilder (1961). Attention is restrictedto those sets of equations that are of a special form (see (1))which is characterized by the matrix operating on the dependentvariables. This matrix forms a pencil, being linear in D, andthree theorems are given to show how such matrix pencils maybe constructed from the polynomials. The theorems also statethat any matrix pencil with the required properties can be transformedinto the canonical forms given in the theorems by pre- and post-multiplicationby suitable constant non-singular matrices. Thus the variablesof any set of equations having the required properties are linearcombinations of the variables of the equations given by thetheorems. In the paper it is assumed that the degree of P(D)is greater than that of S(D), as otherwise z would be replacedby z₁+Q(D) . y, where Q is the quotient of S(D)/P(D). Also,as the algebriac manipulations are independent of the natureof the polynomials, D is replaced by an indeterminate x andthe coefficients considered to be from an arbitrary field. Fortechnical reasons we rename y and z, y_o and y_n–_m respectively.     

The Marica-Schonheim Inequality in Lattices

The Marica-Schönheim Inequality says that if A is a finitefamily of sets, then |A–||A| where A–A=[A₁\A₂:A₁,A₂A]. For a finite lattice L and AL, we define a–b=(J_a\J_b)where J_a=[jL:ja and j is join-irreducible], and if AL then welet A–A=[a₁–a₂: a₁, a₂A]. Then the analogue of theMarica-Schöonheim Inequality is |A–A|A| for all AL.We prove that this is true if L is distributive or complementedand modular or L is a partition lattice.     

On the behaviour of blow-up interfaces for an inhomogeneous filtration equation

We study the asymptotic behaviour of blow-up interfaces of thesolutions to the one-dimensional nonlinear filtration equationin inhomogeneous media where m>1 isa constant and (x) = |x|^– (for |x| 1, with > 2) isa bounded, positive, smooth, and symmetric function. The initialdata are assumed to be smooth, bounded, compactly supported,symmetric, and monotone. It is known that due to the fast decayof the density (x) as |x| the support of the solution increasesunboundedly in a finite time T. We prove that as tT^– theinterface behaves like O((T – t)^–b), where the exponentb > 0 (which depends on m and only) is given by a uniqueself-similar solution of the second kind satisfying the equation|x|^– u_t = (u^m)_xx. The corresponding rescaled profilesalso converge. We establish the stability of the self-similarsolution of the second kind for the exponential density (x)=e^–|x|for |x| 1. We give a formal asymptotic analysis of the blow-upbehaviour for the non-self-similar density (x) = e^–|x|2.Several exact self-similar solutions and their correspondingasymptotics are constructed.     

The Symmetrized Bidisc and Lempert's Theorem

Let G C² be the open symmetrized bidisc, namely G = {(₁ + ₂,₁₂) : |₁| < 1, |₂| < 1}. In this paper, a proof is giventhat G is not biholomorphic to any convex domain in C². By combiningthis result with earlier work of Agler and Young, the authorshows that G is a bounded domain on which the Carathéodorydistance and the Kobayashi distance coincide, but which is notbiholomorphic to a convex set. 2000 Mathematics Subject Classification32F45 (primary), 15A18 (secondary).     

On the Discreteness and Convergence in n-Dimensional Mobius Groups

Throughout this paper, we adopt the same notations as in [1,6, 8] such as the Möbius group M(Rⁿ), the Clifford algebraC_n–1, the Clifford matrix group SL(2, _n), the Cliffordnorm of ||A||=(|a|²+|b|²+|c|²+|d|²) (1) and the Clifford metric of SL(2, _n) or of the Möbius groupM(Rⁿ) d(A₁,A₂)=||A₁–A₂||(|a₁–a₂|²+|b₁–b₂|²+|c₁–c₂|²+|d₁–d₂|²)(2) where |·| is the norm of a Clifford number and represents f_i M(), i = 1,2, and so on. In addition, we adopt some notions in [6, 12]:the elementary group, the uniformly bounded torsion, and soon. For example, the definition of the uniformly bounded torsionis as follows.     

An Algebraic Obstruction to Isomorphism of Markov Shifts with Group Alphabets

Given a compact group G, a standard construction of a Z² Markovshift _G with alphabet G is described. The cardinality of G (ifG is finite) or the topological dimension of G (if G is a torus)is shown to be an invariant of measurable isomorphism for _G.We show that if G is sufficiently non-abelian (for instanceA₅, PSL₂(F₇) or a Suzuki simple group) and H is any abeliangroup with |H| = |G|, then _G and H are not isomorphic. Thusthe cardinality of G is seen to be necessary but not sufficientto determine the measurable structure of _G.     

Best Approximation in an Asymmetrically Weighted L1 Measure

Let f(x) be a given, real-valued, continuous function definedon an interval [a,b]of the real line. Given a set of m real-valued,continuous functions _j(x) defined on [a,b], a linear approximatingfunction can be formed with any real setA = {a₁, a₂,..., a_m}. We present results for determining A sothat F(A, x) is a best approximation to(x) when the measureof goodness of approximation is a weighted sum of |F(A, x)–f(x)|,the weights being positive constants, w, when F(A, x) f(x)and w2 otherwise (when w, = w2 = 1, the measure is the L₁, norm).The results are derived from a linear programming formulationof the problem. In particular, we give a theorem which shows when such bestapproximations interpolate the function at fixed ordinates whichare independent of f(x). We show how the fixed points can becalculated and we present numerical results to indicate thatthe theorem is quite robust.     

On approximation theorems for controllability of non-linear parabolic problems

^** Email: anil{at}math.iitb.ac.in^*** Email: mcj{at}math.iitb.ac.in^**** Email: akp{at}math.iitb.ac.in In this paper, we consider the following control system governedby the non-linear parabolic differential equation of the form: [graphic: see PDF] where A is a linear operator with dense domain and f(t, y)is a non-linear function. We have proved that under Lipschitzcontinuity assumption on the non-linear function f(t, y), theset of admissible controls is non-empty. The optimal pair (u^*,y^*) is then obtained as the limit of the optimal pair sequence{(u_n^*, y_n^*)}, where u_n^* is a minimizer of the unconstrainedproblem involving a penalty function arising from the controllabilityconstraint and y_n^* is the solution of the parabolic non-linearsystem defined above. Subsequently, we give approximation theoremswhich guarantee the convergence of the numerical schemes tooptimal pair sequence. We also present numerical experimentwhich shows the applicability of our result.