AbstractMany combinatorial polynomials are related to rank-generating functions of Cohen-Macaulay complexes; notable among these are reliability, chromatic, flow, Birkhoff, and order polynomials. We prove two analytic theorems on the location of zeros of polynomials which have direct applications to the rank-generating functions of Cohen-Macaulay complexes and discuss their consequences for each of the aforementioned classes of polynomials
In this thesis, we put restrictions on the coefficients of polynomials and give bounds concerning th...
AbstractCharacterizations of Cohen-Macaulay posets are given in terms of the nonsingularity of certa...
AbstractLet {Pn(x)}n=0∞ be a system of polynomials satisfying the recurrence relation P−1(x) = 0, P0...
AbstractMany combinatorial polynomials are related to rank-generating functions of Cohen-Macaulay co...
We study Cohen-Macaulay Hopf monoids in the category of species. The goal is to apply techniques fro...
The problem of whether or not a Cohen-Macaulay complex Δ is Gorenstein depends only on the reduced E...
AbstractTo count over some oriented graphs a class of combinatorial numbers is introduced. Their exp...
AbstractThe location of the zeros of a family of polynomials satisfying a three-term recurrence rela...
We prove that two infinite families of polynomials naturally associated to Fibonacci Lattices have o...
We develop some basic tools to work with representable matroids of bounded tree-width and use them t...
We show that each polynomial a(z)=1+a1z+ · · ·+adzd in N[z] having only real zeros is the f-polynom...
AbstractThe chromatic polynomial PG(q) of a loopless graph G is known to be non-zero (with explicitl...
This dissertation builds upon two well-known theorems: Macaulay's theorem on the Hilbert functions o...
AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. T...
AbstractTwo basic analytic functions α(z) and β(z) defined in domains depending on the location of t...
In this thesis, we put restrictions on the coefficients of polynomials and give bounds concerning th...
AbstractCharacterizations of Cohen-Macaulay posets are given in terms of the nonsingularity of certa...
AbstractLet {Pn(x)}n=0∞ be a system of polynomials satisfying the recurrence relation P−1(x) = 0, P0...
AbstractMany combinatorial polynomials are related to rank-generating functions of Cohen-Macaulay co...
We study Cohen-Macaulay Hopf monoids in the category of species. The goal is to apply techniques fro...
The problem of whether or not a Cohen-Macaulay complex Δ is Gorenstein depends only on the reduced E...
AbstractTo count over some oriented graphs a class of combinatorial numbers is introduced. Their exp...
AbstractThe location of the zeros of a family of polynomials satisfying a three-term recurrence rela...
We prove that two infinite families of polynomials naturally associated to Fibonacci Lattices have o...
We develop some basic tools to work with representable matroids of bounded tree-width and use them t...
We show that each polynomial a(z)=1+a1z+ · · ·+adzd in N[z] having only real zeros is the f-polynom...
AbstractThe chromatic polynomial PG(q) of a loopless graph G is known to be non-zero (with explicitl...
This dissertation builds upon two well-known theorems: Macaulay's theorem on the Hilbert functions o...
AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. T...
AbstractTwo basic analytic functions α(z) and β(z) defined in domains depending on the location of t...
In this thesis, we put restrictions on the coefficients of polynomials and give bounds concerning th...
AbstractCharacterizations of Cohen-Macaulay posets are given in terms of the nonsingularity of certa...
AbstractLet {Pn(x)}n=0∞ be a system of polynomials satisfying the recurrence relation P−1(x) = 0, P0...