Related papers: Decorated hypertrees
We present an algorithm for the symbolic and numerical computation of the degrees of the Chern-Schwartz-MacPherson classes of a closed subvariety of projective space P^n. As the degree of the top Chern-Schwartz-MacPherson class is the…
A hypergraph $\mathcal{H}=(V,\mathcal{E})$ is a hypertree if it admits a tree $T$ with vertex set $V$ such that every edge of $\mathcal{H}$ induces a subtree of $T$. A tree like that is called a host tree. Several characterizations and…
We obtain a precise relation between the Chern-Schwartz-MacPherson class of a subvariety of projective space and the Euler characteristics of its general linear sections. In the case of a hypersurface, this leads to simple proofs of…
First we show that any group of automorphisms of null-entropy of a projective hyperk\"ahler manifold $M$ is almost abelian of rank at most $\rho(M) - 2$. We then characterize automorphisms of a K3 surface with null-entropy and those with…
We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…
We prove an asymptotic formula for the Euler characteristic of Kontsevich's commutative graph complex. This formula implies that the total amount of commutative graph homology grows super-exponentially with the rank and, via a theorem of…
We study the use of the Euler characteristic for multiparameter topological data analysis. Euler characteristic is a classical, well-understood topological invariant that has appeared in numerous applications, including in the context of…
We consider a model of directed polymers on regular trees with complex-valued random weights introduced by Cook and Derrida [CD90] and studied mathematically by Derrida, Evans and Speer [DES93]. In addition to the usual weak-disorder and…
Natural language data exhibit tree-like hierarchical structures such as the hypernym-hyponym relations in WordNet. FastText, as the state-of-the-art text classifier based on shallow neural network in Euclidean space, may not model such…
We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…
In 1999, Benjamini, Lyons, Peres, and Schramm introduced a notion of weighted-amenability for transitive graphs that is equivalent to the amenability of its automorphism group. For unimodular graphs this notion coincides with classical…
The Horton-Strahler (HS) index $r=\max{(i,j)}+\delta_{i,j}$ has been shown to be relevant to a number of physical (such at diffusion limited aggregation) geological (river networks), biological (pulmonary arteries, blood vessels, various…
Aerial remote sensing using multispectral and RGB imagers has provided a critical impetus to precision agriculture. Analysis of the hyperspectral images with limited or no labels is challenging. This paper focuses on self-supervised…
We stratify families of projective and very affine hypersurfaces according to their topological Euler characteristic. Our new algorithms compute all strata using algebro-geometric techniques. For very affine hypersurfaces, we investigate…
If $G$ is a free product of finite groups, let $\Sigma Aut_1(G)$ denote all (necessarily symmetric) automorphisms of $G$ that do not permute factors in the free product. We show that a McCullough-Miller [D. McCullough and A. Miller, {\em…
Within the group algebras of the symmetric and hyperoctahedral groups, one has their descent algebras and families of Eulerian idempotents. These idempotents are known to generate group representations with topological interpretations, as…
A uniform recursive tree on $n$ vertices is a random tree where each possible $(n-1)!$ labeled recursive rooted tree is selected with equal probability. In this paper we introduce and study weighted trees, a non-uniform recursive tree model…
We obtain restrictions on the rational homotopy types of mapping spaces and of classifying spaces of homotopy automorphisms by means of the theory of positive weight decompositions. The theory applies, in particular, to connected components…
One way to study an hypergraph is to attach to it a tensor. Tensors are a generalization of matrices, and they are an efficient way to encode information in a compact form. In this paper we study how properties of weighted hypergraphs are…
Almost hypercomplex pseudo-Hermitian manifolds are considered. Isotropic hyper-K\"ahler manifolds are introduced. A 4-parametric family of 4-dimensional manifolds of this type is constructed on a Lie group. This family is characterized…