scholarly journals On the One Extremal Problem on the Riemann Sphere

Author(s):  
Andrey L. Targonskii ◽  
Irina Targonskaya

Sharp estimates of product of inner radii for pairwise disjoint domains are obtained. In particular, we solve an extremal problem in the case of arbitrary finite number of rays containing arbitrary even number of free poles.

Author(s):  
Andrey L. Targonskii

The sharp estimates of the product of the inner radius for pairwise disjoint domains are obtained. In particular, we solve an extremal problem in the case of an arbitrary finite number of the free poles on the unit circle for the following functional (see formula in paper)


2019 ◽  
Vol 16 (2) ◽  
pp. 228-238
Author(s):  
Andrey Targonskii ◽  
Irina Targonskaya ◽  
Kateryna Vaschenko

Sharp estimates of a product of the inner radii for pairwise disjoint domains are obtained. In particular, we solve an extremal problem in the case of any finite number of free poles on the rays.


2019 ◽  
Vol 16 (3) ◽  
pp. 307-328
Author(s):  
Aleksandr Bakhtin ◽  
Iryna Denega

We consider an open extremal problem in geometric function theory of complex variables on the maximum of the functional $$r^\gamma\left(B_0,0\right)\prod\limits_{k=1}^n r\left(B_k,a_k\right),$$ where \(B_{0}\), ..., \(B_{n}\), \(n\ge 2\), are pairwise disjoint domains in \(\overline{\mathbb{C}}\), \(a_0 = 0\), \(|a_{k}| = 1\), \(k=\overline{1,n}\), and \(\gamma\in (0, n]\) (\(r(B,a)\) is the inner radius of the domain \(B\subset\overline{\mathbb{C}}\) relative to a point \(a\in B\)). For all values of the parameter \(\gamma\in (0, n]\), it is necessary to show that its maximum is attained for a configuration of domains \(B_{k}\) and points \(a_{k}\), \(k=\overline{0,n}\), possessing the \(n\)-fold symmetry. The problem was solved by V.N. Dubinin [1, 2] for \(\gamma=1\) and by G.V. Kuz’mina [4] for \(0 \lt \gamma \lt 1\). L.V. Kovalev [4] obtained its solution for \(n \ge 5\) under the additional assumption that the angles between neighbouring line segments \([0, a_{k}]\) do not exceed \(2\pi /\sqrt{\gamma}\). In particular, this problem will be solved in the present paper for \(n=2\) and \(\gamma\in(1,\,2]\).


2011 ◽  
Vol 22 (07) ◽  
pp. 991-1011 ◽  
Author(s):  
JUNSHENG FANG ◽  
MINGCHU GAO ◽  
ROGER R. SMITH

A triple of finite von Neumann algebras B ⊆ N ⊆ M is said to have the relative weak asymptotic homomorphism property if there exists a net of unitary operators {uλ}λ∈Λ in B such that [Formula: see text] for all x,y ∈ M. We prove that a triple of finite von Neumann algebras B ⊆ N ⊆ M has the relative weak asymptotic homomorphism property if and only if N contains the set of all x ∈ M such that [Formula: see text] for a finite number of elements x1, …, xn in M. Such an x is called a one-sided quasi-normalizer of B, and the von Neumann algebra generated by all one-sided quasi-normalizers of B is called the one-sided quasi-normalizer algebra of B. We characterize one-sided quasi-normalizer algebras for inclusions of group von Neumann algebras and use this to show that one-sided quasi-normalizer algebras and quasi-normalizer algebras are not equal in general. We also give some applications to inclusions L(H) ⊆ L(G) arising from containments of groups. For example, when L(H) is a masa we determine the unitary normalizer algebra as the von Neumann algebra generated by the normalizers of H in G.


1991 ◽  
Vol 119 (3-4) ◽  
pp. 287-300 ◽  
Author(s):  
G. R. Burton ◽  
J. B. McLeod

SynopsisMaximisation and minimisation of the Dirichlet integral of a function vanishing on the boundary of a bounded domain are studied, subject to the constraint that the Laplacean be a rearrangement of a given function. When the Laplacean is two-signed, non-existence of minimisers is proved, and some information on the limits of minimising sequences obtained; this contrasts with the known existence of minimisers in the one-signed case. When the domain is a ball and the Laplacean is one-signed, maximisers and minimisers are shown to be radial and monotone. Existence of maximisers is proved subject additionally to a finite number of linear constraints, with particular reference to ideal fluid flows of prescribed angular momentum in a disc.


