Problems of extremal decomposition

One solves the problem on the extremal decomposition of the extended plane in a family D of systems of nonoverlapping domains D_i, 1ip, where for i0 the domains D_i are the usually considered doubly connected domains and simply connected domains with a distinguished interior point, while for p₀ip they are biangles. The obtained theorem generalizes the corresponding result of G. V. Kuz'mina (Moduli of families of curves and quadratic differentials, Trudy Mat. Inst. Akad. Nauk SSSR, Vol. 139, 1980).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 154, pp. 76–89, 1986.     

On extremal decomposition problems

The capacity approach and symmetrization method arc adapted to some extremal decomposition problems on the unit disk or an annulus. The problems on the maximum product of the interior radii of pairwise nonoverlapping domains and the maximum product of the Robin radii of such domains are considered. New invariants with respect to the M?bius transformations of the Riemann sphere are introduced. In particular, for these invariants problems on extremal decomposition with free poles on the unit circle are investigated. Bibliography: 19 titles. Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 357, 2008, pp. 54–74.     

Asymptotic of extremal polynomials in the complex plane

We study the zero location and asymptotic zero distribution of sequences of polynomials which satisfy an extremal condition with respect to a norm given on the space of all polynomials.     

An extremal metric approach to some problems on extremal decomposition

The paper presents a simple extremal metric approach to problems on extremal decomposition in families of systems of nonoverlapping domains of different types. The approach is based on using general properties of trajectories of the associated quadratic differentials for simpler extremal decomposition problems. Bibliography: 8 titles. Dedicated to the 100th anniversary of G. M. Goluzin’s birthday __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 337, 2006, pp. 191–211.     

On extremal point distributions in the Euclidean plane

We ask for the maximum σ _n ^γ of Σ _i,j=1 ⁿ ‖x _i-x _j‖^γ, where x ₁,χ,x _n are points in the Euclidean plane R ² with ‖x_i-x_j‖ ≦1 for all 1≦ i,j ≦ n and where ‖.‖^γ denotes the γ-th power of the Euclidean norm, γ ≧ 1. (For γ =1 this question was stated by L. Fejes Tóth in [1].) We calculate the exact value of σ _n ^γ for all γ γ 1,0758χ and give the distributions which attain the maximum σ _n ^γ . Moreover we prove upper bounds for σ _n ^γ for all γ ≧ 1 and calculate the exact value of σ ₄ ^γ for all γ ≧ 1. This revised version was published online in June 2006 with corrections to the Cover Date.     

On some extremal problems of approximation theory in the complex plane

In the Hardy Banach spaces H _q , Bergman Banach spaces H_q, and Banach spaces (p, q, ), we determine the exact values of the Kolmogorov, Bernstein, Gelfand, linear, and trigonometric n-widths of classes of functions analytic in the disk |z| < 1 and such that the averaged moduli of continuity of their r-derivatives are majorized by a certain function. For these classes, we also consider the problems of optimal recovery and coding of functions.__________Translated from Ukrainskyi Matematychnyi Zhurnal, Vol. 56, No. 9, pp. 1155–1171, September, 2004.     

On minimal non-potentially closed subsets of the plane

We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions. We show the existence of a perfect antichain made of minimal sets among non-potentially closed sets. We apply this result to graphs, quasi-orders and partial orders. We also give a non-potentially closed set minimum for another notion of comparison. Finally, we show that we cannot have injectivity in the Kechris-Solecki-Todor?evi? dichotomy about analytic graphs.     

On the extremal Betti numbers of the binomial edge ideal of closed graphs

We study the equality of the extremal Betti numbers of the binomial edge ideal and those of its initial ideal for a closed graph G. We prove that in some cases there is a unique extremal Betti number for and as a consequence there is a unique extremal Betti number for and these extremal Betti numbers are equal.     

The second closed geodesic on a complex projective plane

We show the existence of at least two geometrically distinct closed geodesics on a complex projective plane with a bumpy and non-reversible Finsler metric.      

Conley decomposition for closed relations

This paper presents a theory of dynamics of closed relations on compact Hausdorff spaces. It contains an investigation of set valued maps and establishes generalizations for some topological aspects of dynamical systems theory, including recurrence, attractor–repeller structure and the Conley decomposition theorem.     

Problem of extremal partition for n-fold connected domains

This paper is directly related to [1], but here we establish a theorem for the case of an n-fold connected circular domain. As an application we solve the problem of extremal partition for an annulus.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 185, pp. 96–110, 1990.     

On symmetric configurations in some problems on extremal decomposition

Some problems on extremal decomposition in families of systems of nonoverlapping domains of various types with free parameters are studied. The functionals considered contain a sum of the reduced modules of biangles. For the problems under consideration, the existence of extremal configurations with appropriate symmetry is investigated. Bibliography: 8 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 350, 2007, pp. 160–172.     

Elimination of extremal index zeroes from generic paths of closed $$$$-forms

Let \( \alpha \) be a Morse closed \( 1 \)-form of a smooth \( n \)-dimensional manifold \( M \). The zeroes of \( \alpha \) of index \( 0 \) or \( n \) are called centers. It is known that every non-vanishing de Rham cohomology class \( u \) contains a Morse representative without centers. The result of this paper is the one-parameter analogue of the last statement: every generic path \( (\alpha _t)_{ t\in [0,1] }\) of closed \( 1 \)-forms in a fixed class \( u\ne 0 \) such that \( \alpha _0,\alpha _1 \) have no centers, can be modified relatively to its extremities to another such path \( (\beta _t)_{t \in [0,1]} \) having no center at all.     

Motzkin decomposition of closed convex sets

Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. This paper provides five characterizations of the larger class of closed convex sets in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed in the paper. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed.     

Expanding convex immersed closed plane curves

We study the evolution driven by curvature of a given convex immersed closed plane curve. We show that it will converge to a self-similar solution eventually. This self-similar solution may or may not contain singularities. In case it does, we also have estimate on the curvature blow-up rate.     

On the curve diffusion flow of closed plane curves

In this paper, we consider the steepest descent H ^?1-gradient flow of the length functional for immersed plane curves, known as the curve diffusion flow. It is known that under this flow there exist both initially immersed curves that develop at least one singularity in finite time and initially embedded curves that self-intersect in finite time. We prove that under the flow closed curves with initial data close to a round circle in the sense of normalised L ² oscillation of curvature exist for all time and converge exponentially fast to a round circle. This implies that for a sufficiently large ‘waiting time’, the evolving curves are strictly convex. We provide an optimal estimate for this waiting time, which gives a quantified feeling for the magnitude to which the maximum principle fails. We are also able to control the maximum of the multiplicity of the curve along the evolution. A corollary of this estimate is that initially embedded curves satisfying the hypotheses of the global existence theorem remain embedded. Finally, as an application we obtain a rigidity statement for closed planar curves with winding number one.     

The butterfly decomposition of plane trees

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition, which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one correspondence between doubly rooted plane trees and free Dyck paths, which implies a simple derivation of a relation between the Catalan numbers and the central binomial coefficients. We also establish a one-to-one correspondence between leaf-colored doubly rooted plane trees and free Schröder paths. The classical Chung-Feller theorem as well as some generalizations and variations follow quickly from the butterfly decomposition. We next obtain two involutions on free Dyck paths and free Schröder paths, leading to parity results and combinatorial identities. We also use the butterfly decomposition to give a combinatorial treatment of Klazar's generating function for the number of chains in plane trees. Finally we study the total size of chains in plane trees with n edges and show that the average size of such chains tends asymptotically to (n+9)/6.