Skip to main content
MathOverflow

Return to Question

replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link
Community Bot
Community Bot
  • 1
  • 2
  • 3

(Definition: Facet = Maximal Face)

This question is a continuation of the previous one that I had asked a couple of years ago: Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?

As an answer to my previous question, David Speyer gave an example showing that the Euler characteristic of a simplicial complex need not be polynomially bounded in terms of number of its facets. He further suggested a weaker bound, which if true would come handy in my research. Hence, I am posting it as a question here.

(Definition: Facet = Maximal Face)

This question is a continuation of the previous one that I had asked a couple of years ago: Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?

As an answer to my previous question, David Speyer gave an example showing that the Euler characteristic of a simplicial complex need not be polynomially bounded in terms of number of its facets. He further suggested a weaker bound, which if true would come handy in my research. Hence, I am posting it as a question here.

(Definition: Facet = Maximal Face)

This question is a continuation of the previous one that I had asked a couple of years ago: Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?

As an answer to my previous question, David Speyer gave an example showing that the Euler characteristic of a simplicial complex need not be polynomially bounded in terms of number of its facets. He further suggested a weaker bound, which if true would come handy in my research. Hence, I am posting it as a question here.

added 38 characters in body
Source Link
Raghav Kulkarni
Raghav Kulkarni
  • 197
  • 4

(Definition: Facet = Maximal Face)

This question is a continuation of the previous one that I had asked a couple of years ago: Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?

As an answer to my previous question, David Speyer gave an example showing that the Euler characteristic of a simplicial complex need not be polynomially bounded in terms of number of its facets. He further suggested a weaker bound, which if true would come handy in my research. Hence, I am posting it as a question here.

(Definition: Facet = Maximal Face)

This question is a continuation of the previous one that I had asked a couple of years ago: Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?

David Speyer gave an example showing that the Euler characteristic of a simplicial complex need not be polynomially bounded in terms of number of its facets. He further suggested a weaker bound, which if true would come handy in my research. Hence, I am posting it as a question here.

(Definition: Facet = Maximal Face)

This question is a continuation of the previous one that I had asked a couple of years ago: Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?

As an answer to my previous question, David Speyer gave an example showing that the Euler characteristic of a simplicial complex need not be polynomially bounded in terms of number of its facets. He further suggested a weaker bound, which if true would come handy in my research. Hence, I am posting it as a question here.

Source Link
Raghav Kulkarni
Raghav Kulkarni
  • 197
  • 4

Is Euler-characteristic of a simplicial complex on $n$ vertices and $f$ facets at most $n^{O(\log f)}$?

(Definition: Facet = Maximal Face)

This question is a continuation of the previous one that I had asked a couple of years ago: Is Euler characteristic of a simplicial complex upper bounded by a polynomial in the number of its facets ?

David Speyer gave an example showing that the Euler characteristic of a simplicial complex need not be polynomially bounded in terms of number of its facets. He further suggested a weaker bound, which if true would come handy in my research. Hence, I am posting it as a question here.