adv

A note on the asymptotics of the number of O-sequences of given length. (arXiv:1810.07326v1 [math.AC])

We look at the number $L(n)$ of $O$-sequences of length $n$. This interesting and naturally-defined sequence $L(n)$ was first investigated in a recent paper by commutative algebraists Enkosky and Stone, inspired by Huneke. In this note, we significantly improve both of their upper and lower bounds, by means of a very short partition-theoretic argument. In particular, it turns out that, for suitable positive constants $c_1$ and $c_2$ and all $n\ge 1$, $$e^{c_1\sqrt{n}}\le L(n)\le e^{c_2\sqrt{n}\log n}.$$ It remains an open problem to determine an exact asymptotic estimate for $L(n)$.查看全文

Solidot 文章翻译

你的名字

留空匿名提交
你的Email或网站

用户可以联系你
标题

简单描述
内容