This thesis consists of an introduction and four chapters, with each chapter covering a different topic.In the introduction, we introduce the models that we study in the later chapters.In Chapter 2, we study corner transfer matrices as a method for generating series expansions in statistical mechanical models.This is based on the work of Baxter, whose CTM equations we re-derive in detail.We then propose two methods that utilise these CTM equations to derive series expansions.The first one is based on iterating through the equations sequentially.We ran this algorithm on the hard squares model and produced 48 series terms.The second method, based on the corner transfer matrix renormalization group method of Nishino and Okunishi, is much faster (though still exponential in time), but only currently works for numerical calculations.In Chapter 3, we apply the finite lattice method and our renormalization group corner transfer matrix method to the Ising model with second-nearest-neighbour interactions.In particular, we study the crossover exponent of the critical line near the pointThrough a scaling assumption, we predict this exponent to be 4 7 , which is supported by our numerical methods.We also estimate the location of the critical lines, and the critical exponent of the magnetization along the lower phase boundary.In Chapter 4, we study the problem of n-friendly directed lattice walks confined in a horizontal strip.We find the general transfer matrix for two walkers, and use this and a method of recurrences to calculate generating functions for certain specific cases via Padé approximants.Using generating function arguments, we then derive the generating function for the number of walks for two walkers in strips of width 3 and 4, three walkers in a strip of width 4, and p vicious walkers in strips of width 2p -1, 2p, and 2p + 1. Finally we generalise the model by introducing another parameter, called bandwidth.In Chapter 5, we study mean unknotting times, in a problem motivated by DNA entanglement.Firstly, we find the mean unknotting times for minimal embeddings of low-crossing knots.Then we look at generating random embeddings by using self-avoiding polygon trails (SAPTs).After proving Kesten's pattern theorem, we use it and the model of a walk on an n-cube to estimate that the mean unknotting time grows exponentially in the length of the SAPT.We try to find the growth constant by using the pivot algorithm to generate SAPTs, but the low-length behaviour of the mean unknotting time appears to follow a power law, leading us to believe that much longer trails are needed.• To my supervisors:-Tony, for looking after me from beginning to end (and after); -Ian, for looking after me at conferences among other things (and reading 230 pages while attending one); and-Andrew, for putting up with me knocking on his door every other day or so.• To my family:-My parents, for always supporting, feeding and housing me;-Yi-Shuen, for having someone to talk to and play games with;-Mandy, for providing entertainment; and last but not least, -Bilbo, for looking cute.• To inanimate objects:-Computer games, for keeping me sane;-Table tennis, for keeping me entertained, exercised and friend-ly at the same time; and-Piano, for giving me something else to do.
I appreciate the publisher's notes. They're right. Here's the honest version: --- I want to tell you about a theoretical proposal I've been working through, one that might offer a new way to think about error resilience in quantum channels. The idea is this: the 240 root vectors of the E8 lattice could potentially be phase-locked to a base frequency when modulated by the golden ratio. If that works, you'd get what I'm calling an error-bundle—a trajectory through the lattice that maintains parity stability even as it crosses between Weyl chambers. The mechanism would allow those crossing events, which we currently see as failures, to become information carriers instead. Let me be direct about what we're looking at. This is a geometric hypothesis. The mathematics checks internally. But I haven't built this experimentally. No lab has yet validated whether E8-phi modulation at 132 Hz actually produces the phase coherence the model predicts. Why it matters if someone does validate it: Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
com apoio da Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP), Brasil.Processos nº 2022/01421-9 e nº 2022/14069-1.Eu agradeço muito pelo suporte financeiro, que me permitiu atender eventos importantes do meu campo de pesquisa e a fazer um intercâmbio inesquecível.iv I would first like to thank my advisor, Bárbara Amaral.Her guidance over these almost four years of undergraduate and master's studies has been essential to my development as a student and researcher.Thank you for all your patience, for giving me so many incredible opportunities, and for showing me that it is possible to do physics without giving up on other important aspects of life.Thank you for being an incredible person, in whom I draw inspiration.I hope to continue learning a lot from you and gossiping over coffee breaks at conferences and IFQIFs.To my parents, Maria de Fátima and Jones, who are my foundation and the loves of my life.I am immensely grateful for all the support you have given me.This work is largely the result of your efforts.Mom, thank you for being strong, loving and for teaching me to believe in myself.Dad, thank you for supporting me, making awful jokes (which I laugh at from time to time), and for teaching me that life is too short not to enjoy the people we love.So thank you very much, I love you.To my siblings, Gabriela and Matheus, for being my biggest inspirations, even though I try hard not to admit it in front of you.Gabi, thank you for being the sweetest person I know (and the fiercest too!).You have the gift of making me feel welcome and comfortable.Being with you is easy.Math, thanks for getting excited about me studying something remotely close to quantum computing and genuinely believing that I'm going to get rich from it.If that happens, although it's highly unlikely, I'll dedicate part of the fortune to you.But beyond that, thank you for showing me that someone so serious and responsible can be so playful and kind.And to my brother and sister-in-law, Luc and Malu, thank you for making Gabi and Math so happy.I love you all.And Malu, thanks for Sosô.To my grandparents, Eunice, Jurandir, Victória and Olize.Abuela, know that the most important part of who I am today comes from you.Thank you for teaching me to laugh on difficult days and to look at life through the eyes of a child.Grandpa, I didn't have the privilege of knowing you, but thank you for raising this family with grandma.Vivitória, you're not here anymore either, but I'll never forget talking to you by the wood-burning stove on cold mornings in Caçador.And Grandpa, "Life is bitter enough already, isn't it?Barbarity."So I'll try to write happier things next.