L'ubomíra Balková, Zuzana Masáková (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
We study the palindromic complexity of infinite words , the fixed points of the substitution over a binary alphabet, , , with , which are canonically associated with quadratic non-simple Parry numbers .
Andrew Lorent (2014)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
In this note we show the characteristic function of every indecomposable set in the plane is equivalent to the characteristic function a closed set See Formula in PDF See Formula in PDF . We show by example this is false in dimension three and above. As a corollary to this result we show that for every > 0 a set of finite perimeter can be approximated by a closed subset See Formula in PDF See Formula in PDF with finitely many indecomposable components and with the property that...
Denis Belomestny (2010)
ESAIM: Probability and Statistics
Similarity:
Let () be independent identically distributed bivariate vectors and , are two linear forms with positive coefficients. We study two problems: under what conditions does the equidistribution of and imply the same property for and , and under what conditions does the independence of and entail independence of and ? Some analytical sufficient conditions...
Stefan Krömer (2012)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
We study integral functionals constrained to divergence-free vector fields in on a thin domain, under standard -growth and coercivity assumptions, 1 ∞. We prove that as the thickness of the domain goes to zero, the Gamma-limit with respect to weak convergence in is always given by the associated functional with convexified energy density wherever it is finite. Remarkably, this happens despite the fact that relaxation of nonconvex functionals subject...
Z. Masáková, T. Vávra (2014)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We consider numeration systems with base and − , for quadratic Pisot numbers and focus on comparing the combinatorial structure of the sets Z and Z of numbers with integer expansion in base , resp. − . Our main result is the comparison of languages of infinite words and coding the ordering of distances between consecutive - and (− )-integers. It turns out that for a class of roots of − − , the languages coincide, while for other...
Stefan Krömer (2012)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
We study integral functionals constrained to divergence-free vector fields in on a thin domain, under standard -growth and coercivity assumptions, 1 ∞. We prove that as the thickness of the domain goes to zero, the Gamma-limit with respect to weak convergence in is always given by the associated functional with convexified energy density wherever it is finite. Remarkably, this happens despite the fact that relaxation of nonconvex functionals subject...
Rémi Rhodes, Vincent Vargas (2011)
ESAIM: Probability and Statistics
Similarity:
We consider the continuous model of log-infinitely divisible multifractal random measures (MRM) introduced in [E. Bacry et al. 236 (2003) 449–475]. If is a non degenerate multifractal measure with associated metric () = ([]) and structure function ζ, we show that we have the following relation between the (Euclidian) Hausdorff dimension dim of a measurable set and the Hausdorff dimension dim with respect to of the same set: ζ(dim ()) = dim(). Our results...
William Pasillas-Lépine, Witold Respondek (2010)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
A Goursat structure on a manifold of dimension is a rank two distribution such that dim = + 2, for 0 ≤ ≤ -2, where denote the elements of the derived flag of , defined by = and = + [ , ] . Goursat structures appeared first in the work of von Weber and Cartan, who have shown that on an open and dense subset they can be converted into the so-called Goursat normal form....
Andrzej Filinski, Henning Korsholm Rohde (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We show that the standard normalization-by-evaluation construction for the simply-typed -calculus has a natural counterpart for the untyped -calculus, with the central type-indexed logical relation replaced by a “recursively defined” , in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal forms,...