Displaying similar documents to “Integers with a maximal number of Fibonacci representations”

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...

Integers in number systems with positive and negative quadratic Pisot base

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...

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⌈...

Complexity of infinite words associated with beta-expansions

Christiane Frougny, Zuzana Masáková, Edita Pelantová (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We study the complexity of the infinite word associated with the Rényi expansion of in an irrational base . When is the golden ratio, this is the well known Fibonacci word, which is Sturmian, and of complexity . For such that is finite we provide a simple description of the structure of special factors of the word . When =1 we show that . In the cases when or max} we show that the first difference of the complexity function takes value in for every , and consequently we determine...

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...

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 = ∑    ...

On the product of balanced sequences

Antonio Restivo, Giovanna Rosone (2012)

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

Similarity:

The product  =  ⊗  of two sequences and is a naturally defined sequence on the alphabet of pairs of symbols. Here, we study when the product of two balanced sequences is balanced too. In the case and are binary sequences, we prove, as a main result, that, if such a product is balanced and () = 4, then is an ultimately periodic sequence of a very special form. The case of arbitrary alphabets is approached in the last section. The partial results obtained and the problems proposed...

On the distribution of characteristic parameters of words

Arturo Carpi, Aldo de Luca (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

For any finite word on a finite alphabet, we consider the basic parameters and of defined as follows: is the minimal natural number for which has no right special factor of length and is the minimal natural number for which has no repeated suffix of length . In this paper we study the distributions of these parameters, here called characteristic parameters, among the words ...