On some counting problems for semi-linear sets

Details On some counting problems for semi-linear sets On some counting problems for semi-linear sets

2009-07-17

arxiv.org/abs/0907.3005v1

Computer Science

Discrete Mathematics

34 pages

Scientific paper

Let $X$ be a subset of $\N^t$ or $\Z^t$. We can associate with $X$ a function ${\cal G}_X:\N^t\longrightarrow\N$ which returns, for every $(n_1, ..., n_t)\in \N^t$, the number ${\cal G}_X(n_1, ..., n_t)$ of all vectors $x\in X$ such that, for every $i=1,..., t, |x_{i}| \leq n_{i}$. This function is called the {\em growth function} of $X$. The main result of this paper is that the growth function of a semi-linear set of $\N^t$ or $\Z^t$ is a box spline. By using this result and some theorems on semi-linear sets, we give a new proof of combinatorial flavour of a well-known theorem by Dahmen and Micchelli on the counting function of a system of Diophantine linear equations.

Affiliated with

Also associated with

No associations

Rating

On some counting problems for semi-linear sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On some counting problems for semi-linear sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On some counting problems for semi-linear sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-110345