arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.08520math.COmath.LO
收藏

参数化Presburger算术:逻辑、组合学与准多项式行为

Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior

Tristram Bogart, John Goodrick, Kevin Woods

摘要:

参数Presburger算术涉及集合S_t在Z^d中的族,其中t在N中,这些集合是使用加法、不等式、Z中的常数、布尔运算、乘以t和变量范围在Z上的量词来定义的。也就是说,这样的族是使用量词和形式为a(t)x <= b(t)的公式的布尔组合来定义的,其中a(t)在Z[t]^d中,b(t)在Z[t]中。函数g:N -> Z是拟多项式,如果存在周期m和多项式f_0,.,f_{m-1}在Q[t]中,使得g(t)=f_i(t),其中t全等于i(mod m.)Chen、Li、Sam的最新结果; Calegari、Walker; Roune、Woods;和Shen关注参数Presburger算术中表现出准多项式行为的特定族。例如,S_t可能是t的准多项式函数,或者S_t中的元素x(t)可以指定为具有准多项式坐标的函数,对于足够大的t。伍兹指出,所有参数Presburger集都表现出这种准多项式行为。在这里,我们证明这个猜想,使用各种工具,从逻辑和组合。

英文摘要:

Parametric Presburger arithmetic concerns families of sets S_t in Z^d, for t in N, that are defined using addition, inequalities, constants in Z, Boolean operations, multiplication by t, and quantifiers on variables ranging over Z. That is, such families are defined using quantifiers and Boolean combinations of formulas of the form a(t) x <= b(t), where a(t) is in Z[t]^d, b(t) in Z[t]. A function g: N -> Z is a quasi-polynomial if there exists a period m and polynomials f_0, ..., f_{m-1} in Q[t] such that g(t)=f_i(t) for t congruent to i (mod m.) Recent results of Chen, Li, Sam; Calegari, Walker; Roune, Woods; and Shen concern specific families in parametric Presburger arithmetic that exhibit quasi-polynomial behavior. For example, S_t might be an a quasi-polynomial function of t or an element x(t) in S_t might be specifiable as a function with quasi-polynomial coordinates, for sufficiently large t. Woods conjectured that all parametric Presburger sets exhibit this quasi-polynomial behavior. Here, we prove this conjecture, using various tools from logic and combinatorics.

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

↑