whitney number
Recently Published Documents


TOTAL DOCUMENTS

4
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

10.37236/6120 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Max Wakefield

For a representation of a matroid the combinatorially defined Kazhdan-Lusztig polynomial computes the intersection cohomology of the associated reciprocal plane. However, these polynomials are difficult to compute and there are numerous open conjectures about their structure. For example, it is unknown whether or not the coefficients are non-negative for non-representable matroids. The main result in this note is a combinatorial formula for the coefficients of these matroid Kazhdan-Lusztig polynomials in terms of flag Whitney numbers. This formula gives insight into some vanishing behavior of the matroid Kazhdan-Lusztig polynomials.


2009 ◽  
Vol 10 (03) ◽  
pp. 189-204 ◽  
Author(s):  
EDDIE CHENG ◽  
KE QIU ◽  
ZHIZHANG SHEN

An important and interesting parameter of an interconnection network is the number of vertices of a specific distance from a specific vertex. This is known as the surface area or the Whitney number of the second kind. In this paper, we give explicit formulas for the surface areas of the (n, k)-star graphs and the arrangement graphs via the generating function technique. As a direct consequence, these formulas will also provide such explicit formulas for the star graphs, the alternating group graphs and the split-stars since these graphs are related to the (n, k)-star graphs and the arrangement graphs. In addition, we derive the average distances for these graphs.


1975 ◽  
Vol 47 (2) ◽  
pp. 504-504 ◽  
Author(s):  
Thomas A. Dowling ◽  
Richard M. Wilson

Sign in / Sign up

Export Citation Format

Share Document