We investigate the number of periodic points of certain discrete quadratic maps modulo prime numbers. We do so by first exploring previously known results for two particular quadratic maps, after which we explain why the methods used in these two cases are hard to adapt to a more general case. We then perform experiments and find striking patterns in the behaviour of these general cases which suggest that, apart from the two special cases, the number of periodic points of all quadratic maps of this type behave the same. Finally we formulate a conjecture to this effect.

As input ows of secondary raw materials show high volatility and tend to behave in a chaotic way, the identification of the main drivers of the dynamic behavior of returns plays a crucial role. Based on a stylized productionrecycling system consisting of a set of nonlinear difference equations, we explicitly derive parameter constellations where the system will or will not converge to its equilibrium. Using a constant elasticity of substitution production function, the model is then extended to enable coverage of real world situations. Using waste paper as a reference raw material, we empirically estimate the parameters of the system. By using these regression results, we are able to show that the equilibrium solution is a Lyapunov unstable saddle point. This implies that the system is sensitive on initial conditions that will hence impede the predictability of product returns. Small variations of production input proportions could however stabilize the whole system. (authors' abstract)

abstract: Persistence theory provides a mathematically rigorous answer to the question of population survival by establishing an initial-condition- independent positive lower bound for the long-term value of the population size. This study focuses on the persistence of discrete semiflows in infinite-dimensional state spaces that model the year-to-year dynamics of structured populations. The map which encapsulates the population development from one year to the next is approximated at the origin (the extinction state) by a linear or homogeneous map. The (cone) spectral radius of this approximating map is the threshold between extinction and persistence. General persistence results are applied to three particular models: a size-structured plant population model, a diffusion model (with both Neumann and Dirichlet boundary conditions) for a dispersing population of males and females that only mate and reproduce once during a very short season, and a rank-structured model for a population of males and females. / Dissertation/Thesis / Ph.D. Mathematics 2014

No description available.

Large-eddy simulation is rapidly becoming the preferred method for calculations involving turbulent phenomena. However, filtering equations as performed in traditional LES procedures leads to significant problems. In this work we present some key components in the construction of a novel LES solver for compressible turbulent flow, designed to overcome most of the problems faced by traditional LES procedures. We describe the construction of the large-scale algorithm, which employs fairly standard numerical techniques to solve the Navier{Stokes equations. We validate the algorithm for both transonic and supersonic ow scenarios. We further explicitly show that the solver is capable of capturing boundary layer effects. We present a detailed derivation of the chaotic map termed the \compressible poor man's Navier{Stokes (CPMNS) equation" starting from the Navier{Stokes equations themselves via a Galerkin procedure, which we propose to use as the fluctuating component in the SGS model. We provide computational results to show that the chaotic map can produce a wide range of temporal behaviors when the bifurcation parameters are varied over their ranges of stable behaviors. Investigations of the overall dynamics of the CPMNS equation demonstrates that its use increases the potential realism of the corresponding SGS model.

We study planar systems of difference equations and applications to biological models of species populations. Central to the analysis of this study is the idea of folding - the method of transforming systems of difference equations into higher order scalar difference equations. Two classes of second order equations are studied: quadratic fractional and exponential. We investigate the boundedness and persistence of solutions, the global stability of the positive fixed point and the occurrence of periodic solutions of the quadratic rational equations. These results are applied to a class of linear/rational systems that can be transformed into a quadratic fractional equation via folding. These results apply to systems with negative parameters, instances not commonly considered in previous studies. We also identify ranges of parameter values that provide sufficient conditions on existence of chaotic and multiple stable orbits of different periods for the planar system. We study a second order exponential difference equation with time varying parameters and obtain sufficient conditions for boundedness of solutions and global convergence to zero. For the autonomous case, we show occurrence of multistable periodic and nonperiodic orbits. For the case where parameters are periodic, we show that the nature of the solutions differs qualitatively depending on whether the period of the parameters is even or odd. The above results are applied to biological models of populations. We investigate a broad class of planar systems that arise in the study of stage-structured single species populations. In biological contexts, these results include conditions on extinction or survival of the species in some balanced form, and possible occurrence of complex and chaotic behavior. Special rational (Beverton-Holt) and exponential (Ricker) cases are considered to explore the role of inter-stage competition, restocking strategies, as well as seasonal fluctuations in the vital rates.

Made available in DSpace on 2014-06-11T19:26:56Z (GMT). No. of bitstreams: 0 Previous issue date: 2001-12-11Bitstream added on 2014-06-13T20:47:37Z : No. of bitstreams: 1 pereira_wf_me_sjrp.pdf: 614166 bytes, checksum: 6df9d771c65c6fa8d098e4e0aba88fb5 (MD5) / Neste trabalho estudamos os sistemas dinâmicos caóticos através da definição apresentada por Devaney, composta basicamente de três condições. Investigamos todas as implicações possíveis entre essas condições. Por fim, analisamos o estudo apresentando uma definição mais sucinta e provamos a sua equivalência com a apresentada por Devaney. / In this work we study the chaotic dynamic systems through the definition presented by Devaney, basically composed of three conditions. We investigate all the possible implications among these conditions. Finally, we finish the study presenting briefer definition and prove its equivalence to the one presented by Devaney.

Orientador: Adalberto Spezamiglio / Banca: Heloísa Helena Marino Silva / Banca: Luiz Augusto da Costa Ladeira / Resumo: Neste trabalho estudamos os sistemas dinâmicos caóticos através da definição apresentada por Devaney, composta basicamente de três condições. Investigamos todas as implicações possíveis entre essas condições. Por fim, analisamos o estudo apresentando uma definição mais sucinta e provamos a sua equivalência com a apresentada por Devaney. / Abstract: In this work we study the chaotic dynamic systems through the definition presented by Devaney, basically composed of three conditions. We investigate all the possible implications among these conditions. Finally, we finish the study presenting briefer definition and prove its equivalence to the one presented by Devaney. / Mestre

No description available.

In this thesis we study discrete dynamical system, given by a polynomial, over both finite extension of the fields of p-adic numbers and over finite fields. Especially in the p-adic case, we study fixed points of dynamical systems, and which elements that are attracted to them. We show with different examples how complex these dynamics are. For certain polynomial dynamical systems over finite fields we prove that the normalized average of the numbers of linear factors modulo prime numbers exists. We also show how to calculate the average, by using Chebotarev's Density Theorem. The non-normalized version of the average of the number of linear factors of linearized polynomials modulo prime numbers, tends to infinity, so in that case we find an asymptotic formula instead. We have also used a computer to study different behaviors, such as iterations of polynomials over the p-adic fields and the asymptotic relation mention above. In the last chapter we present the computer programs used in different part of the thesis.