10 resultados para Fibonacci combinatorics
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)
Resumo:
We study the growth of Df `` (f(c)) when f is a Fibonacci critical covering map of the circle with negative Schwarzian derivative, degree d >= 2 and critical point c of order l > 1. As an application we prove that f exhibits exponential decay of geometry if and only if l <= 2, and in this case it has an absolutely continuous invariant probability measure, although not satisfying the so-called Collet-Eckmann condition. (C) 2009 Elsevier Masson SAS. All rights reserved.
Resumo:
We consider the raise and peel model of a one-dimensional fluctuating interface in the presence of an attractive wall. The model can also describe a pair annihilation process in disordered unquenched media with a source at one end of the system. For the stationary states, several density profiles are studied using Monte Carlo simulations. We point out a deep connection between some profiles seen in the presence of the wall and in its absence. Our results are discussed in the context of conformal invariance ( c = 0 theory). We discover some unexpected values for the critical exponents, which are obtained using combinatorial methods. We have solved known ( Pascal`s hexagon) and new (split-hexagon) bilinear recurrence relations. The solutions of these equations are interesting in their own right since they give information on certain classes of alternating sign matrices.
Resumo:
We introduce the Fibonacci bimodal maps on the interval and show that their two turning points are both in the same minimal invariant Cantor set. Two of these maps with the same orientation have the same kneading sequences and, among bimodal maps without central returns, they exhibit turning points with the strongest recurrence as possible.
Resumo:
We extend the renormalization operator introduced in [A. de Carvalho, M. Martens and M. Lyubich. Renormalization in the Henon family, I: universality but non-rigidity. J. Stat. Phys. 121(5/6) (2005), 611-669] from period-doubling Henon-like maps to Henon-like maps with arbitrary stationary combinatorics. We show that the renonnalization picture also holds in this case if the maps are taken to be strongly dissipative. We study infinitely renormalizable maps F and show that they have an invariant Cantor set O on which F acts like a p-adic adding machine for some p > 1. We then show, as for the period-doubling case in the work of de Carvalho, Martens and Lyubich [Renormalization in the Henon family, I: universality but non-rigidity. J. Stat. Phys. 121(5/6) (2005), 611-669], that the sequence of renormalizations has a universal form, but that the invariant Cantor set O is non-rigid. We also show that O cannot possess a continuous invariant line field.
Resumo:
We report numerically and analytically estimated values for the Hurst exponent for a recently proposed non-Markovian walk characterized by amnestically induced persistence. These results are consistent with earlier studies showing that log-periodic oscillations arise only for large memory losses of the recent past. We also report numerical estimates of the Hurst exponent for non-Markovian walks with diluted memory. Finally, we study walks with a fractal memory of the past for a Thue-Morse and Fibonacci memory patterns. These results are interpreted and discussed in the context of the necessary and sufficient conditions for the central limit theorem to hold.
Resumo:
We study the spin-1/2 Ising model on a Bethe lattice in the mean-field limit, with the interaction constants following one of two deterministic aperiodic sequences, the Fibonacci or period-doubling one. New algorithms of sequence generation were implemented, which were fundamental in obtaining long sequences and, therefore, precise results. We calculate the exact critical temperature for both sequences, as well as the critical exponents beta, gamma, and delta. For the Fibonacci sequence, the exponents are classical, while for the period-doubling one they depend on the ratio between the two exchange constants. The usual relations between critical exponents are satisfied, within error bars, for the period-doubling sequence. Therefore, we show that mean-field-like procedures may lead to nonclassical critical exponents.
Resumo:
An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).
Resumo:
In this paper we determine the local and global resilience of random graphs G(n,p) (p >> n(-1)) with respect to the property of containing a cycle of length at least (1 - alpha)n. Roughly speaking, given alpha > 0, we determine the smallest r(g) (G, alpha) with the property that almost surely every subgraph of G = G(n,p) having more than r(g) (G, alpha)vertical bar E(G)vertical bar edges contains a cycle of length at least (1 - alpha)n (global resilience). We also obtain, for alpha < 1/2, the smallest r(l) (G, alpha) such that any H subset of G having deg(H) (v) larger than r(l) (G, alpha) deg(G) (v) for all v is an element of V(G) contains a cycle of length at least (1 - alpha)n (local resilience). The results above are in fact proved in the more general setting of pseudorandom graphs.
Resumo:
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k is an element of N, then every tree with at most k edges is a subgraph of G. We prove the conjecture for all trees of diameter at most 5 and for a class of caterpillars. Our result implies a bound on the Ramsey number r( T, T') of trees T, T' from the above classes.
Resumo:
The spectral properties and phase diagram of the exactly integrable spin-1 quantum chain introduced by Alcaraz and Bariev are presented. The model has a U(1) symmetry and its integrability is associated with an unknown R-matrix whose dependence on the spectral parameters is not of a different form. The associated Bethe ansatz equations that fix the eigenspectra are distinct from those associated with other known integrable spin models. The model has a free parameter t(p). We show that at the special point t(p) = 1, the model acquires an extra U(1) symmetry and reduces to the deformed SU(3) Perk-Schultz model at a special value of its anisotropy q = exp(i2 pi/3) and in the presence of an external magnetic field. Our analysis is carried out either by solving the associated Bethe ansatz equations or by direct diagonalization of the quantum Hamiltonian for small lattice sizes. The phase diagram is calculated by exploring the consequences of conformal invariance on the finite-size corrections of the Hamiltonian eigenspectrum. The model exhibits a critical phase ruled by the c = 1 conformal field theory separated from a massive phase by first-order phase transitions.