Search

1. In a recent paper [2] Reich has made the observation that an example of Koebe given in 1918 [1] does not fulfill its asserted purpose. This example was to show that vanishing measure of the complement did not assure that a slit domain was minimal. Reich proceeded to fill the gap by carrying out the following somewhat more general construction. Let A be a compact perfect nowhere dense set on the x-axis in the z-plane (z=x+iy). Then there exists a compact set S in the z-plane with the properties: (i) A is the projection of S on the x-axis, (ii) S is composed of segments symmetric with respect to the x-axis and points on the x-axis, at least one segment being present, (iii) any point in S, not on the x-axis and not at the end of a segment in S, is the limit, both from the left and right, of points of S. Once this construction is performed the desired examples are easily given [2, ?4]. The object of the present paper is to give an alternative construction which is very explicit and direct.

The purpose of this short paper is to present a new form of the so called early exercise premium for the American type derivatives. The decomposition we derived consists of the corresponding European derivative and a derivative with a stochastic maturity. In different particular cases we reach to the well known form for the American put option where the underlying asset is driven by a Brownian motion or a Levy process.

The paper consists of two parts. In the first part a short proof of the main theorem due to A. Aziz on the location of zeros of composite polynomials is given. In the second part some properties of a fixed length continuation of a polynomial are deduced.

The first symptomatic infected individuals of coronavirus (Covid-19) was confirmed in December 2020 in the city of Wuhan, China. In India, the first reported case of Covid-19 was confirmed on 30 January 2020. Today, coronavirus has been spread out all over the world. In this manuscript, we studied the coronavirus epidemic model with a true data of India by using Predictor-Corrector scheme. For the proposed model of Covid-19, the numerical and graphical simulations are performed in a framework of the new generalised Caputo sense non-integer order derivative. We analysed the existence and uniqueness of solution of the given fractional model by the definition of Chebyshev norm, Banach space, Schauder's second fixed point theorem, Arzel's-Ascoli theorem, uniform boundedness, equicontinuity and Weissinger's fixed point theorem. A new analysis of the given model with the true data is given to analyse the dynamics of the model in fractional sense. Graphical simulations show the structure of the given classes of the non-linear model with respect to the time variable. We investigated that the mentioned method is copiously strong and smooth to implement on the systems of non-linear fractional differential equation systems. The stability results for the projected algorithm is also performed with the applications of some important lemmas. The present study gives the applicability of this new generalised version of Caputo type non-integer operator in mathematical epidemiology. We compared that the fractional order results are more credible to the integer order results.

