基于Kronecker型替换的黑盒多项式稀疏插值

本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的.     

Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.     

On amenability of two-generator groups

A discrete group G is amenable if there exists a finitely additive probability measure on G which is invariant under left translations and is defined on all subsets of G. It is proved that if the group is generated by two elements and is amenable then there are words being relators whose most of the consecutive pairs of the letters belong to a certain four-element set of pairs. This fact is applied to reproving non-amenability of a braid group. The same group provides an example showing that such type of condition is not su?cient for amenabilty.