相关论文: Mumford dendrograms
We prove that the Hodge-de Rham spectral sequence for smooth proper tame Artin stacks in characteristic p (as defined by Abramovich, Olsson, and Vistoli) which lift mod p^2 degenerates. We push the result to the coarse spaces of such…
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…
This is a survey of some recent developments concerning the p-adic cohomology of algebraic varieties over fields of positive characteristic and local fields of mixed characteristic, plus some related areas like p-adic Hodge theory.
The construction of a dendogram on a set of individuals is a key component of a genomewide association study. However even with modern sequencing technologies the distances on the individuals required for the construction of such a…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
We apply the theory of Bruhat-Tits trees to the study of optimal embeddings of two and three dimensional commutative orders into quaternion algebras. Specifically, we determine how many conjugacy classes of global Eichler orders in a…
In this paper, we extend the notion of gapped strings to elastic-degenerate strings. An elastic-degenerate string can been seen as an ordered collection of k > 1 seeds (substrings/subpatterns) interleaved by elastic-degenerate symbols such…
Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded…
We study the special fibers of a certain class of absolutely simple abelian varieties over number fields with endomorphism rings $\bz$ and possessing $l$-adic monodromy groups of the least possible rank. We also study the Dirichlet density…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
To every object $X$ of a symmetric tensor category over a field of characteristic $p>0$ we attach $p$-adic integers $\text{Dim}_+(X)$ and $\text{Dim}_-(X)$ whose reduction modulo $p$ is the categorical dimension $\text{dim}(X)$ of $X$,…
For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set of any vertex is a q-valent tree. We also give conditions on a rooted digraph G which allow us to construct a countable…
The widespread use of GPS-enabled devices generates voluminous and continuous amounts of traffic data but analyzing such data for interpretable and actionable insights poses challenges. A hierarchical clustering of the trips has many uses…
This paper presents a tree-to-tree transduction method for sentence compression. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of the tree topology and can thus naturally capture…
This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…
`Tree pruning' (TP) is an algorithm for probabilistic inference on binary Markov random fields. It has been recently derived by Dror Weitz and used to construct the first fully polynomial approximation scheme for counting independent sets…
We express the classical $p$-adic integers $\hat{\mathbb{Z}_p}$, as a metric space, as a final colagebra to a certain endofunctor. We realize the addition and the multiplication on $\hat{\mathbb{Z}_p}$ as the coalgebra maps from…
Previously, we proposed a physically-inspired method to construct data points into an effective in-tree (IT) structure, in which the underlying cluster structure in the dataset is well revealed. Although there are some edges in the IT…