English
Related papers

Related papers: Mumford dendrograms and discrete p-adic symmetries

200 papers

In this paper, we address the problem of enumerating all induced subtrees in an input k-degenerate graph, where an induced subtree is an acyclic and connected induced subgraph. A graph G = (V, E) is a k-degenerate graph if for any its…

Data Structures and Algorithms · Computer Science 2015-10-06 Kunihiro Wasa , Hiroki Arimura , Takeaki Uno

In this paper, we study the cohomology of the ramified PEL unitary Rapoport-Zink space of signature $(1,n-1)$ by using the Bruhat-Tits stratification on its special fiber. As such, we apply the same method that we developped for the…

Number Theory · Mathematics 2023-01-02 Joseph Muller

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.

Algebraic Geometry · Mathematics 2018-02-12 Matthew Morrow

In this paper, we apply stack theoretic ideas to the classification problem in Dieudonn\'e theory. First, we use crystalline cohomology of classifying stacks to directly reconstruct the classical Dieudonn\'e module of a finite, $p$-power…

Algebraic Geometry · Mathematics 2025-11-19 Shubhodip Mondal

We propose a principled method for autoencoding with random forests. Our strategy builds on foundational results from nonparametric statistics and spectral graph theory to learn a low-dimensional embedding of the model that optimally…

Machine Learning · Statistics 2026-01-16 Binh Duc Vu , Jan Kapar , Marvin Wright , David S. Watson

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…

Logic in Computer Science · Computer Science 2015-11-06 David Quick

Let K be an algebraically closed, complete non-Archimedean field. The purpose of this paper is to carefully study the extent to which finite morphisms of algebraic K-curves are controlled by certain combinatorial objects, called skeleta. A…

Algebraic Geometry · Mathematics 2014-04-16 Omid Amini , Matthew Baker , Erwan Brugallé , Joseph Rabinoff

We investigate Bruhat-Tits buildings and their compactifications by means of Berkovich analytic geometry over complete non-Archimedean fields. For every reductive group G over a suitable non-Archimedean field k we define a map from the…

Algebraic Geometry · Mathematics 2009-03-09 Bertrand Rémy , Amaury Thuillier , Annette Werner

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…

High Energy Physics - Theory · Physics 2020-03-02 Feng Qu , Yi-hong Gao

The notion of $\mathcal{H}$-treewidth, where $\mathcal{H}$ is a hereditary graph class, was recently introduced as a generalization of the treewidth of an undirected graph. Roughly speaking, a graph of $\mathcal{H}$-treewidth at most $k$…

Data Structures and Algorithms · Computer Science 2023-06-30 Bart M. P. Jansen , Jari J. H. de Kroon , Michal Wlodarczyk

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…

Probability · Mathematics 2022-12-22 Michael Albert , Cecilia Holmgren , Tony Johansson , Fiona Skerman

We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a $d$-regular tree…

Information Theory · Computer Science 2007-07-13 Christine Kelley , Deepak Sridhara , Joachim Rosenthal

Motivated by the Bruhat and Cartan decompositions of general linear groups over local fields, double cosets of the group of label preserving automorphisms of a label-regular tree over the fixator of an end of the tree and over maximal…

Group Theory · Mathematics 2021-01-27 Max Carter , George A. Willis

We prove a robust contraction decomposition theorem for $H$-minor-free graphs, which states that given an $H$-minor-free graph $G$ and an integer $p$, one can partition in polynomial time the vertices of $G$ into $p$ sets $Z_1,\dots,Z_p$…

Data Structures and Algorithms · Computer Science 2024-12-06 Sayan Bandyapadhyay , William Lochet , Daniel Lokshtanov , Dániel Marx , Pranabendu Misra , Daniel Neuen , Saket Saurabh , Prafullkumar Tale , Jie Xue

This work is a study of $p$-adic multiple zeta values at roots of unity ($p$MZV$\mu_{N}$'s), the $p$-adic periods of the crystalline pro-unipotent fundamental groupoid of $(\mathbb{P}^{1} - \{0,\mu_{N},\infty\})/ \mathbb{F}_{q}$. The main…

Number Theory · Mathematics 2017-12-29 David Jarossay

We study the Duflot filtration on the Borel equivariant cohomology of smooth manifolds with a smooth $p$-torus action. We axiomatize the filtration and prove analog of several structural results about equivariant cohomology rings in this…

Algebraic Topology · Mathematics 2018-10-18 James C. Cameron

In [M3], Milnor found Tricorn-like sets in the parameter space of real cubic polynomials. We give a rigorous definition of these Tricorn-like sets as suitable renormalization loci, and show that the dynamically natural straightening map…

Dynamical Systems · Mathematics 2022-04-26 Hiroyuki Inou , Sabyasachi Mukherjee

We introduce preordered semi-orthogonal decompositions (psod-s) of dg-categories. We show that homotopy limits of dg-categories equipped with compatible psod-s carry a natural psod. This gives a way to glue semi-orthogonal decompositions…

Algebraic Geometry · Mathematics 2020-05-07 Sarah Scherotzke , Nicolò Sibilla , Mattia Talpo

We consider the space of embeddings of finitely many circles that bound disks in non-positively curved surfaces. We index the connected components of this space with finite rooted trees and show that the connected components are classifying…

Algebraic Topology · Mathematics 2026-01-21 Ryan C. Gelnett

Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying a linear transformation based on a "one-hot" encoding of the discrete symbols. Despite its simplicity, such…

Machine Learning · Computer Science 2018-06-26 Ting Chen , Martin Renqiang Min , Yizhou Sun
‹ Prev 1 4 5 6 7 8 10 Next ›