Logarithmic Tree-Numbers for Acyclic Complexes

نویسندگان

  • Hyuk Kim
  • Woong Kook
چکیده

For a d-dimensional cell complex Γ with H̃i(Γ) = 0 for −1 6 i < d, an idimensional tree is a non-empty collection B of i-dimensional cells in Γ such that H̃i(B ∪ Γ(i−1)) = 0 and w(B) := |H̃i−1(B ∪ Γ(i−1))| is finite, where Γ(i) is the iskeleton of Γ. The i-th tree-number is defined ki := ∑ B w(B) 2, where the sum is over all i-dimensional trees. In this paper, we will show that if Γ is acyclic and ki > 0 for −1 6 i 6 d, then ki and the combinatorial Laplace operators ∆i are related by ∑d i=−1 ωi x i+1 = (1 + x)2 ∑d−1 i=0 κix i, where ωi = log det ∆i and κi = log ki. We will discuss various consequences and applications of this equation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating Height and Diameter Growth of Some Street Trees in Urban Green Spaces

Estimating urban trees growth, especially tree height is very important in urban landscape management. The aim of the study was to predict of tree height base on tree diameter. To achieve this goal, 921 trees from five species were measured in five areas of Mashhad city in 2014. The evaluated trees were ash tree (Fraxinus species), plane tree (Platanus hybrida), white mulberry (Morus alba), ail...

متن کامل

PSPACE Automata for Description Logics

Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this result can be improved, and we define two classes of automata, called segmentable and weakly-segmentable, for which emptiness can be decided using space logarithmic in the size of the automaton (and thus polynomial in ...

متن کامل

Logarithmic Tree Factorials

To any rooted tree, we associate a sequence of numbers that we call the logarithmic factorials of the tree. This provides a generalization of Bhargava’s factorials to a natural combinatorial setting suitable for studying questions around generalized factorials. We discuss several basic aspects of the framework in this paper. In particular, we relate the growth of the sequence of logarithmic fac...

متن کامل

Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests

We present new and improved approximation and FPT algorithms for computing rooted and unrooted maximum agreement forests (MAFs) of pairs of phylogenetic trees. Their sizes correspond to the subtree-prune-and-regraft distances and the tree-bisection-and-reconnection distances of the trees, respectively. We also provide the first bounded search tree FPT algorithm for computing rooted maximum acyc...

متن کامل

A Weighted Cellular Matrix-tree Theorem, with Applications to Complete Colorful and Cubical Complexes

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give weighted generalizations of the tree enumeration formulas of Adin for complete colorful complexes, and of Duval, Klivans and Martin for skeleta of hypercubes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014