A geometric approach to generalized Stokes conjectures

We consider the Stokes conjecture concerning the shape of extreme two-dimensional water waves. By new geometric methods including a nonlinear frequency formula, we prove the Stokes conjecture in the original variables. Our results do not rely on structural assumptions needed in previous results such as isolated singularities, symmetry and monotonicity. Part of our results extends to the mathematical problem in higher dimensions.

The physical pendulum in an advanced undergraduate course in mechanics

The physical pendulum treated with a Hamiltonian formulation is a natural topic for study in a course in advanced classical mechanics. For the past three years, we have been offering a series of problem sets studying this system numerically in our third-year undergraduate courses in mechanics. The problem sets investigate the physics of the pendulum in ways not easily accessible without computer technology and explore various algorithms for solving mechanics problems. Our computational physics is based on Mathematica with some C communicating with Mathematica, although nothing in this paper is dependent on that choice. We have nonetheless found this system, and particularly its graphics, to be a good one for use with undergraduates.

On universal and periodic β-expansions, and the Hausdorff dimension of the set of all expansions

We study the topology of a set naturally arising from the study of β-expansions. After proving several elementary results for this set we study the case when our base is Pisot. In this case we give necessary and sufficient conditions for this set to be finite. This finiteness property will allow us to generalise a theorem due to Schmidt and will provide the motivation for sufficient conditions under which the growth rate and Hausdorff dimension of the set of β-expansions are equal and explicitly calculable.

The curve selection lemma and the Morse-Sard theorem

We use an inequality due to Bochnak and Lojasiewicz, which follows from the Curve Selection Lemma of real algebraic geometry in order to prove that, given a C(r) function f : U subset of R(m) -> R, we have lim(y -> xy is an element of crit(f)) vertical bar f(y) - f(x)vertical bar/vertical bar y - x vertical bar(r) = 0, for all x is an element of crit(f)` boolean AND U, where crit( f) = {x is an element of U vertical bar df ( x) = 0}. This shows that the so-called Morse decomposition of the critical set, used in the classical proof of the Morse-Sard theorem, is not necessary: the conclusion of the Morse decomposition lemma holds for the whole critical set. We use this result to give a simple proof of the classical Morse-Sard theorem ( with sharp differentiability assumptions).

Finite determinacy and Whitney equisingularity of map germs from C(n) to C(2n-1)

We show that a holomorphic map germ f : (C(n), 0) -> (C(2n-1), 0) is finitely determined if and only if the double point scheme D(f) is a reduced curve. If n >= 3, we have that mu(D(2)(f)) = 2 mu(D(2)(f)/S(2))+C(f)-1, where D(2)(f) is the lifting of the double point curve in (C(n) x C(n), 0), mu(X) denotes the Milnor number of X and C(f) is the number of cross-caps that appear in a stable deformation of f. Moreover, we consider an unfolding F(t, x) = (t, f(t)(x)) of f and show that if F is mu-constant, then it is excellent in the sense of Gaffney. Finally, we find a minimal set of invariants whose constancy in the family f(t) is equivalent to the Whitney equisingularity of F. We also give an example of an unfolding which is topologically trivial, but it is not Whitney equisingular.

Improved likelihood inference for the shape parameter in Weibull regression

We obtain adjustments to the profile likelihood function in Weibull regression models with and without censoring. Specifically, we consider two different modified profile likelihoods: (i) the one proposed by Cox and Reid [Cox, D.R. and Reid, N., 1987, Parameter orthogonality and approximate conditional inference. Journal of the Royal Statistical Society B, 49, 1-39.], and (ii) an approximation to the one proposed by Barndorff-Nielsen [Barndorff-Nielsen, O.E., 1983, On a formula for the distribution of the maximum likelihood estimator. Biometrika, 70, 343-365.], the approximation having been obtained using the results by Fraser and Reid [Fraser, D.A.S. and Reid, N., 1995, Ancillaries and third-order significance. Utilitas Mathematica, 47, 33-53.] and by Fraser et al. [Fraser, D.A.S., Reid, N. and Wu, J., 1999, A simple formula for tail probabilities for frequentist and Bayesian inference. Biometrika, 86, 655-661.]. We focus on point estimation and likelihood ratio tests on the shape parameter in the class of Weibull regression models. We derive some distributional properties of the different maximum likelihood estimators and likelihood ratio tests. The numerical evidence presented in the paper favors the approximation to Barndorff-Nielsen`s adjustment.

On automorphisms of split metacyclic groups

Let D( m, n; k) be the semi-direct product of two finite cyclic groups Z/m = < x > and Z/n = < y >, where the action is given by yxy(-1) = x(k). In particular, this includes the dihedral groups D(2m). We calculate the automorphism group Aut (D(m, n; k)).

THE FUNDAMENTAL GROUP OF THE SPACE OF MAPS FROM A SURFACE INTO THE PROJECTIVE PLANE

