Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Big polygon spaces (1)
- Cohomology (1)
- Data Structures (1)
- Descent (1)
- Equivariant cohomology (1)
-
- Fast Fourier Transform (1)
- Furer's algorithm (1)
- Generalized Fermat prime (1)
- High-Performance (1)
- Higher Category Theory (1)
- Homotopy Theory (1)
- Manifolds with corners (1)
- Morse theory (1)
- Noncommutative Geometry (1)
- Polynomial Arithmetic (1)
- Polynomial Interpolation (1)
- Polynomial multiplication (1)
- Pseudo-Division (1)
- Quasi-Categories (1)
- Quotient criterion (1)
- Random Matrix Models (1)
- Repulsive Particles Systems (1)
- Schwinger-Dyson Equations (1)
- Sparse Polynomials (1)
- Spectral Triple (1)
- Syzygy (1)
- Topological Recursion (1)
- Topos (1)
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
High Performance Sparse Multivariate Polynomials: Fundamental Data Structures And Algorithms, Alex Brandt
High Performance Sparse Multivariate Polynomials: Fundamental Data Structures And Algorithms, Alex Brandt
Electronic Thesis and Dissertation Repository
Polynomials may be represented sparsely in an effort to conserve memory usage and provide a succinct and natural representation. Moreover, polynomials which are themselves sparse – have very few non-zero terms – will have wasted memory and computation time if represented, and operated on, densely. This waste is exacerbated as the number of variables increases. We provide practical implementations of sparse multivariate data structures focused on data locality and cache complexity. We look to develop high-performance algorithms and implementations of fundamental polynomial operations, using these sparse data structures, such as arithmetic (addition, subtraction, multiplication, and division) and interpolation. We revisit …
Topological Recursion And Random Finite Noncommutative Geometries, Shahab Azarfar
Topological Recursion And Random Finite Noncommutative Geometries, Shahab Azarfar
Electronic Thesis and Dissertation Repository
In this thesis, we investigate a model for quantum gravity on finite noncommutative spaces using the topological recursion method originated from random matrix theory. More precisely, we consider a particular type of finite noncommutative geometries, in the sense of Connes, called spectral triples of type ${(1,0)} \,$, introduced by Barrett. A random spectral triple of type ${(1,0)}$ has a fixed fermion space, and the moduli space of its Dirac operator ${D=\{ H , \cdot \} \, ,}$ ${H \in {\mathcal{H}_N}}$, encoding all the possible geometries over the fermion space, is the space of Hermitian matrices ${\mathcal{H}_N}$. A distribution of the …
Syzygy Order Of Big Polygon Spaces, Jianing Huang
Syzygy Order Of Big Polygon Spaces, Jianing Huang
Electronic Thesis and Dissertation Repository
For a compact smooth manifold with a torus action, its equivariant cohomology is a finitely generated module over a polynomial ring encoding information about the space and the action. For such a module, we can associate a purely algebraic notion called syzygy order. Syzygy order of equivariant cohomology is closely related to the exactness of Atiyah-Bredon sequence in equivariant cohomology. In this thesis we study a family of compact orientable manifolds with torus actions called big polygon spaces. We compute the syzygy orders of their equivariant cohomologies. The main tool used is a quotient criterion for syzygies in equivariant cohomology. …
Local Higher Category Theory, Nicholas Meadows
Local Higher Category Theory, Nicholas Meadows
Electronic Thesis and Dissertation Repository
The purpose of this thesis is to give presheaf-theoretic versions of three of the main extant models of higher category theory: the Joyal, Rezk and Bergner model structures. The construction of these model structures takes up Chapters 2, 3 and 4 of the thesis, respectively. In each of the model structures, the weak equivalences are local or ‘stalkwise’ weak equivalences. In addition, it is shown that certain Quillen equivalences between the aforementioned models of higher category theory extend to Quillen equivalences between the various models of local higher category theory.
Throughout, a number of features of local higher category theory …
Putting Fürer's Algorithm Into Practice With The Bpas Library, Linxiao Wang
Putting Fürer's Algorithm Into Practice With The Bpas Library, Linxiao Wang
Electronic Thesis and Dissertation Repository
Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as other disciplines. In 1971, Schönhage and Strassen designed an algorithm that improved the multiplication time for two integers of at most n bits to O(log n log log n). In 2007, Martin Fürer presented a new algorithm that runs in O (n log n · 2 ^O(log* n)) , where log*n is the iterated logarithm of n. We explain how we can put Fürer’s ideas into practice for multiplying polynomials over a prime field Z/pZ, which characteristic is a Generalized Fermat prime of …