7 resultados para POLYNOMIAL CHAOS
em Universidade Complutense de Madrid
Resumo:
Temperature chaos has often been reported in the literature as a rare-event–driven phenomenon. However, this fact has always been ignored in the data analysis, thus erasing the signal of the chaotic behavior (still rare in the sizes achieved) and leading to an overall picture of a weak and gradual phenomenon. On the contrary, our analysis relies on a largedeviations functional that allows to discuss the size dependences. In addition, we had at our disposal unprecedentedly large configurations equilibrated at low temperatures, thanks to the Janus computer. According to our results, when temperature chaos occurs its effects are strong and can be felt even at short distances.
Resumo:
In recent years, the topic of car-following has experimented an increased importance in traffic engineering and safety research. This has become a very interesting topic because of the development of driverless cars (Google driverless cars, http://en.wikipedia.org/wiki/Google_driverless_car). Driving models which describe the interaction between adjacent vehicles in the same lane have a big interest in simulation modeling, such as the Quick-Thinking-Driver model. A non-linear version of it can be given using the logistic map, and then chaos appears. We show that an infinite-dimensional version of the linear model presents a chaotic behaviour using the same approach as for studying chaos of death models of cell growth.
Resumo:
We compute the E-polynomial of the character variety of representations of a rank r free group in SL(3,C). Expanding upon techniques of Logares, Muñoz and Newstead (Rev. Mat. Complut. 26:2 (2013), 635-703), we stratify the space of representations and compute the E-polynomial of each geometrically described stratum using fibrations. Consequently, we also determine the E-polynomial of its smooth, singular, and abelian loci and the corresponding Euler characteristic in each case. Along the way, we give a new proof of results of Cavazos and Lawton (Int. J. Math. 25:6 (2014), 1450058).
Resumo:
Efficient hardware implementations of arithmetic operations in the Galois field are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2(m)) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.
Resumo:
We study nonequilibrium processes in an isolated quantum system-the Dicke model-focusing on the role played by the transition from integrability to chaos and the presence of excited-state quantum phase transitions. We show that both diagonal and entanglement entropies are abruptly increased by the onset of chaos. Also, this increase ends in both cases just after the system crosses the critical energy of the excited-state quantum phase transition. The link between entropy production, the development of chaos, and the excited-state quantum phase transition is more clear for the entanglement entropy.
Resumo:
In this paper, equivalence constants between various polynomial norms are calculated. As an application, we also obtain sharp values of the Hardy Littlewood constants for 2-homogeneous polynomials on l(p)(2) spaces, 2 < p <= infinity. We also provide lower estimates for the Hardy-Littlewood constants for polynomials of higher degrees.
Resumo:
We compute the E-polynomials of the moduli spaces of representations of the fundamental group of a complex curve of genus g = 3 into SL(2, C), and also of the moduli space of twisted representations. The case of genus g = 1, 2 has already been done in [12]. We follow the geometric technique introduced in [12], based on stratifying the space of representations, and on the analysis of the behaviour of the E-polynomial under fibrations.