Displaying similar documents to “Markov inequality on a certain compact subset of ℝ 2 .”

On the core property of the cylinder functions class in the construction of interacting particle systems

Anja Voss-Böhme (2011)

Kybernetika

Similarity:

For general interacting particle systems in the sense of Liggett, it is proven that the class of cylinder functions forms a core for the associated Markov generator. It is argued that this result cannot be concluded by straightforwardly generalizing the standard proof technique that is applied when constructing interacting particle systems from their Markov pregenerators.

Heights of roots of polynomials with odd coefficients

J. Garza, M. I. M. Ishak, M. J. Mossinghoff, C. G. Pinner, B. Wiles (2010)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let α be a zero of a polynomial of degree n with odd coefficients, with α not a root of unity. We show that the height of α satisfies h ( α ) ≥ 0 . 4278 n + 1 . More generally, we obtain bounds when the coefficients are all congruent to 1 modulo m for some m ≥ 2 .

The first exit of almost strongly recurrent semi-Markov processes

Joachim Domsta, Franciszek Grabski (1995)

Applicationes Mathematicae

Similarity:

Let ( · ) , n ∈ N, be a sequence of homogeneous semi-Markov processes (HSMP) on a countable set K, all with the same initial p.d. concentrated on a non-empty proper subset J. The subrenewal kernels which are restrictions of the corresponding renewal kernels on K×K to J×J are assumed to be suitably convergent to a renewal kernel P (on J×J). The HSMP on J corresponding to P is assumed to be strongly recurrent. Let [ π j ; j ∈ J] be the stationary p.d. of the embedded Markov chain. In terms of...

Robust mixing.

Ganapathy, Murali (2007)

Electronic Journal of Probability [electronic only]

Similarity:

Extensions of the Bloch–Pólya theorem on the number of real zeros of polynomials

Tamás Erdélyi (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We prove that there are absolute constants c 1 > 0 and c 2 > 0 such that for every { a 0 , a 1 , ... , a n } ⊂ [ 1 , M ] , 1 ≤ M ≤ exp ( c 1 n 1 / 4 ) , there are b 0 , b 1 , ... , b n ∈ { - 1 , 0 , 1 } such that P ( z ) = ∑ j = 0 n b j a j z j has at least c 2 n 1 / 4 distinct sign changes in ( 0 , 1 ) . This improves and extends earlier results of Bloch and Pólya.