scholarly journals Short loops in surfaces with a circular boundary component

2018 ◽  
Vol 12 (03) ◽  
pp. 667-673
Author(s):  
Panos Papasoglu

It is a classical theorem of Loewner that the systole of a Riemannian torus can be bounded in terms of its area. We answer a question of a similar flavor of Robert Young showing that if [Formula: see text] is a Riemannian surface with connected boundary in [Formula: see text], such that the boundary curve is a standard unit circle, then the length of the shortest non-contractible loop in [Formula: see text] is bounded in terms of the area of [Formula: see text].

2009 ◽  
Vol 139 (6) ◽  
pp. 1327-1335
Author(s):  
Minoru Yamamoto

Let M be a compact connected oriented surface with exactly one boundary component. A pseudo-immersion of M into the plane is a smooth map such that it has only fold singularities and is an orientation-preserving immersion near the boundary of M. For a pseudo-immersion we study the relation between the winding number of the boundary curve and the number of the singular set components.


1967 ◽  
Vol 29 ◽  
pp. 221-228
Author(s):  
Yûsaku Komatu

Let be the class of analytic functions Ф(z) which are regular and of positive real part in the unit circle | z | <1 and normalized by Ф(0) = 1. Several distortion theorems have been obtained on various functionals in this class. In a previous paper [4] we have dealt with mean distortion which generalizes a classical theorem of Rogosinski [6].


1991 ◽  
Vol 34 (2) ◽  
pp. 186-195 ◽  
Author(s):  
Edward Dobrowolski

AbstractMahler's measure of a monic polynomial is equal to the product of modules of its roots which lie outside the unit circle. By classical theorem of Kronecker it is strictly greater than 1 for any polynomial that is not a product of cyclotomic factors. In this case a number of lower bounds of the measure, depending either on the degree of the polynomial or on the number of its non-zero coefficients, has been found. Here is given an improvement of the bound of the latter type previously found by the author, A. Schinzel and W. Lawton.


Author(s):  
V.N. Petrov ◽  
◽  
V.F. Sopin ◽  
L.A. Akhmetzyanova ◽  
Ya.S. Petrova ◽  
...  

Author(s):  
Brian Street

This book develops a new theory of multi-parameter singular integrals associated with Carnot–Carathéodory balls. The book first details the classical theory of Calderón–Zygmund singular integrals and applications to linear partial differential equations. It then outlines the theory of multi-parameter Carnot–Carathéodory geometry, where the main tool is a quantitative version of the classical theorem of Frobenius. The book then gives several examples of multi-parameter singular integrals arising naturally in various problems. The final chapter of the book develops a general theory of singular integrals that generalizes and unifies these examples. This is one of the first general theories of multi-parameter singular integrals that goes beyond the product theory of singular integrals and their analogs. This book will interest graduate students and researchers working in singular integrals and related fields.


10.37236/1734 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
David Arthur

An arc-representation of a graph is a function mapping each vertex in the graph to an arc on the unit circle in such a way that adjacent vertices are mapped to intersecting arcs. The width of such a representation is the maximum number of arcs passing through a single point. The arc-width of a graph is defined to be the minimum width over all of its arc-representations. We extend the work of Barát and Hajnal on this subject and develop a generalization we call restricted arc-width. Our main results revolve around using this to bound arc-width from below and to examine the effect of several graph operations on arc-width. In particular, we completely describe the effect of disjoint unions and wedge sums while providing tight bounds on the effect of cones.


Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1134
Author(s):  
Kenta Higuchi ◽  
Takashi Komatsu ◽  
Norio Konno ◽  
Hisashi Morioka ◽  
Etsuo Segawa

We consider the discrete-time quantum walk whose local dynamics is denoted by a common unitary matrix C at the perturbed region {0,1,⋯,M−1} and free at the other positions. We obtain the stationary state with a bounded initial state. The initial state is set so that the perturbed region receives the inflow ωn at time n(|ω|=1). From this expression, we compute the scattering on the surface of −1 and M and also compute the quantity how quantum walker accumulates in the perturbed region; namely, the energy of the quantum walk, in the long time limit. The frequency of the initial state of the influence to the energy is symmetric on the unit circle in the complex plain. We find a discontinuity of the energy with respect to the frequency of the inflow.


Energies ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 1488
Author(s):  
Damian Trofimowicz ◽  
Tomasz P. Stefański

In this paper, novel methods for the evaluation of digital-filter stability are investigated. The methods are based on phase analysis of a complex function in the characteristic equation of a digital filter. It allows for evaluating stability when a characteristic equation is not based on a polynomial. The operation of these methods relies on sampling the unit circle on the complex plane and extracting the phase quadrant of a function value for each sample. By calculating function-phase quadrants, regions in the immediate vicinity of unstable roots (i.e., zeros), called candidate regions, are determined. In these regions, both real and imaginary parts of complex-function values change signs. Then, the candidate regions are explored. When the sizes of the candidate regions are reduced below an assumed accuracy, then filter instability is verified with the use of discrete Cauchy’s argument principle. Three different algorithms of the unit-circle sampling are benchmarked, i.e., global complex roots and poles finding (GRPF) algorithm, multimodal genetic algorithm with phase analysis (MGA-WPA), and multimodal particle swarm optimization with phase analysis (MPSO-WPA). The algorithms are compared in four benchmarks for integer- and fractional-order digital filters and systems. Each algorithm demonstrates slightly different properties. GRPF is very fast and efficient; however, it requires an initial number of nodes large enough to detect all the roots. MPSO-WPA prevents missing roots due to the usage of stochastic space exploration by subsequent swarms. MGA-WPA converges very effectively by generating a small number of individuals and by limiting the final population size. The conducted research leads to the conclusion that stochastic methods such as MGA-WPA and MPSO-WPA are more likely to detect system instability, especially when they are run multiple times. If the computing time is not vitally important for a user, MPSO-WPA is the right choice, because it significantly prevents missing roots.


Sign in / Sign up

Export Citation Format

Share Document