Displaying similar documents to “Critical Dimensions for counting Lattice Points in Euclidean Annuli”

Transition de dépiégeage élastique de vortex supraconducteurs

Enrick Olive, Nicolas Di Scala, Yves Lansac, Yaouen Fily, Jean-Claude Soret (2012)

ESAIM: Proceedings

Similarity:

We present 2D numerical simulation results of superconductor vortex lattices driven over a random disorder. The vortex dynamics at the depinning threshold is studied at zero temperature in the case of weak disorder. The dynamics is elastic and the depinning transition is analysed in the framework of a second order phase transition where the velocity response to the driving force behaves like  ~ ( −  ...

Substitution systems associated with the dynamical system (𝒜, )

Maria de Fátima Correia, Carlos Ramos, Sandra Vinagre (2012)

ESAIM: Proceedings

Similarity:

We consider the dynamical system (𝒜, ), where 𝒜 is a class of differential real functions defined on some interval and : 𝒜 → 𝒜 is an operator := , where is a differentiable -modal map. If we consider functions in 𝒜 whose critical values are periodic points for then, we show how to define and characterize a substitution system associated with (𝒜, ...

On the invariant measure of the random difference equation Xn = AnXn−1 + Bn in the critical case

Sara Brofferio, Dariusz Buraczewski, Ewa Damek (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We consider the autoregressive model on ℝ defined by the stochastic recursion = −1 + , where {( , )} are i.i.d. random variables valued in ℝ× ℝ+. The critical case, when 𝔼 [ log A 1 ] = 0 , was studied by Babillot, Bougerol and Elie, who proved that there exists a unique invariant Radon measure for the Markov chain { }. In the present paper we prove that the weak limit of properly...

Hereditary properties of words

József Balogh, Béla Bollobás (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Let be a hereditary property of words, , an infinite class of finite words such that every subword (block) of a word belonging to is also in . Extending the classical Morse-Hedlund theorem, we show that either contains at least words of length for every  or, for some , it contains at most words of length for every . More importantly, we prove the following quantitative extension of this result: if has words of length then, for every , it contains at most ⌈( + 1)/2⌉⌈( + 1)/2⌈...

Plug-in estimation of level sets in a non-compact setting with applications in multivariate risk theory

Elena Di Bernardino, Thomas Laloë, Véronique Maume-Deschamps, Clémentine Prieur (2013)

ESAIM: Probability and Statistics

Similarity:

This paper deals with the problem of estimating the level sets () =  {() ≥ }, with  ∈ (0,1), of an unknown distribution function on ℝ . A plug-in approach is followed. That is, given a consistent estimator of , we estimate () by () =  { () ≥ }. In our setting, non-compactness property is required for the level sets to estimate. We state consistency results with respect to the Hausdorff distance and the volume of the symmetric...

Pointwise constrained radially increasing minimizers in the quasi-scalar calculus of variations

Luís Balsa Bicho, António Ornelas (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove of vector minimizers () =  (||) to multiple integrals ∫ ((), |()|)  on a  ⊂ ℝ, among the Sobolev functions (·) in + (, ℝ), using a  : ℝ×ℝ → [0,∞] with (·) and . Besides such basic hypotheses, (·,·) is assumed to satisfy also...

Upper large deviations for maximal flows through a tilted cylinder

Marie Theret (2014)

ESAIM: Probability and Statistics

Similarity:

We consider the standard first passage percolation model in ℤ for  ≥ 2 and we study the maximal flow from the upper half part to the lower half part (respectively from the top to the bottom) of a cylinder whose basis is a hyperrectangle of sidelength proportional to and whose height is () for a certain height function . We denote this maximal flow by (respectively ). We emphasize the fact that the cylinder may be tilted. We look at the probability that...

Undecidability of infinite post correspondence problem for instances of size 8

Jing Dong, Qinghui Liu (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

The infinite Post Correspondence Problem (PCP) was shown to be undecidable by Ruohonen (1985) in general. Blondel and Canterini [36 (2003) 231–245] showed that PCP is undecidable for domain alphabets of size 105, Halava and Harju [40 (2006) 551–557] showed that PCP is undecidable for domain alphabets of size 9. By designing a special coding, we delete a letter from Halava and Harju’s construction. So we prove that PCP is undecidable for domain alphabets of size 8.

Some results on complexity of μ-calculus evaluation in the black-box model

Paweł Parys (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We consider -calculus formulas in a normal form: after a prefix of fixed-point quantifiers follows a quantifier-free expression. We are interested in the problem of evaluating (model checking) such formulas in a powerset lattice. We assume that the quantifier-free part of the expression can be any monotone function given by a black-box – we may only ask for its value for given arguments. As a first result we prove that when the lattice is fixed, the problem becomes polynomial (the assumption...

Hydrodynamic limit of a d-dimensional exclusion process with conductances

Fábio Júlio Valentim (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Fix a polynomial of the form () = + ∑2≤≤    =1 with (1) gt; 0. We prove that the evolution, on the diffusive scale, of the empirical density of exclusion processes on 𝕋 d , with conductances given by special class of functions, is described by the unique weak solution of the non-linear parabolic partial differential equation = ∑    ...