Related papers: On Overlapping Divergences
A random forest prediction can be computed by the scalar product of the labels of the training examples and a set of weights that are determined by the leafs of the forest into which the test object falls; each prediction can hence be…
We present several related examples of Hopf algebroids over a universal enveloping algebra which are of the scalar extension Hopf algebroid type and explain their origin in Lie and algebraic group theory.
We consider the Hopfield model with $n$ neurons and an increasing number $p=p(n)$ of randomly chosen patterns and use Stein's method to obtain rates of convergence for the central limit theorem of overlap parameters, which holds for every…
Species tree estimation is a complex problem, due to the fact that different parts of the genome can have different evolutionary histories than the genome itself. One of the causes for this discord is incomplete lineage sorting (also called…
Building off recent work of Garg and Peng, we continue the investigation into classical and consecutive pattern avoidance in rooted forests. We prove a forest analogue of the Stanley-Wilf conjecture for avoiding a single pattern as well as…
In this paper we investigate pointed Hopf algebras via quiver methods. We classify all possible Hopf structures arising from minimal Hopf quivers, namely basic cycles and the linear chain. This provides full local structure information for…
The Connes-Kreimer Hopf algebra of rooted trees, its dual, and the Foissy Hopf algebra of of planar rooted trees are related to each other and to the well-known Hopf algebras of symmetric and quasi-symmetric functions via a pair of…
We investigate various homotopy invariant formulations of commutative algebra in the context of rational homotopy theory. The main subject is the complete intersection condition, where we show that a growth condition implies a structure…
We investigate the structures of Hopf $\ast$-algebra on the Radford algebras over $\mathbb {C}$. All the $*$-structures on $H$ are explicitly given. Moreover, these Hopf $*$-algebra structures are classified up to equivalence.
In this paper we present a unifying approach to study the homotopy type of several complexes arising from forests. We show that this method applies uniformly to many complexes that have been extensively studied.
In [EH89, Theorem 1] Ekeland-Hofer prove that for a centrally symmetric, restricted contact type hypersurface in R^{2n} and for any global, centrally symmetric Hamiltonian perturbation there exists a leaf-wise intersection point. In this…
I discuss motivations for introducing Hopf algebra symmetries in noncommutative field theories and briefly describe twisting of main symmetry transformations. New results include an extended list of twisted gauge invariants (which may help…
We review the language of differential forms and their applications to Riemannian Geometry with an orientation to General Relativity. Working with the principal algebraic and differential operations on forms, we obtain the structure…
We present a general algorithm for finding the overlap area between two ellipses. The algorithm is based on finding a segment area (the area between an ellipse and a secant line) given two points on the ellipse. The Gauss-Green formula is…
We define a Hopf algebra of polylogarithms of an arbitrary field, which is a candidate for a conjectural Hopf algebra of framed mixed Tate motives. Our definition is elementary and mimics Goncharov's construction of higher Bloch groups. We…
We give a 2-approximation algorithm for the Maximum Agreement Forest problem on two rooted binary trees. This NP-hard problem has been studied extensively in the past two decades, since it can be used to compute the Subtree…
We say that an unordered rooted labeled forest avoids the pattern $\pi\in\mathcal{S}_n$ if the sequence obtained from the labels along the path from the root to any vertex does not contain a subsequence that is in the same relative order as…
We present a new method for inferring species trees from multi-copy gene trees. Our method is based on a generalization of the Robinson-Foulds (RF) distance to multi-labeled trees (mul-trees), i.e., gene trees in which multiple leaves can…
We give a framework for growth models on posets which simultaneously generalizes the Classical Sequential Growth models for posets from causal set theory and the tree growth models of natural growth and simple tree classes, the latter of…
We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…