In [4], Phelps showed that in certain function algebras the unit ball is the closed convex hull of its extreme points. The algebra, C(X), of complex valued continuous functions on a compact Hausdorff space, will always have this property. The class of logmodular algebras which have a Gleason part which is total also was shown to have the property. In this paper we give an elementary proof of the first result (a proof which is, in theory at least, constructive). The simplest nontrivial example of a logmodular algebra with a total part is the disk algebra (i.e. the functions continuous on the closed disk and analytic in the interior). For this algebra we show that the extreme points (in fact the exposed points) of the unit ball form a dense subset of the boundary of the unit ball. Let U be the unit ball of C(X). It is well known that q in U is an extreme point of U if I q(x) I = 1 for all x in X. Now if f in U never vanishes, then f is in the closed convex hull of the extreme points; in factf is between two uniquely determined extreme points. We need only observe that for each x in X,f(x) is halfway between two uniquely determined extreme points of the disk and that these points vary continuously with x. Now it is not necessarily the case that each function in U can be approximated by a nonvanishing function. For a counterexample we need only look at h(z) = z in the algebra of continuous functions on the disk. (If If(z)-zj 1/e. Letfi, i = 1, *, N be the retract maps obtained from these rotations. Then I 1/N Efi(z)-z

where the oi are the usual generators of Bn. (See [1; 4].) A textile manufacturer asked the following question: Can one decide whether or not a braid in An is also in Qn? (It is possible to "weave" a braid in Qn while keeping its ends "tied together.") Shepperd [6] solved the above decision problem using the generators and relations of the braid group and subgroups. In this paper we give another distinct solution working in terms of automorphisms of free groups. In particular, we use formulas developed in [3; 4]. The author wishes to thank his teacher, and friend, Professor Wilhelm Magnus who has contributed more than anyone else towards the author's knowledge of mathematics.

Among other results, it is proved that if a sequence { μ n } \{ {\mu _n}\} of regular measures on a Hausdorff space, with values in a normed group, is convergent to zero for all σ \sigma -compact sets or all open sets, then there exists a maximal open set U such that μ ˙ n ( U ) → 0 , { μ ˙ n } {\dot \mu _n}(U) \to 0,\{ {\dot \mu _n}\} being the associated submeasures.

n/a

n/a

The result indicated in the title of this paper (Ref. Zh. Mat. 1976, 7A225) is false. The error is corrected.

We propose a complete-search algorithm for solving a class of non-convex, possibly infinite-dimensional, optimization problems to global optimality. We assume that the optimization variables are in a bounded subset of a Hilbert space, and we determine worst-case run-time bounds for the algorithm under certain regularity conditions of the cost functional and the constraint set. Because these run-time bounds are independent of the number of optimization variables and, in particular, are valid for optimization problems with infinitely many optimization variables, we prove that the algorithm converges to an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}ε-suboptimal global solution within finite run-time for any given termination tolerance \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon > 0$$\end{document}ε>0. Finally, we illustrate these results for a problem of calculus of variations.

We give a simplified proof to the following theorem due to D. Quillen: if A is a commutative noetherian ring of global dimension ⩽ 1 \leqslant 1 , then finitely generated projective modules over A [ T 1 , … , T n ] A[{T_1}, \ldots ,{T_n}] are extended from A. We prove also that if A is a commutative noetherian ring of global dimension d, then finitely generated projective modules of rank > d > d over A [ T 1 , … , T n ] A[{T_1}, \ldots ,{T_n}] are extended from A.

This note deals with the correction of a small flaw in the proof of a theorem (and a lemma) in [2]. Also a simpler proof of the theorem in question is given. In the proof of Theorem 2.3 in [2], the statement "that distinct L's cannot belong to a common pure subgroup HL follows immediately from the fact that no two L's generate with G [p] the same subgroup of G" is false as it stands. One has to exercise a little more care in the selection of HL. For example, since the union [xa, Xa]aEA of all the L's (in Lemma 2.1 in [2]) is still linearly independent, there exists according to [1] a pure subgroup H of G supported by S such that HDL for each L. Hence one could choose HL=H for each L. However, all goes well if HL is chosen such that HLn [Xa, XTg aEA =L, as can easily be done. Similar remarks hold for Lemma 3.8 in [2]. A short alternate proof of Theorem 2.3 in [2] is given. In what follows let c be the cardinality of the continuum and Q be the first ordinal whose cardinality is c. The notation and terminology will be the same as that in [2].

n/a

In [2], Tosiro Tsuzzuku gave a proof of the following:THEOREM. Let G be a doubly transitive permutation group of degree n, let K be any commutative ring with unit element and let p be the natural representation of G by n × n permutation matrices with elements 0, 1 in K. Then ρ is decomposable as a matrix representation over K if and only ifn is an invertible element of K.For G the symmetric group this result follows from Theorems (2.1) and (4.12) of [1]. The proof given by Tsuzuku is unsatisfactory, although it is perfectly valid when K is a field. The purpose of this note is to give a correct proof of the general case.

Craig (1962) described an application of order statistics from a binomial distribution and gave an approximate expression for the mean value of the minimum of two binomial variables having the same probability of success and the same number of trials. In this note we suggest another approximation for the mean and also for the standard deviation of the minimum, using normal order statistics tabulated by Teichroew (1956).