相关论文: Mumford dendrograms

The amplitudes for the tree-level scattering of the open string tachyons, generalised to the field of p-adic numbers, define the p-adic string theory. There is empirical evidence of its relation to the ordinary string theory in the p_to_1…

We present a new method to propagate $p$-adic precision in computations, which also applies to other ultrametric fields. We illustrate it with many examples and give a toy application to the stable computation of the SOMOS 4 sequence.

We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP…

We use coefficient systems on the affine Bruhat-Tits building to study admissible representations of reductive p-adic groups in characteristic not equal to p. We show that the character function is locally constant and provide explicit…

Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to…

Given a smooth formal scheme over the ring of integers of a mixed-characteristic perfectoid field, we study its $p$-adic vanishing cycles via de Rham--Witt and $q$-de Rham complexes.

A semialgebraic bijection from the field of p-adic numbers to itself minus one point is constructed. Semialgebraic p-adic sets are classified up to semialgebraic bijection. A cell decomposition theorem for restricted analytic p-adic maps is…

We investigate the local descents for special orthogonal groups over p-adic local fields of characteristic zero, and obtain an explicit spectral decomposition of the local descents at the first occurrence index in terms of the local…

We present a new way to summarize and select mixture models via the hierarchical clustering tree (dendrogram) constructed from an overfitted latent mixing measure. Our proposed method bridges agglomerative hierarchical clustering and…

We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…

We study the structure of adic curves over an affinoid field of arbitrary rank. In particular, quite analogously to Berkovich geometry we classify points on curves, prove a semistable reduction theorem in the version of Ducros'…

We show that there exist linear-time algorithms that compute the strong chromatic index and a maximum induced matching of tree-cographs when the decomposition tree is a part of the input. We also show that there exist efficient algorithms…

Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent work, Davies, R\'acz, and Rashtchian used combinatorial…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

For a spinor field theory on the Bruhat-Tits tree, we calculate the action and the partition function of its boundary theory by integrating out the interior of the Bruhat-Tits tree. We found that the boundary theory is very similar to a…

Let $A$ be a gentle algebra. For every collection of string and band diagrammes, we consider the constructible subset of the variety of representations containing all modules with this underlying diagramme. We study degenerations of such…

Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…

In their AMW14-paper, Frochaux, Grohe, and Schweikardt showed that the query containment problem for monadic datalog on finite unranked labeled trees is Exptime-complete when (a) considering unordered trees using the child-axis, and when…