scholarly journals A general class of iterative equations on the unit circle

2007 ◽  
Vol 57 (3) ◽  
pp. 809-829 ◽  
Author(s):  
Marek C. Zdun ◽  
Weinian Zhang
2010 ◽  
Vol 2010 ◽  
pp. 1-14
Author(s):  
Wei Song ◽  
Sheng Chen ◽  
Xunbo Yin

We discuss the strictly decreasing solutions of a class of iterative equations on the unit circleT1. The conditions for the existence, uniqueness, and stability of such solutions are presented.


1960 ◽  
Vol 16 ◽  
pp. 111-117
Author(s):  
D. A. Storvick

1. Introduction. M. A. Lavrentiev made use of a relative distance function to establish some important results concerning the correspondence between the frontiers under a conformal mapping of a simply connected domain onto the unit circle. The purpose of this note is to show that some of these results are valid for the boundary correspondences induced by the more general class of quasi-conformal mappings.


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.


1982 ◽  
Vol 10 (3) ◽  
pp. 90-98 ◽  
Author(s):  
Laxmi N. Bhuyan ◽  
Dharma P. Agrawal
Keyword(s):  

2021 ◽  
Vol 180 (1-2) ◽  
pp. 151-177
Author(s):  
Qichao Wang

Weighted restarting automata have been introduced to study quantitative aspects of computations of restarting automata. In earlier works we studied the classes of functions and relations that are computed by weighted restarting automata. Here we use them to define classes of formal languages by restricting the weight associated to a given input word through an additional requirement. In this way, weighted restarting automata can be used as language acceptors. First, we show that by using the notion of acceptance relative to the tropical semiring, we can avoid the use of auxiliary symbols. Furthermore, a certain type of word-weighted restarting automata turns out to be equivalent to non-forgetting restarting automata, and another class of languages accepted by word-weighted restarting automata is shown to be closed under the operation of intersection. This is the first result that shows that a class of languages defined in terms of a quite general class of restarting automata is closed under intersection. Finally, we prove that the restarting automata that are allowed to use auxiliary symbols in a rewrite step, and to keep on reading after performing a rewrite step can be simulated by regular-weighted restarting automata that cannot do this.


Author(s):  
Jennifer Duncan

AbstractThe Brascamp–Lieb inequalities are a very general class of classical multilinear inequalities, well-known examples of which being Hölder’s inequality, Young’s convolution inequality, and the Loomis–Whitney inequality. Conventionally, a Brascamp–Lieb inequality is defined as a multilinear Lebesgue bound on the product of the pullbacks of a collection of functions $$f_j\in L^{q_j}(\mathbb {R}^{n_j})$$ f j ∈ L q j ( R n j ) , for $$j=1,\ldots ,m$$ j = 1 , … , m , under some corresponding linear maps $$B_j$$ B j . This regime is now fairly well understood (Bennett et al. in Geom Funct Anal 17(5):1343–1415, 2008), and moving forward there has been interest in nonlinear generalisations, where $$B_j$$ B j is now taken to belong to some suitable class of nonlinear maps. While there has been great recent progress on the question of local nonlinear Brascamp–Lieb inequalities (Bennett et al. in Duke Math J 169(17):3291–3338, 2020), there has been relatively little regarding global results; this paper represents some progress along this line of enquiry. We prove a global nonlinear Brascamp–Lieb inequality for ‘quasialgebraic’ maps, a class that encompasses polynomial and rational maps, as a consequence of the multilinear Kakeya-type inequalities of Zhang and Zorin-Kranich. We incorporate a natural affine-invariant weight that both compensates for local degeneracies and yields a constant with minimal dependence on the underlying maps. We then show that this inequality generalises Young’s convolution inequality on algebraic groups with suboptimal constant.


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.


Sign in / Sign up

Export Citation Format

Share Document