Approximation of elements in henselizations

For valued fields K of rank higher than 1, we describe how elements in the henselization K ^h of K can be approximated from within K; our result is a handy generalization of the well-known fact that in rank 1, all of these elements lie in the completion of K. We apply the result to show that if an element z algebraic over K can be approximated from within K in the same way as an element in K ^h , then K(z) is not linearly disjoint from K ^h over K.     

Numerical calculation of turbulent corner flows

Numerical predictions are presented of the hydrodynamic characteristics of developing and fully-developed turbulent flow in a square duct. The turbulent stresses in the plane of the cross-section, gradients of which cause the familiar secondary flows, are approximated by gradients in the axial mean velocity. Two distinct approximations are investigated, one of which specifies some of the model ‘constants’ as functions of the gradient of the length scale to account for wall effects. The stresses in the axial momentum equation are calculated from an eddy viscosity deduced from the K-W model of turbulence, K being the turbulence energy and W, a measure of the time-mean-square-vorticity fluctuations. The approximation incorporating wall effects generally performs better than the other when compared with fully-developed flow-data. This same approximation also compares favourably with data for developing flow and predictions based on K-? models in the literature.     

Stability of mappings with bounded distortion in the Sobolev norm on the John domains of Heisenberg groups

This article completes the authors’s series on stability in the Liouville theorem on the Heisenberg group. We show that every mapping with bounded distortion on a John domain of the Heisenberg group is approximated by a conformal mapping with order of closeness √K ? 1 in the uniform norm and with order of closeness K ? 1 in the Sobolev L _p ¹ -norm for all p < C/K?1. We construct two examples, demonstrating the asymptotic sharpness of our results.     

Lattice-point enumerators of ellipsoids

Minkowski’s second theorem on successive minima asserts that the volume of a 0-symmetric convex body K over the covolume of a lattice Λ can be bounded above by a quantity involving all the successive minima of K with respect to Λ. We will prove here that the number of lattice points inside K can also accept an upper bound of roughly the same size, in the special case where K is an ellipsoid. Whether this is also true for all K unconditionally is an open problem, but there is reasonable hope that the inductive approach used for ellipsoids could be extended to all cases.     

Reguläre Inzidenzkomplexe II

The concept of regular incidence complexes generalizes the notion of regular polyhedra in a combinatorial and grouptheoretical sense. A regular (incidence) complex K is a special type of partially ordered structure with regularity defined by the flag-transitivity of its group A(K) of automorphisms. The structure of a regular complex K can be characterized by certain sets of generators and ‘relations’ of its group. The barycentric subdivision of K leads to a simplicial complex, from which K can be rebuilt by fitting together faces. Moreover, we characterize the groups that act flag-transitively on regular complexes. Thus we have a correspondence between regular complexes on the one hand and certain groups on the other hand. Especially, this principle is used to give a geometric representation for an important class of regular complexes, the so-called regular incidence polytopes. There are certain universal incidence polytopes associated to Coxeter groups with linear diagram, from which each regular incidence polytope can be deduced by identifying faces. These incidence polytopes admit a geometric representation in the real space by convex cones.     

Approximation with the output of linear control systems

In this paper we give a new proof that for controllable and observable linear systems every L²[0,T] function can be approximated in the L²[0,T] sense with an output function generated by an L²[0,T] input function. We also give a new characterization of how continuous functions on [0,T] are uniformly approximated by an output generated by a continuous input function. The relative degree of the transfer function of the system determines those functions that can be approximated. We further show that if the initial data is allowed to vary then every continuous function is uniformly approximated by outputs generated by continuous functions.     

Projective sup-algebras: a general view

We begin with the notion of K-flat projectivity. For each sup-algebra L we then introduce a binary relation L_? on it. The K-flat projective sup-algebras are exactly such sup-algebras with each element a approximated by the element x, xL_?a and the relation L_? being stable with respect to the operations on L. Further on, we introduce the notion of a K-comonad and characterize K-flat projective sup-algebras as such sup-algebras having a coalgebra structure for the K-comonad.     

Universality of the Riemann zeta-function

In 1975, S.M. Voronin proved the universality of the Riemann zeta-function ζ(s). This means that every non-vanishing analytic function can be approximated uniformly on compact subsets of the critical strip by shifts ζ(s+iτ). In the paper, we consider the functions F(ζ(s)) which are universal in the Voronin sense.     

Monotone convergence of Newton-like methods for M-matrix algebraic Riccati equations

For the algebraic Riccati equation whose four coefficient matrices form a nonsingular M-matrix or an irreducible singular M-matrix K, the minimal nonnegative solution can be found by Newton’s method and the doubling algorithm. When the two diagonal blocks of the matrix K have both large and small diagonal entries, the doubling algorithm often requires many more iterations than Newton’s method. In those cases, Newton’s method may be more efficient than the doubling algorithm. This has motivated us to study Newton-like methods that have higher-order convergence and are not much more expensive each iteration. We find that the Chebyshev method of order three and a two-step modified Chebyshev method of order four can be more efficient than Newton’s method. For the Riccati equation, these two Newton-like methods are actually special cases of the Newton–Shamanskii method. We show that, starting with zero initial guess or some other suitable initial guess, the sequence generated by the Newton–Shamanskii method converges monotonically to the minimal nonnegative solution.We also explain that the Newton-like methods can be used to great advantage when solving some Riccati equations involving a parameter.     

Smooth approximations