1950 ◽  
Vol 15 (3) ◽  
pp. 182-184 ◽  
Author(s):  
Jan Kalicki

Theorem. There is an effective procedure to decide whether the set of tautologies determined by a given truth-table with a finite number of elements is empty or not.Proof. Let W(P) be a w.f.f. with a single variable P and n a given n-valued truth-table with elements (values)Substitute 1, 2, 3, …, n in succession for P. By the usual contraction process let W(P) assume the truth-values w1, w2, w3, …, wn respectively. The sequencewill be called the value sequence of W(P).Value sequences consisting of designated elements of exclusively will be called designated; others will be called undesignated.All the W(P)'s will be classified in the following way:(a) to the first class CL1 of W(P)'s there belongs the one element P,(b) to the (t + 1)th class CLt + 1 belong all the w.f.f. which can be built up by means of one generating connective from constituent w.f.f. of which one is an element of CLt and all the others (if any) are elements of CLn ≤ t.For example, if N and C are the connectives described by a truth-table etc.Let ∣CLn∣ stand for the set of value sequences of the elements of CLn.


2015 ◽  
Vol 17 (03) ◽  
pp. 1550001
Author(s):  
Aymeric Lardon

The purpose of this paper is to analyze a class of voting games in a partition approach. We consider a society in which coalitions can be formed and where a finite number of voters have to choose among a set of alternatives. A coalition is winning if it can veto any proposed alternative. In our model, the veto power of a coalition is dependent on the coalition formation of the outsiders. We show that whether or not the core is non-empty depends crucially on the expectations of each coalition regarding outsiders' behavior when it wishes to veto an alternative. On the one hand, if each coalition has pessimistic expectations, then the core is non-empty if and only if the dimension of the set of alternatives is equal to one. On the other hand, if each coalition has optimistic expectations, the non-emptiness of the core is not ensured.


1970 ◽  
Vol 22 (4) ◽  
pp. 815-821 ◽  
Author(s):  
D. J. Ward

We say a (plane) set A contains all sets of some type if, for each B of type , there is a subset of A that is congruent to B. Recently, Besicovitch and Rado [3] and independently, Kinney [5] have constructed sets of plane measure zero containing all circles. In these papers it is pointed out that the set of all similar rectangles, some sets of confocal conies and other such classes of sets can be contained in sets of plane measure zero, but all these generalizations rely in some way on the symmetry, or similarity of the sets within the given type.In this paper we construct a set of plane measure zero containing all finite polygonal arcs (i.e., the one-dimensional boundaries of all polygons with a finite number of sides) with slightly stronger results if we restrict our attention to k-gons for some fixed k.


2004 ◽  
Vol 18 (04n05) ◽  
pp. 675-679 ◽  
Author(s):  
SILVIO FRANZ ◽  
FABIO LUCIO TONINELLI

We study diluted spin glass models in arbitrary dimension, where each spin interacts with a finite number of other spins chosen at random with a probability decaying to zero over some distance γ-1. For systems with pairwise interactions we show that the infinite-volume free energy converges to that of the mean-field Viana–Bray model,1 in the Kac limit γ→0. For p-spin like models we get only one bound: the free-energy is bounded from above by the one of the mean-field diluted p-spin.


2013 ◽  
Vol 28 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Nir Perel ◽  
Uri Yechiali

The so called “Israeli Queue” is a single server polling system with batch service of an unlimited size, where the next queue to be visited is the one in which the first customer in line has been waiting for the longest time. The case with finite number of queues (groups) was introduced by Boxma, Van der Wal and Yechiali [3]. In this paper we extend the model to the case with a (possibly) infinite number of queues. We analyze the M/M/1, M/M/c, and M/M/1/N—type queues, as well as a priority model with (at most) M high-priority classes and a single lower priority class. In all models we present an extensive probabilistic analysis and calculate key performance measures.


Sign in / Sign up

Export Citation Format

Share Document