๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A lower bound on the critical friction coefficient for periodic forces

โœ Scribed by M.J. Renne; C.G. van Walraven

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
489 KB
Volume
54
Category
Article
ISSN
0167-2789

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Lower Bounds of T-Periodic Solutions
The Lower Bounds of T-Periodic Solutions for the Forced Duffing Equation
โœ Chengwen Wang ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 98 KB

This paper is devoted to the discussion of the number of T -periodic solutions for the forced Duffing equation, x + kx + g t x = s 1 + h t , with g t x being a continuous function by using the degree theory, upper and lower solutions method, and the twisting theorem.

A new lower bound for the critical proba
A new lower bound for the critical probability of site percolation on the square lattice
โœ J. van den Berg; A. Ermakov ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 705 KB

The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Toth [13]), 0.522 (Zuev [15]), and the best lower bound so far,

A superlinear lower bound for the size o
A superlinear lower bound for the size of a critical set in a latin square
โœ Nicholas J. Cavenagh ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 157 KB ๐Ÿ‘ 1 views

## Abstract A critical set is a partial latin square that has a unique completion to a latin square, and is minimal with respect to this property. Let __scs__(__n__) denote the smallest possible size of a critical set in a latin square of order __n__. We show that for all __n__, $scs(n)\geq n\lfloo