Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 19 of 19 for “"analytic combinatorics"”.
-
Analytic Combinatorics Applied to RNA Structures
In recent years it has been shown that the folding pattern of an RNA molecule plays an important role in its function, likened to a lock and key system. γ-structures are a subset of RNA pseudoknot structures filtered by topological genus that lend themselves nicely to combinatorial analysis. …
-
Algorithms for Analytic Combinatorics in Several Variables
… In this thesis we apply the theory of analytic combinatorics in several variables (ACSV) to this problem and build algorithms which seek to compute asymptotic formulas automatically, and to aid in understanding of the theory. Under certain assumptions on a given rational multivariate …
-
Geometry Of Gradient Flows For Analytic Combinatorics
Analytic combinatorics in several variables (ACSV) analyzes the asymptotic growth of generating function coefficients in a direction r. It uses Morse theory on the pole variety V := {H = 0} ⊆ (C∗)d to deform the torus T in the multivariate Cauchy Integral Formula via the downward gradient flow for …
-
Applied topology through the lens of Analytic Combinatorics
Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2025-05-01
-
Algorithms for Analytic Combinatorics: Positivity Bounds and D-finite Operators
Analytic combinatorics is concerned with describing limiting behavior of families of combinatorial structures. While this is well-studied in the univariate case, the last two decades have seen the development of analytic combinatorics in several variables (ACSV) treating the same problem in the …
-
Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration
The field of analytic combinatorics, which studies the asymptotic behaviour of sequences through analytic properties of their generating functions, has led to the development of deep and powerful tools with applications across mathematics and the natural sciences. In addition to the now classical …
-
Non-Generic Analytic Combinatorics in Several Variables and Lattice Path Asymptotics
… there is a rich theory treating them as complex-analytic functions. This is the field of analytic combinatorics, which exploits classical results in complex and harmonic analysis to find asymptotics of coefficient sequences of generating functions. More recently, the field of analytic …
-
Integer Compositions, Gray Code, and the Fibonacci Sequence
… and the Fibonacci sequence through the use of analytic combinatorics, Zeckendorf's Theorem, and generating functions.</p>
-
Multivariate Limit Theorems and Algebraic Generating Functions
The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate generating functions, over the last two decades a theory of …
-
Software for Combinatorial Power Series
… have applications throughout enumerative and analytic combinatorics. In this thesis we present Genfunlib, a new Mathematica package containing a selection of implementations of symbolic methods related to generating functions. With Genfunlib one can find the generating functions for regular …
-
Counting Flimsy Numbers via Formal Language Theory
… Using the tools of context-free languages and analytic combinatorics, we use this automaton to determine precise asymptotics for the number of k-flimsy N-digit numbers in base b. Lastly, using the results we obtained, we discuss the natural densities of k-flimsy numbers in base b for all values …
-
Growth of Conjugacy Classes of Reciprocal Words in Triangle Groups
… the order 2 cone point on O. We use methods from analytic combinatorics to count these words and to analyze the asymptotic behavior of their conjugacy classes with respect to the word length in the group for chosen generators of minimal length in G. We specifically use recurrence relations, and …
-
Coefficient Asymptotics of Multivariable Algebraic Power Series and Rational Power Series With Pseudo Multiple Points
Analytic combinatorics in several variables (ACSV) generalizes the coefficient extraction of generating functions in one variable to several variables. Current developments in ACSV mostly concern rational or meromorphic generating functions by first representing coefficients via the multivariate …
-
Returning walks on groups with tree-like Schreier graphs
… of the group. We then apply the methods of analytic combinatorics by translating the problem of enumerating walks into functional equations for generating functions. Using complex analytic techniques like singularity analysis, asymptotic formulas for the number of closed walks of length n …
-
Probabilistic techniques for analyzing sampling algorithms and the dynamics of lattice models
… of log-concavity. Last, we take a foray into analytic combinatorics and use the singularity analysis of Dirichlet generating functions to design sampling algorithms for Bose–Einstein condensates.
-
Profiles of PATRICIA Tries
Digital trees are data structures that represent sets of strings according to their shared prefix structure.
-
Combinatorial and Asymptotic Statistical Properties of Partitions and Unimodal Sequences
Our main results are asymptotic zero-one laws satisfied by the diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane; the upper boundary is called the shape. For various types of unimodal sequences, we show that, as the number of squares …
-
Analytic Methods and Combinatorial Plants
… codes to matrix multiplication. Many analytic tools have been developed for studying these structures. In this thesis, we examine three applications of these tools to problems in combinatorics. By coincidence, each problem involves a combinatorial structure named for a plant--AVL …
-
Asymptotic study of regular planar graphs
The central topic of this dissertation is the study of some families of regular planar graphs and maps. We are in particular interested in their asymptotic enumeration in order to understand of the associated uniform random model. In a first part, we give both an exact and an asymptotic enumeration …