In this work we compute the fundamental group of each connected component of the function space of maps from it closed surface into the projective space

Extensions of homogeneous polynomials ON c(0)(l(2)(i))

We show that a 2-homogeneous polynomial on the complex Banach space c(0)(l(2)(i)) is norm attaining if and only if it is finite (i.e, depends only on finite coordinates). As the consequence, we show that there exists a unique norm-preserving extension for norm-attaining 2-homogeneous polynomials on c(0)(l(2)(i)).

On automorphisms of finite abelian p-groups

Let A be a finitely generated abelian group. We describe the automorphism group Aut(A) using the rank of A and its torsion part p-part A(p). For a finite abelian p-group A of type (k(1),..., k(n)), simple necessary and sufficient conditions for an n x n-matrix over integers to be associated with an automorphism of A are presented. Then, the automorphism group Aut(A) for a finite p-group A of type (k(1), k(2)) is analyzed. (C) 2008 Mathematical Institute Slovak Academy of Sciences.

A stronger Dunford-Pettis property

We discuss a strong version of the Dunford-Pettis property, earlier named (DP*) property, which is shared by both l(1) and l(infinity) It is equivalent to the Dunford-Pettis property plus the fact that every quotient map onto c(0) is completely continuous. Other weak sequential continuity results on polynomials and analytic mappings related to the (DP*) property are shown.

UNIFORM APPROXIMATION ON IDEALS OF MULTILINEAR MAPPINGS

For each ideal of multilinear mappings M we explicitly construct a corresponding ideal (a)M such that multilinear forms in (a)M are exactly those which can be approximated, in the uniform norm, by multilinear forms in M. This construction is then applied to finite type, compact, weakly compact and absolutely summing multilinear mappings. It is also proved that the correspondence M bar right arrow (a)M. IS Aron-Berner stability preserving.

A BROADER CONTEXT FOR MONOTONICALLY MONOLITHIC SPACES

This is a sequel of the work done on (strongly) monotonically monolithic spaces and their generalizations. We introduce the notion of monotonically kappa-monolithic space for any infinite cardinal kappa and present the relevant results. We show, among other things, that any sigma-product of monotonically kappa-monolithic spaces is monotonically kappa-monolithic for any infinite cardinal kappa; besides, it is consistent that any strongly monotonically omega-monolithic space with caliber omega(1) is second countable. We also study (strong) monotone kappa-monolithicity in linearly ordered spaces and subspaces of ordinals.

Comparação de sistemas de programação

Este trabalho compara as soluções disponibilizadas pelos sistemas Derive 5.0, Maple 6 e Mathematica 4.0 para problemas que encontramos no ensino secundário e também nos primeiros anos da universidade. Procuramos destacar os aspectos distintos entre cada um dos programas ao mesmo tempo que fazemos referência aos pontos em que tudo se passa de forma semelhante. Esta dissertação aborda o cálculo numérico, o cálculo simbólico, a programação e os gráficos. Para cada um dos assuntos é estudada a forma como se podem resolver os problemas através dos três sistemas comparando-se estas soluções. Inicialmente, é feita uma abordagem que permite ao utilizador adquirir os conhecimentos básicos acerca dos diversos programas. Tratamos de seguida de algumas questões relacionadas com o cálculo numérico e com algumas funções nomeadamente da Teoria dos Números. Referimos listas e funções e são analisadas diversas formas de manipular listas e os seus elementos bem como algumas áreas da Análise Matemática das quais destacamos as equações, a derivação e a integração compreendendo cálculo numérico e cálculo simbólico. Examinamos um vasto conjunto de operações definidas sobre matrizes (representadas como listas de listas) e polinómios que abrangem as operações mais comuns de cada um dos campos. Analisamos também a programação recursiva, a programação imperativa, a programação funcional e a programação por regras de reescrita. A abordagem aqui adoptada foi a de fornecer ao utilizador as construções chave mais importantes que cada paradigma de programação utiliza bem como as informações básicas acerca do funcionamento de cada uma delas de modo a permitir a resolução dos problemas propostos. Por último os gráficos sobre os quais incidiu a nossa análise foram os de uma e de duas variáveis representados no referencial cartesiano, gráficos estes que são os mais utilizados quer ao nível do ensino superior quer ao nível do ensino secundário. A qualidade e a facilidade de obter rapidamente as representações dão outra dimensão ao estudo dos gráficos principalmente quando estamos a falar de gráficos a três dimensões. A ideia de animação gráfica é também aqui abordada sendo evidente os benefícios da utilização da mesma nos programas em que é possível efectuá-la. Concluímos que na programação o Mathematica destaca-se em relação aos demais o mesmo se passando no Maple no respeitante à representação gráfica. O Derive permite que durante o contacto inicial seja mais fácil trabalhar e aprender a linguagem própria.