nonnegative number
Recently Published Documents


TOTAL DOCUMENTS

5
(FIVE YEARS 1)

H-INDEX

1
(FIVE YEARS 0)

Author(s):  
LINGLING HUANG ◽  
CHAO MA

Abstract This paper is concerned with the growth rate of the product of consecutive partial quotients relative to the denominator of the convergent for the continued fraction expansion of an irrational number. More precisely, given a natural number $m,$ we determine the Hausdorff dimension of the following set: $$ \begin{align*} E_m(\tau)=\bigg\{x\in [0,1): \limsup\limits_{n\rightarrow\infty}\frac{\log (a_n(x)a_{n+1}(x)\cdots a_{n+m}(x))}{\log q_n(x)}=\tau\bigg\}, \end{align*} $$ where $\tau $ is a nonnegative number. This extends the dimensional result of Dirichlet nonimprovable sets (when $m=1$ ) shown by Hussain, Kleinbock, Wadleigh and Wang.



2018 ◽  
Vol 98 (2) ◽  
pp. 212-220
Author(s):  
ARTŪRAS DUBICKAS

For a positive integer $d$ and a nonnegative number $\unicode[STIX]{x1D709}$, let $N(d,\unicode[STIX]{x1D709})$ be the number of $\unicode[STIX]{x1D6FC}\in \overline{\mathbb{Q}}$ of degree at most $d$ and Weil height at most $\unicode[STIX]{x1D709}$. We prove upper and lower bounds on $N(d,\unicode[STIX]{x1D709})$. For each fixed $\unicode[STIX]{x1D709}>0$, these imply the asymptotic formula $\log N(d,\unicode[STIX]{x1D709})\sim \unicode[STIX]{x1D709}d^{2}$ as $d\rightarrow \infty$, which was conjectured in a question at Mathoverflow [https://mathoverflow.net/questions/177206/].



2015 ◽  
Vol 52 (4) ◽  
pp. 537-558 ◽  
Author(s):  
Beáta Bényi ◽  
Péter Hajnal

The Bn(k) poly-Bernoulli numbers — a natural generalization of classical Bernoulli numbers (Bn = Bn(1)) — were introduced by Kaneko in 1997. When the parameter k is negative then Bn(k) is a nonnegative number. Brewbaker was the first to give combinatorial interpretation of these numbers. He proved that Bn(−k) counts the so called lonesum 0–1 matrices of size n × k. Several other interpretations were pointed out. We survey these and give new ones. Our new interpretation, for example, gives a transparent, combinatorial explanation of Kaneko’s recursive formula for poly-Bernoulli numbers.





Author(s):  
Martin H. Weik
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document