Quantitative Siegel's theorem for Galois coverings

It is known that Siegels theorem on integral points is effective for Galoiscoverings of the projective line. In this paper we obtain a quantitative version of this result, giving an explicit upper bound for the heights of S-integral K-rational points in terms of the number field K, the set of places S and the defining equation of the curve.Our main tools are Bakers theory of linear forms in logarithms and thequantitative Eisenstein theorem due to Schmidt, Dwork and van der Poorten.     

Properties of the Set of Extreme Solutions for a Class of Nonlinear Second-Order Evolution Inclusions

We establish the existence of extreme solutions for a class of nonlinear second-order evolution inclusions with a nonconvex right-hand side defined on an evolution triple of Banach spaces. Then we show that extreme solutions which belong to the solution set of the original system are in fact dense and codense in the solution set of a system with a convexified right-hand side. The necessary and sufficient conditions for closedness of the solution set for the original system in an appropriate spaces of functions are given as well. Finally, an example of a nonlinear hyperbolic distributed parameter system is worked out in detail.     

How to Construct Diffusion Processes on Metric Spaces

We present a general method to construct m-symmetric diffusion processes (X_t, P_x) on any given locally compact metric space (X, d) equipped with a Radon measure m. These processes are associated with local regular Dirichlet forms which are obtained as -limits of approximating non-local Dirichlet forms. This general method works without any restrictions on (X, d, m).     

Asymptotic Curvature of Θ-Metrics

We give an explicit and reasonably simple expression for the curvature tensor of a -metric at boundary points, in terms of the metric tensor and invariants of the -structure. We examine the behavior of the induced metric on level sets of a defining function near the boundary and describe the asymptotic behavior of its curvature tensor. Some applications of these results are given.     

On Generalizations of Ostrowski Inequality and Some Related Results

Some generalizations of the Ostrowski inequality, the Milovanovi-Peari-Fink inequality, the Dragomir-Agarwal inequality and the Hadamard inequality are given.     

Some Properties of Isologism of Groups and Baer-Invariants

Let be a variety of groups defined by the set of laws V. In this paper we study the concept of -isologism of groups in terms of -extensions and their connections with the Baer-invariant of groups are also discussed.AMS Subject Classification (2000): primary 20F14, 20F19, secondary 20E10     

Inequality of Petrović and Giaccardi for Convex Function of Higher Order

In this paper we use Lidstone polynomials to prove further generalization of Giaccardi generalization of the well-known Petrovis inequality.     

Distribution of Increasing ℓ-sequences in a Random Permutation

This paper examines the distribution of the number, k, of increasing -sequences in a random permutation of . A new solution is determined based on the compositions of n which requires, at most, summands. This solution easily yields existing results for the special case and provides an alternate form for the case . The expected number of increasing -sequences in a random permutation is determined and it is shown that the limiting distribution is degenerate about 0 for 2$$ " align="middle" border="0"> . An alternate algorithm to determine the exact distribution is presented, based on the partitions of n, which is easy to implement and efficient for small n. Applications in non-parametric statistics and graph theory are discussed.     

Choosing a Linear Model with a Random Number of Change-Points and Outliers

The problem of determining a normal linear model with possible perturbations, viz. change-points and outliers, is formulated as a problem of testing multiple hypotheses, and a Bayes invariant optimal multi-decision procedure is provided for detecting at most k (k > 1) such perturbations. The asymptotic form of the procedure is a penalized log-likelihood procedure which does not depend on the loss function nor on the prior distribution of the shifts under fairly mild assumptions. The term which penalizes too large a number of changes (or outliers) arises mainly from realistic assumptions about their occurrence. It is different from the term which appears in Akaikes or Schwarz criteria, although it is of the same order as the latter. Some concrete numerical examples are analyzed.     

On θ-Principal Extension and H-Closedness

