Related papers: On the missing branches of the Bruhat-Tits tree
Consider matrices of order $k+N$ over $p$-adic field determined up to conjugations by elements of $GL$ over $p$-adic integers. We define a product of such conjugacy classes and construct the analog of characteristic functions (transfer…
A simple recursive expansion algorithm for the integrals of tree level superstring five point amplitudes in a flat background is given which reduces the expansion to simple symbol(ic) manipulations. This approach can be used for instance to…
Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for well-studied families of graphs, this can be…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
Based on bulk reconstruction from the finite boundary of the Bruhat-Tits tree, the boundary effective theory is obtained after integrating out fields outside this boundary. According to the $~p$-adic version of Anti-de Sitter/Conformal…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
Grothendieck-Birkhoff Theorem states that every finite dimensional vector bundle over the projective line splits as the sum of one dimensional vector bundles. In this work we study simultaneous splittings of two dimensional vector bundles…
Even at tree level, the first quantized string theory suffers from apparent short distance singularities associated with collision of vertex operators that prevent us from straightforward numerical computation of various quantities.…
We present a new branch-and-bound type search method for mixed integer linear optimization problems based on the concept of offshoots (introduced in this paper). While similar to a classic branch-and-bound method, it allows for changing the…
We construct a map from knots to (abstract) 2-knots which can be extended to higher dimensions; this map is the natural "knot" counterpart for "braid" theory of groups $G_{n}^{k}$.
We provide a visual and intuitive introduction to effectively calculating in 2-groups along with explicit examples coming from non-abelian 1- and 2-form gauge theory. In particular, we utilize string diagrams, tools similar to tensor…
We extend (scheme-theoretic) Bruhat-Tits theory to quasi-reductive groups i.e. with trivial split unipotent radical over discretely valued henselian non-archimedean fields $K$, whose ring of integers is excellent and residue field is…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We introduce the Non-commutative Subset Convolution - a convolution of functions useful when working with determinant-based algorithms. In order to compute it efficiently, we take advantage of Clifford algebras, a generalization of…
Given a semisimple group over a local field of residual characteristic p, its topological group of rational points admits maximal pro-p-subgroups. Quasi-split simply-connected semisimple groups can be described in the combinatorial terms of…
We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation…
Let $k$ be a perfect field. Assume that the characteristic of $k$ satisfies certain tameness assumptions \eqref{tameness}. Let $\mathcal O_{_n} := k\llbracket z_{_1}, \ldots, z_{_n}\rrbracket$ and set $K_{_n} := \text{Fract}~\cO_{_n}$. Let…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
The Rooted Maximum Leaf Outbranching problem consists in finding a spanning directed tree rooted at some prescribed vertex of a digraph with the maximum number of leaves. Its parameterized version asks if there exists such a tree with at…