中文
相关论文

相关论文: Directed trees in a string, real polynomials with …

200 篇论文

We study the inverse problem for persistent homology: For a fixed simplicial complex $K$, we analyse the fiber of the continuous map $\mathrm{PH}$ on the space of filters that assigns to a filter $f: K \to \mathbb R$ the total barcode of…

代数拓扑 · 数学 2022-04-12 Jacob Leygonie , Ulrike Tillmann

The exact symmetry identities among four-point tree-level amplitudes of bosonic open string theory as derived by G. W. Moore are re-examined. The main focuses of this work are: (1) Explicit construction of kinematic configurations and a new…

高能物理 - 理论 · 物理学 2014-06-02 Chuan-Tsung Chan , Shoichi Kawamoto , Dan Tomino

The original motivation for study for hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux.…

组合数学 · 数学 2007-05-23 Fu Liu

We reprove a result of Dehkordi, Frati, and Gudmundsson: every two vertices in a non-obtuse triangulation of a point set are connected by an angle-monotone path--an xy-monotone path in an appropriately rotated coordinate system. We show…

计算几何 · 计算机科学 2017-07-04 Anna Lubiw , Joseph O'Rourke

Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…

数据结构与算法 · 计算机科学 2018-07-03 Matthew P. Johnson

Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional…

离散数学 · 计算机科学 2025-10-28 Naveed Ahmed Azam , Seemab Hayat

We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…

范畴论 · 数学 2019-09-18 Amar Hadzihasanovic

A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…

代数拓扑 · 数学 2007-05-23 Marco Grandis

Assorted weighted shifts over finite rooted directed trees are studied. Their complex symmetry is characterized.

泛函分析 · 数学 2025-10-23 Piotr Budzyński

We study configuration space integral formulas for Milnor's homotopy link invariants, showing that they are in correspondence with certain linear combinations of trivalent trees. Our proof is essentially a combinatorial analysis of a…

代数拓扑 · 数学 2021-06-23 Robin Koytcheff , Ismar Volic

We compute the tree-level $H^2R^3$ couplings of type II strings and provide some basic tests of the couplings by considering both K3 and Calabi-Yau threefold compactifications. Curiously, additional kinematical structures show up at tree…

高能物理 - 理论 · 物理学 2021-04-20 James T. Liu , Ruben Minasian

We consider special cases of the two tree degree sequences problem. We show that if two tree degree sequences do not have common leaves then they always have edge-disjoint caterpillar realizations. By using a probabilistic method, we prove…

组合数学 · 数学 2017-04-25 Kristóf Bérczi , Zoltán Király , Changshuo Liu , István Miklós

We consider the Directed Spanning Forest (DSF) constructed as follows: given a Poisson point process N on the plane, the ancestor of each point is the nearest vertex of N having a strictly larger abscissa. We prove that the DSF is actually…

概率论 · 数学 2012-11-27 David Coupier , Viet Chi Tran

In proper hyperbolic geodetic spaces we construct rooted $\mathbb R$-trees with the following properties. On the one hand, every ray starting at the root is quasi-geodetic; so these $\mathbb R$-trees represent the space itself well. At the…

度量几何 · 数学 2011-05-20 Matthias Hamann

This work addresses the intrinsic relationship between trees and networks (i.e. graphs). A complete (invertible) mapping is presented which allows trees to be mapped into weighted graphs and then backmapped into the original tree without…

物理与社会 · 物理学 2008-08-07 Luciano da Fontoura Costa , Francisco Aparecido Rodrigues

To each link $L$ in $S^3$ we associate a collection of certain labelled directed trees, called width trees. We interpret some classical and new topological link invariants in terms of these width trees and show how the geometric structure…

几何拓扑 · 数学 2021-09-28 Qidong He , Scott A. Taylor

In homotopy theory, exact sequences and spectral sequences consist of groups and pointed sets, linked by actions. We prove that the theory of such exact and spectral sequences can be established in a categorical setting which is based on…

代数拓扑 · 数学 2010-07-06 Marco Grandis

We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…

组合数学 · 数学 2026-02-12 Caelan Wang , Karen Yeats

We introduce several homotopy equivalence relations for proper holomorphic mappings between balls. We provide examples showing that the degree of a rational proper mapping between balls (in positive codimension) is not a homotopy invariant.…

复变函数 · 数学 2015-09-30 John P. D'Angelo , Jiri Lebl

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…

群论 · 数学 2011-03-22 Denis Osin , Mark Sapir
‹ 上一页 1 8 9 10 下一页 ›