Related papers: p-adic iterated integration on semistable curves
For a proper semistable curve $X$ over a DVR of mixed characteristics we reprove the "invariant cycles theorem" with trivial coefficients (see Chiarellotto, 1999) i.e. that the group of elements annihilated by the monodromy operator on the…
We study the unipotent completion $\Pi^{DR}_{un}(x_0, x_1, X_K)$ of the de Rham fundamental groupoid [De] of a smooth algebraic variety over a local non-archimedean field K of characteristic 0. We show that the vector space…
A constructive version of the Frobenius integrability theorem -- that can be programmed effectively -- is given. This is used in computing invariants of groups of low ranks and recover examples from a recent paper of Boyko, Patera and…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
In this paper, we introduce an algorithm for computing p-adic integrals on bad reduction hyperelliptic curves. For bad reduction curves, there are two notions of p-adic integration: Berkovich-Coleman integrals which can be performed…
A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
This article presents a theory of modules with iterative connection. This theory is a generalisation of the theory of modules with connection in characteristic zero to modules over rings of arbitrary characteristic. We show that these…
We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…
Given a simple undirected graph $G$ there is a simplicial complex $\mathrm{Ind}(G)$, called the independence complex, whose faces correspond to the independent sets of $G$. This is a well studied concept because it provides a fertile ground…
This paper studies the dynamics and integrability of a variable-length coupled pendulum system. The complexity of the model is presented by joining various numerical methods, such as the Poincar\'e cross-sections, phase-parametric diagrams,…
We develop a $p$-adic theory of periods for 1-motives, extending the classical theory of complex periods into the non-archimedean setting. For 1-motives with good reduction over $p$-adic local fields, we construct a $p$-adic integration…
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
We derive a relative version of the local monodromy theorem for ordinary differential equations on an annulus over a mixed-characteristic nonarchimedean field, and give several applications in $p$-adic cohomology and $p$-adic Hodge theory.…
There is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial "refinement" algorithms seem to be very efficient in practice. Some philosophical justification is provided by a classical theorem of…
In [DW05] and [DW07], C. Deninger and A. Werner developed a partial p-adic analogue of the classical Narasimhan-Seshadri correspondence between vector bundles and representations of the fundamental group. We will investigate the various…
It is known that there is a one-to-one mapping between oriented directed graphs and zero-sum replicator dynamics (Lotka-Volterra equations) and that furthermore these dynamics are Hamiltonian in an appropriately defined nonlinear Poisson…
We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…
In this paper, we continue the development of a new combinatorial model for the irreducible characters of a complex semisimple Lie group. This model, which will be referred to as the alcove path model, can be viewed as a discrete…
In an earlier paper [1] it was shown that the Frobenius compound characters for the symmetric groups are related to the irreducible characters by a linear relation that involves a unitriagular coupling matrix that gives the Frobenius…