We prove, among other things, that a Lipschitz (or uniformly continuous) mapping f:X→Y can be approximated (even in a fine topology) by smooth Lipschitz (resp. uniformly continuous) mapping, if X is a separable Banach space admitting a smooth Lipschitz bump and either X or Y is a separable C(K) space (resp. super-reflexive space). Further, we show how smooth approximation of Lipschitz mappings is closely related to a smooth approximation of C¹-smooth mappings together with their first derivatives. As a corollary we obtain new results on smooth approximation of C¹-smooth mappings together with their first derivatives.     

Bahri-Coron type theorem for the scalar curvature problem on high dimensional spheres

We consider the existence and multiplicity results for the prescribed scalar curvature problem on the standard spheres of high dimension n ?? 7. Given a C ² positive function K, using the theory of critical points at infinity, we prove an existence result as Bahri-Coron theorem. Our case is a generalization of Li (J Differ Equ 120:319?C410, 1995). Indeed, here the function K is flat near some critical points as in Li (J Differ Equ 120:319?C410, 1995) and it can have some nondegenerate critical points with ?? K ?? 0. Furthermore, using some topological arguments, we prove another kind of result.     

Recent Developments In Harmonic Approximation,With Applications

A theorem of J.L. Walsh (1929) says that if E is a compact subset of Rⁿ with connected complement and if u is harmonic on a neighbourhood of E, then u can be uniformly approximated on E by functions harmonic on the whole of Rⁿ. In Part I of this article we survey some generalizations of Walsh’s theorem from the period 1980–94. In Part II we discuss applications of Walsh’s theorem and its generalizations to four diverse topics: universal harmonic functions, the Radon transform, the maximum principle, and the Dirichlet problem.     

Cube root Ramanujan formulas and elementary Galois theory

The cube root Ramanujan formulas are explained from the point of view of Galois theory. Let F be a cyclic cubic extension of a field K. It is proved that the normal closure over K of a pure cubic extension of F contains a certain pure cubic extension of K. The proposed proof can be generalized to radicals of any prime degree q. In the case where the base field K is the field of rational numbers and the field F is embedded in the cyclotomic extension obtained by adding the pth roots of unity, the corresponding simple radical extension of the field of rational numbers is explicitly constructed. The proof of the main result illustrates Hilbert’s Theorem 90. An example of a particular formula generalizing Ramanujan’s formulas for degree 5 is given. A necessary condition for nested radical expressions of depth 2 to be contained in the normal closure of a pure cubic extension of the field F is given.     

A global algorithm to estimate the expectations of the components of an observed univariate mixture

This paper deals with the unsupervised classification of univariate observations. Given a set of observations originating from a K-component mixture, we focus on the estimation of the component expectations. We propose an algorithm based on the minimization of the “K-product” (KP) criterion we introduced in a previous work. We show that the global minimum of this criterion can be reached by first solving a linear system then calculating the roots of some polynomial of order K. The KP global minimum provides a first raw estimate of the component expectations, then a nearest-neighbour classification enables to refine this estimation. Our method’s relevance is finally illustrated through simulations of various mixtures. When the mixture components do not strongly overlap, the KP algorithm provides better estimates than the Expectation-Maximization algorithm.     

On torsion subgroups of whitehead groups of division algebras

We completely determine all torsion abelian groups that can occur as the torsion subgroup of the Whitehead group of a division algebra of prime index. More precisely, we prove that if D is a division algebra of prime index, then the torsion subgroup of K ₁(D) is locally cyclic. Conversely, if A is a torsion locally cyclic group, then there exists a division algebra D of prime index such that the torsion subgroup of K ₁(D) is isomorphic to A. Our result can be considered as a non-commutative version of May’s Theorem.     

Minimum-weight cycle covers and their approximability

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L⊆N.We investigate how well L-cycle covers of minimum weight can be approximated. For undirected graphs, we devise non-constructive polynomial-time approximation algorithms that achieve constant approximation ratios for all sets L. On the other hand, we prove that the problem cannot be approximated with a factor of 2−ε for certain sets L.For directed graphs, we devise non-constructive polynomial-time approximation algorithms that achieve approximation ratios of O(n), where n is the number of vertices. This is asymptotically optimal: We show that the problem cannot be approximated with a factor of o(n) for certain sets L.To contrast the results for cycle covers of minimum weight, we show that the problem of computing L-cycle covers of maximum weight can, at least in principle, be approximated arbitrarily well.     

Non-Commutative Fejér Theorems

In this paper we prove that there are operators in the uniform Roe algebra ${C_u^*(G)}$ which cannot be approximated by the truncations of themselves, where G is a finitely generated group. We also give a sufficient condition for the operators which can be approximated by the truncations of themselves. For a countable discrete metric space X, we obtain the similar conclusions.     

Approximation of norms on Banach spaces

Relatively recently it was proved that if Γ is an arbitrary set, then any equivalent norm on $c_0(\mathrm{\Gamma })$ can be approximated uniformly on bounded sets by polyhedral norms and $C^{\infty }$ smooth norms, with arbitrary precision. We extend this result to more classes of spaces having uncountable symmetric bases, such as preduals of the ‘discrete’ Lorentz spaces $d(w,1,\mathrm{\Gamma })$, and certain symmetric Nakano spaces and Orlicz spaces. We also show that, given an arbitrary ordinal number α, there exists a scattered compact space K having Cantor–Bendixson height at least α, such that every equivalent norm on $C(K)$ can be approximated as above.     

ℒ-invariants and logarithm derivatives of eigenvalues of Frobenius

Let K be a p-adic local field. We study a special kind of p-adic Galois representations of it. These representations are similar to the Galois representations occurred in the exceptional zero conjecture for modular forms. In particular, we verify that a formula of Colmez can be generalized to our case. We also include a degenerated version of Colmez’s formula.