A type of extensions called the -extention of topological spaces and their -equivalence and -trace systems are introduced, which ultimately characterize H-closed -extensions of a Hausdorff topological space. Also, the notion of -principal extensions is defined. A typical -principal extension consisting of certain grills on a Hausdorff space is constructed, and finally, some characterizations of H-closedness of a Hausdorff space are obtained.AMS Subject Classification (2000) 54D30 54D99     

Piecewise Constant Roughly Convex Functions

This paper investigates some kinds of roughly convex functions, namely functions having one of the following properties: -convexity (in the sense of Klötzler and Hartwig), -convexity and midpoint -convexity (in the sense of Hu, Klee, and Larman), -convexity and midpoint -convexity (in the sense of Phu). Some weaker but equivalent conditions for these kinds of roughly convex functions are stated. In particular, piecewise constant functions satisfying f(x) = f([x]) are considered, where [x] denotes the integer part of the real number x. These functions appear in numerical calculation, when an original function g is replaced by f(x):=g([x]) because of discretization. In the present paper, we answer the question of when and in what sense such a function f is roughly convex.     

A closed formula for the čebyšev barycentric weights of optimal approximation in H2

The barycentric formula has several advantages over other means of evaluating the polynomial interpolating a function betweenn points in an interval. In particular, it is much more stable for sets of points clustered at the extremities of the interval, as are all the sets guaranteeing a good approximation forn sufficiently large. Also, it requires onlyO(n) operations for every function to be interpolated, once some weights, which depend only on the points, have been computed. Computing those weights usually requiresO(n²) operations; for ebyev points, however,O(n) operations suffice. We show here that all the above is also true for the optimal evaluation of functionals in H² by giving a closed formula for the corresponding weights.     

Some topological properties of ω-covering sets

We prove the following theorems:1. There exists an -covering with the property s ₀.2. Under cov there exists X such that is not an -covering orX \ B is not an -covering].3. Also we characterize the property of being an -covering.     

Σ-Subsets of Natural Numbers

It is shown that the class of all possible families of -subsets of finite ordinals in admissible sets coincides with a class of all non-empty families closed under e-reducibility and . The construction presented has the property of being minimal under effective definability. Also, we describe the smallest (w.r.t. inclusion) classes of families of subsets of natural numbers, computable in hereditarily finite superstructures. A new series of examples is constructed in which admissible sets lack in universal -function. Furthermore, we show that some principles of classical computability theory (such as the existence of an infinite non-trivial enumerable subset, existence of an infinite computable subset, reduction principle, uniformization principle) are always satisfied for the classes of all -subsets of finite ordinals in admissible sets.     

Topological existence and stability for stackelberg problems

The aim of this paper is to study, in a topological framework, existence and stability for the solutions to a parametrized Stackelberg problem. To this end, approximate solutions are used, more precisely, -solutions and strict -solutions. The results given are of minimal character and the standard types of constraints are considered, that is, constant constraints, constraints defined by a finite number of inequalities, and more generally constraints defined by an arbitrary multifunction.     

Hulls for Various Kinds of α-Completeness in Archimedean Lattice-Ordered Groups

Within Archimedean -groups, and with an infinite cardinal or , we consider X-hulls where X stands for any of the following classes of -groups: -projectable; laterally -complete; boundedly laterally -complete; conditionally -complete; combinations of the preceding, together with divisibility and/or relative uniform completeness. All these hulls exist, and may be obtained by iterated adjunction of the required extra elements, within the essential hull. When the -groups is relatively -complemented one step in the iteration suffices for several crucial properties. We derive from the above a considerable number of equations involving combinations of these hull operators.     

On Some Generalizations and Refinements of a Ky Fan Inequality

In this paper, a Ky Fan inequality and an inequality by Wu and Wang [10] will be generalized. Some new and improved refinements of the Ky Fan inequality will be put forward.AMS Subject Classification (2000) 26D15     

Presentability of Groups of Σ-Definable Permutations over Admissible Sets

It is proved that a group of all -permutations of an arbitrary locally countable, recursively listed, admissible set is not -presentable over that set. An example is constructed showing that this group could be presentable provided that the condition of being locally countable is dropped.