AbstractLet A, D be finite subsets of Zk (the set of all k-tuples of integers), and consider the sequence of sets (A, A + D, A + D + D,…) which can be thought of growth in a crystal. One starts with a hub A and adds increments equal to D. We represent finite subsets of Zk by means of polynomials, and show that the sequence of polynomials corresponding to the crystal sequence is generated by a rational function. The proof is non-constructive
In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-the...
We prove that for any fixed d the generating function of the projection of the set of integer point...
AbstractWe study the representation of the solutions of a polynomial system by triangular sets, and ...
AbstractLet A, D be finite subsets of Zk (the set of all k-tuples of integers), and consider the seq...
AbstractA method is given for computing the generating function for a sequence of polynomials repres...
AbstractF. Quinn recently proved a conjecture of Farrell and Hsiang giving a calculation of the proj...
AbstractThe generating function F(P)=∑α∈P∩ZNxα for a rational polytope P carries all essential infor...
International audienceWe introduce two notions of complexity of a system of polynomials $p_{1},\ld,p...
In this paper, for a finitely generated monoid M, we tackle the following three questions: center do...
Throughout this paper, Z denoes the integers, Q the rational numbers, and D the collection of polyno...
We construct for every integer $k\geq 3$ and every real $\mu\in(0, \frac{k-1}{k})$ a set of integers...
In this note, we prove that if A is a finite set of real numbers such that |AA|=K|A|, then for every...
AbstractA well-known construction associates to each rational subset of Nk a rational function in k ...
We prove that, for any fixed d, there is a polynomial time algorithm for computing the generating fu...
In order to optimize a computer implementation of the recursion method, (initially proposed by Heine...
In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-the...
We prove that for any fixed d the generating function of the projection of the set of integer point...
AbstractWe study the representation of the solutions of a polynomial system by triangular sets, and ...
AbstractLet A, D be finite subsets of Zk (the set of all k-tuples of integers), and consider the seq...
AbstractA method is given for computing the generating function for a sequence of polynomials repres...
AbstractF. Quinn recently proved a conjecture of Farrell and Hsiang giving a calculation of the proj...
AbstractThe generating function F(P)=∑α∈P∩ZNxα for a rational polytope P carries all essential infor...
International audienceWe introduce two notions of complexity of a system of polynomials $p_{1},\ld,p...
In this paper, for a finitely generated monoid M, we tackle the following three questions: center do...
Throughout this paper, Z denoes the integers, Q the rational numbers, and D the collection of polyno...
We construct for every integer $k\geq 3$ and every real $\mu\in(0, \frac{k-1}{k})$ a set of integers...
In this note, we prove that if A is a finite set of real numbers such that |AA|=K|A|, then for every...
AbstractA well-known construction associates to each rational subset of Nk a rational function in k ...
We prove that, for any fixed d, there is a polynomial time algorithm for computing the generating fu...
In order to optimize a computer implementation of the recursion method, (initially proposed by Heine...
In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-the...
We prove that for any fixed d the generating function of the projection of the set of integer point...
AbstractWe study the representation of the solutions of a polynomial system by triangular sets, and ...