AbstractObjective This study evaluated a standardized and personalized approach to verify the effects of conditions on intrarater interrater reliability, standard error measurement, minimal detectable difference for provocative tests range-of-motion (ROM) used in hip pain assessment: flexion-adduction-internal rotation (FADIR), flexion-abduction-external rotation-extension (FA...

In this paper we prove a Faber-Krahn-type inequality for regular trees and give a complete characterization of extremal trees. The main tools are rearrangements and perturbation of regular trees. 1. Introduction In the last years some results for the Laplacian on manifolds have been shown to hold also for the graph Laplacian, e.g. Courant's nodal domain theorem ((dV93, Fri93]) or Cheeger's ineq...

A short recurrence for orthogonalizing Krylov subspace bases for a matrix A exists if and only if the adjoint of A is a low degree polynomial in A (i.e. A is normal of low degree). In the area of iterative methods, this result is known as the Faber-Manteuffel Theorem (V. Faber and T. Manteuffel, SIAM J. Numer. Anal., 21 (1984), pp. 352–362). Motivated by the description in (J. Liesen and Z. Str...

We introduce a new method to prove the isoperimetric property of the ball for the first eigenvalue of the Robin-Laplacian. Our technique applies to a full range of Faber-Krahn inequalities in a nonlinear setting and for non smooth domains, including the open case of the torsional rigidity. The analysis is based on regularity issues for free discontinuity problems in spaces of functions of bound...

Zusammenfassung Seit ihrem Erscheinen haben Max Frischs Romane Stiller (1954), Homo faber (1957) und Mein Name sei Gantenbein (1964) nicht allein beim Lesepublikum, sondern auch in Literaturkritik Literaturwissenschaft anhaltend großes Interesse gefunden. Das Augenmerk der kritischen philologischen Auseinandersetzung mit den Romanen hat von Beginn an zuletzt ihrer besonderen narrativen Gestaltu...

Motivated by an old problem known as Ryser’s Conjecture, we prove that for r = 4 and r = 5, there exists > 0 such that every r-partite r-uniform hypergraph H has a cover of size at most (r − )ν(H), where ν(H) denotes the size of a largest matching in H.

in this paper we establish several polynomials similar to bernstein's polynomials and several refinements of  hermite-hadamard inequality for convex functions.