相关论文: Constructing non-uniquely ergodic arational trees

We introduce a notion of constructibility for \'etale sheaves with torsion coefficients over a suitable class of adic spaces. This notion is related to the classical notion of constructibility for schemes via the nearby cycles functor. We…

We explore methods for constructing normal forms of indecomposable quiver representations. The first part of the paper develops homological tools for recursively constructing families of indecomposable representations from indecomposables…

We define and construct mixed Hodge structures on real schematic homotopy types of complex projective varieties, giving mixed Hodge structures on their homotopy groups and pro-algebraic fundamental groups. We also show that these split on…

We discuss certain aspects of the combinatorial approach to the differential geometry of non-abelian gerbes, due to W. Messing and the author (arXiv:math.AG/0106083), and give a more direct derivation of the associated cocycle equations.…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

This paper introduces a method to extract a hierarchical tree representation from 3D unorganized polygonal data. The proposed approach first extracts a graph representation of the surface, which serves as the foundation for structural…

Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…

Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…

In this paper, we use the H2 norm associated with a communication graph to characterize the robustness of consensus to noise. In particular, we restrict our attention to trees and by systematic attention to the effect of local changes in…

In this note, we give an alternative and explicit construction of the $G_2(2)$-hexagon from a $U_3(2)$-geometry.

We develop the formalism of universal torsors in equivariant birational geometry and apply it to produce new examples of nonbirational but stably birational actions of finite groups.

We formulate a construction of type-I fracton models based on gauging planar subsystem symmetries of topologically ordered two dimensional layers that have been stacked in three ambient spatial dimensions. Via our construction, any defect…

For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…

Using the Lagrange inversion formula, $t$-ary trees are enumerated with respect to edge type (left, middle, right for ternary trees).

We show that there exists an ergodic non-singular transformation which satisfies Krieger's property A, but which is not of product type.

The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that…

To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…

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…

We construct a series of examples of non--flat non--homogeneous parabolic geometries that carry a symmetry of the parabolic geometry at each point.

Tree structured graphical models are powerful at expressing long range or hierarchical dependency among many variables, and have been widely applied in different areas of computer science and statistics. However, existing methods for…