惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园 - Franky
Apple Machine Learning Research
Apple Machine Learning Research
月光博客
月光博客
Vercel News
Vercel News
Recent Announcements
Recent Announcements
B
Blog RSS Feed
Y
Y Combinator Blog
M
MIT News - Artificial intelligence
MongoDB | Blog
MongoDB | Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
雷峰网
雷峰网
D
Docker
Jina AI
Jina AI
IT之家
IT之家
人人都是产品经理
人人都是产品经理
L
LangChain Blog
G
Google Developers Blog
Google DeepMind News
Google DeepMind News
MyScale Blog
MyScale Blog
博客园 - 叶小钗
The GitHub Blog
The GitHub Blog
The Cloudflare Blog
A
About on SuperTechFans
Hugging Face - Blog
Hugging Face - Blog

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
From Hopf algebras to rough paths and regularity structures
Rosa Preiß · 2021-12-09 · via math.CO updates on arXiv.org

Lyon's rough paths give an algebraic and analytic framework for Stieltjes integrals in a regime of low regularity where the usual Riemann-Stieltjes integral does not converge. Before we may rigorously define rough paths, we start with the introduction of some basic algebraic terminology. Among them are algebras and coalgebras, two notions which are in some sense dual to each other. As a combination of these notions we obtain bialgebras, and as a special case of them then Hopf algebras, which play a central role in this thesis. After further algebraic preliminaries, we give the examples of Hopf algebras we are interested in. Among them is the example of the polynomial Hopf algebra, whose product is nothing but the usual multiplication of polynomials and whose coproduct can be expressed very simply with the help of a binomial coefficient. We then use the dual pair of tensor Hopf algebras to introduce weakly geometric rough paths, which correspond to notions of Stieltjes integrals satisfying the usual integration by parts rule. For cases like Itô-integration where we need to give up integration by parts, we look at Gubinelli's branched rough paths based on the dual pair of Hopf algebras on trees and forests. Finally, we give some basic concepts of Hairer's theory of regularity structures and use them for a different approach to branched and weakly geometric rough paths. While we first look at a general method described by Hairer to derive a regularity structure from certain Hopf algebras, we then develop a regularity structure based on a formal Picard iteration which is more suitable for dealing with rough differential equations. This work was written as a master's thesis supervised by Peter Friz and Sylvie Paycha and submitted to TU Berlin on July 29 2016. As of 2021, it does not provide novel research material, but can still be used as an algebra-focussed introduction to the subject.