Search results for "Regular polygon"

An efficient upper bound of the rotation distance of binary trees

2000

A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.

Further monotonicity and convexity properties of the zeros of cylinder functions

1992

AbstractLet cvk be the kth positive zero of the cylinder function Cv(x,α)=Jv(x) cos α−Yv sin α, 0⩽α<π, where Jv(x) and Yv(x) are the Bessel functions of the first and the second kind, respectively. We prove that the function v(d2cvkddv2+δ)cvk increases with v⩾0 for suitable values of δ and k−απ⩾ 0.7070… . From this result under the same conditions we deduce, among other things, that cvk+12δv2 is convex as a function of v⩾0. Moreover, we show some monotonicity properties of the function c2vkv. Our results improve known results.

Model approximation for two-dimensional Markovian jump systems with state-delays and imperfect mode information

2014

Published version of an article in the journal: Multidimensional Systems and Signal Processing. Also available from the publisher at: http://dx.doi.org/10.1007/s11045-013-0276-x This paper is concerned with the problem of {Mathematical expression} model approximation for a class of two-dimensional (2-D) discrete-time Markovian jump linear systems with state-delays and imperfect mode information. The 2-D system is described by the well-known Fornasini-Marchesini local state-space model, and the imperfect mode information in the Markov chain simultaneously involves the exactly known, partially unknown and uncertain transition probabilities. By using the characteristics of the transition proba…

Classification and non-existence results for weak solutions to quasilinear elliptic equations with Neumann or Robin boundary conditions

2021

Abstract We classify positive solutions to a class of quasilinear equations with Neumann or Robin boundary conditions in convex domains. Our main tool is an integral formula involving the trace of some relevant quantities for the problem. Under a suitable condition on the nonlinearity, a relevant consequence of our results is that we can extend to weak solutions a celebrated result obtained for stable solutions by Casten and Holland and by Matano.

The simplex dispersion ordering and its application to the evaluation of human corneal endothelia

2009

A multivariate dispersion ordering based on random simplices is proposed in this paper. Given a R^d-valued random vector, we consider two random simplices determined by the convex hulls of two independent random samples of sizes d+1 of the vector. By means of the stochastic comparison of the Hausdorff distances between such simplices, a multivariate dispersion ordering is introduced. Main properties of the new ordering are studied. Relationships with other dispersion orderings are considered, placing emphasis on the univariate version. Some statistical tests for the new order are proposed. An application of such ordering to the clinical evaluation of human corneal endothelia is provided. Di…

A reconstruction algorithm for L-convex polyominoes

2006

AbstractWe give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.

k-Weakly almost convex groups and ? 1 ? $$\tilde M^3 $$

1993

We extend Cannon's notion ofk-almost convex groups which requires that for two pointsx, y on then-sphere in the Cayley graph which can be joined by a pathl1 of length ≤k, there is a second pathl2 in then-ball, joiningx andy, of bounded length ≤N(k). Ourk-weakly almost convexity relaxes this condition by requiring only thatl1 ∝l2 bounds a disk of area ≤C1(k)n1 - e(k) +C2(k). IfM3 is a closed 3-manifold with 3-weakly almost convex fundamental group, then π1∞\(\tilde M^3 = 0\).

On Fine and Wilf's theorem for bidimensional words

2003

AbstractGeneralizations of Fine and Wilf's Periodicity Theorem are obtained for the case of bidimensional words using geometric arguments. The domains considered constitute a large class of convex subsets of R2 which include most parallelograms. A complete discussion is provided for the parallelogram case.

Uniform properties of collections of convex bodies

1991

Locally Convex Quasi C*-Algebras and Their Structure

2020

Throughout this chapter \({{\mathfrak A}}_{\scriptscriptstyle 0}[\| \cdot \|{ }_{\scriptscriptstyle 0}]\) denotes a unital C*-algebra and τ a locally convex topology on \({{\mathfrak A}}_{\scriptscriptstyle 0}\). Let \(\widetilde {{{\mathfrak A}}_{\scriptscriptstyle 0}}[\tau ]\) denote the completion of \({{\mathfrak A}}_{\scriptscriptstyle 0}\) with respect to the topology τ. Under certain conditions on τ, a subspace \({\mathfrak A}\) of \(\widetilde {{{\mathfrak A}}_{\scriptscriptstyle 0}}[\tau ]\), containing \({{\mathfrak A}}_{\scriptscriptstyle 0}\), will form (together with \({{\mathfrak A}}_{\scriptscriptstyle 0}\)) a locally convex quasi *-algebra \(({\mathfrak A}[\tau ],{{\mathfrak…