AbstractA method is given for computing the generating function for a sequence of polynomials representing a growing crystal. The younger twin of this paper presented a non-constructive proof that the generating function is rational
AbstractWe give new proofs of three theorems of Stanley on generating functions for the integer poin...
Given a valuation on the function field k( x; y), we examine the set of images of nonzero elemen...
Suppose [Formula: see text] and [Formula: see text] are finite complexes, with [Formula: see text] s...
AbstractLet A, D be finite subsets of Zk (the set of all k-tuples of integers), and consider the seq...
We prove that, for any fixed d, there is a polynomial time algorithm for computing the generating fu...
We prove that for any fixed d the generating function of the projection of the set of integer point...
The average frequency of 1 occurring as the kth digit in the binary expansion of squares, cubes, and...
AbstractThe generating function F(P)=∑α∈P∩ZNxα for a rational polytope P carries all essential infor...
The goal of this talk is to present the state-of-the-art construction of pseudorandom number generat...
We examine two different ways of encoding a counting function: as a rational generating function and...
AbstractWe examine two different ways of encoding a counting function: as a rational generating func...
Abstract. We study the growth of polynomials on semialgebraic sets. For this purpose we associate a ...
In this paper, for a finitely generated monoid M, we tackle the following three questions: center do...
The structure-generating functions of regular sets and the DOL growth functions are characterized. O...
We introduce a generating function associated to the homogeneous gen-erators of a graded algebra tha...
AbstractWe give new proofs of three theorems of Stanley on generating functions for the integer poin...
Given a valuation on the function field k( x; y), we examine the set of images of nonzero elemen...
Suppose [Formula: see text] and [Formula: see text] are finite complexes, with [Formula: see text] s...
AbstractLet A, D be finite subsets of Zk (the set of all k-tuples of integers), and consider the seq...
We prove that, for any fixed d, there is a polynomial time algorithm for computing the generating fu...
We prove that for any fixed d the generating function of the projection of the set of integer point...
The average frequency of 1 occurring as the kth digit in the binary expansion of squares, cubes, and...
AbstractThe generating function F(P)=∑α∈P∩ZNxα for a rational polytope P carries all essential infor...
The goal of this talk is to present the state-of-the-art construction of pseudorandom number generat...
We examine two different ways of encoding a counting function: as a rational generating function and...
AbstractWe examine two different ways of encoding a counting function: as a rational generating func...
Abstract. We study the growth of polynomials on semialgebraic sets. For this purpose we associate a ...
In this paper, for a finitely generated monoid M, we tackle the following three questions: center do...
The structure-generating functions of regular sets and the DOL growth functions are characterized. O...
We introduce a generating function associated to the homogeneous gen-erators of a graded algebra tha...
AbstractWe give new proofs of three theorems of Stanley on generating functions for the integer poin...
Given a valuation on the function field k( x; y), we examine the set of images of nonzero elemen...
Suppose [Formula: see text] and [Formula: see text] are finite complexes, with [Formula: see text] s...
DOI
Add to ORKG