arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.3005cs.DMcs.FL
收藏

关于半线性集的若干计数问题

On some counting problems for semi-linear sets

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio

摘要:

令$X$是$\N^t$或$\Z^t$的子集。我们可以将$X$与一个函数${\cal G}_X:\N^t\longrightarrow\N$相关联,该函数对于每个$(n_1, ..., n_t)\in \N^t$返回所有向量$x\in X$的个数${\cal G}_X(n_1, ..., n_t)$,使得对于每个$i=1,..., t, |x_{i}| \leq n_{i}$。该函数称为$X$的{ \em增长函数}。本文的主要结果是$\N^t$或$\Z^t$的半线性集的增长函数是箱样条。利用这个结果和半线性集上的一些定理,我们给出了Dahmen和Micchelli关于丢番图线性方程组计数函数的一个著名定理的组合味的新证明.

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