Logarithmic Tree-Numbers for Acyclic Complexes
نویسندگان
چکیده
منابع مشابه
Logarithmic Tree-Numbers for Acyclic Complexes
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...
متن کاملWeighted Tree-Numbers of Matroid Complexes
We give a new formula for the weighted high-dimensional tree-numbers of matroid complexes. This formula is derived from our result that the spectra of the weighted combinatorial Laplacians of matroid complexes consist of polynomials in the weights. In the formula, Crapo’s β-invariant appears as the key factor relating weighted combinatorial Laplacians and weighted tree-numbers for matroid compl...
متن کاملHelly numbers of acyclic families
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open subsets of an arbitrary locally arc-wise connected topological space Γ. Assume that for every sub-family G ⊆ F the intersection of the elements of G has at most r connected components, each of which is a Q-homology cel...
متن کامل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...
متن کاملPrime Numbers in Logarithmic Intervals
Let X be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type (p, p+ h], where p ≤ X is a prime number and h = o(X). Then we will apply this to prove that for every λ > 1/2 there exists a positive proportion of primes p ≤ X such that the interval (p, p+λ logX] contains at least a prime number. As a consequence we improve Cheer an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/3403