English
Related papers

Related papers: Asymptotics and inequalities for the broken $k$-di…

200 papers

We apply the Euler--Maclaurin formula to find the asymptotic expansion of the sums $\sum_{k=1}^n (\log k)^p / k^q$, ~$\sum k^q (\log k)^p$, ~$\sum (\log k)^p /(n-k)^q$, ~$\sum 1/k^q (\log k)^p $ in closed form to arbitrary order ($p,q…

Combinatorics · Mathematics 2007-05-23 Daniel B. Grünberg

Let $L$ be the Hill operator or the one dimensional Dirac operator on the interval $[0,\pi].$ If $L$ is considered with Dirichlet, periodic or antiperiodic boundary conditions, then the corresponding spectra are discrete and for large…

Spectral Theory · Mathematics 2013-09-09 Plamen Djakov , Boris Mityagin

One of the fundamental theorems of uniform distribution theory states that the fractional parts of the sequence $(n \alpha)_{n \geq 1}$ are uniformly distributed modulo one (u.d. mod 1) for every irrational number $\alpha$. Another…

Number Theory · Mathematics 2015-02-26 Christoph Aistleitner , Roswitha Hofer , Gerhard Larcher

Upper bounds for GCD sums of the form [\sum_{k,{\ell}=1}^N\frac{(\gcd(n_k,n_{\ell}))^{2\alpha}}{(n_k n_{\ell})^\alpha}] are proved, where $(n_k)_{1 \leq k \leq N}$ is any sequence of distinct positive integers and $0<\alpha \le 1$; the…

Number Theory · Mathematics 2013-11-12 Christoph Aistleitner , Istvan Berkes , Kristian Seip

We study codes that can correct backtracking errors during nanopore sequencing. In this channel, a sequence of length $n$ over an alphabet of size $q$ is being read by a sliding window of length $\ell$, where from each window we obtain only…

Information Theory · Computer Science 2024-08-16 Wenjun Yu , Zuo Ye , Moshe Schwartz

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…

Discrete Mathematics · Computer Science 2019-11-14 Joel Friedman , David Kohler

In this paper we prove asymptotic formulas for the $L^p$ norms of $P_n(\theta)=\prod_{k=1}^n (1-e^{ik\theta})$ and $Q_n(\theta)=\prod_{k=1}^n (1+e^{ik\theta})$. These products can be expressed using $\prod_{k=1}^n…

Classical Analysis and ODEs · Mathematics 2012-10-30 Jordan Bell

This paper is the second part of the study. In Part~I, self-similar solutions of a weighted fast diffusion equation (WFD) were related to optimal functions in a family of subcritical Caffarelli-Kohn-Nirenberg inequalities (CKN) applied to…

Analysis of PDEs · Mathematics 2016-06-21 Matteo Bonforte , Jean Dolbeault , Matteo Muratori , Bruno Nazaret

\[ \left\{ \begin{array} [c]{lll} -\left( \Delta_{p}+\Delta_{q(p)}\right) u=\lambda_{p}\left\vert u(x_{u})\right\vert ^{p-2}u(x_{u})\delta_{x_{u}} & \mathrm{in} & \Omega\\ u=0 & \mathrm{on} & \partial\Omega, \end{array} \right. \] where…

Analysis of PDEs · Mathematics 2019-01-23 Claudianor Alves , Grey Ercole , Gilberto de Assis Pereira

The function $\inf_n nx^{1/n}$ has the asymptotics $eu+e d^2(u)/(2u)+O(1/u^2)$ as $x\to\infty$, where $u=\log x$ and $d(u)$ is the distance from $u$ to the nearest integer. We generalize this observation. First, the curves $y=nx^{1/n}$ can…

Classical Analysis and ODEs · Mathematics 2022-10-17 Sergey Sadov

Let $[q] = \{0,1,\ldots,q-1\}$, let $\Delta[q]$ denote the simplex of probability measures on $[q]$, and let $\gamma$ denote the Lebesgue measure normalized on $\Delta[q]$. We prove that for any symmetric monotone function $f \colon[q]^n…

Probability · Mathematics 2026-05-20 Saba Lepsveridze , Allen Lin

We investigate univalent functions $f(z)=z+a_2z^2+a_3z^3+\ldots$ in the unit disk $\mathbb D$ extendible to $k$-q.c.(=quasiconformal) automorphisms of $\mathbb C$. In particular, we answer a question on estimation of $|a_3|$ raised by…

Complex Variables · Mathematics 2019-05-22 Pavel Gumenyuk , Ikkei Hotta

We study the asymptotic behavior of the maximal multiplicity $M_n=M_n(\sigma)$ of the blocks in a set partition of $[n]=\{1,2,...,n\}$, assuming that $\sigma$ is chosen uniformly at random from the set of all such partitions. Let $W=W(n)$…

Combinatorics · Mathematics 2019-10-21 Ljuben Mutafchiev , Mladen Savov

Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for $p(n)$ and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion…

Number Theory · Mathematics 2022-09-19 Koustav Banerje , Peter Paule , Cristian-Silviu Radu , Carsten Schneider

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Assume that $G$ is a graph with edge ideal $I(G)$. We prove that the modules $S/\overline{I(G)^k}$ and…

Commutative Algebra · Mathematics 2018-08-13 S. A. Seyed Fakhari

We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of…

Probability · Mathematics 2007-05-23 Gregory Freiman , Boris Granovsky

For each $1\leq i \le n$, let $k_i\geq 1$ and let $\Delta_i$ be a set of vertices of a non-degenerate simplex of $k_i+1$ points in $\mathbb{R}^{k_i+1}$. If $A\subseteq [0,1]^{k_1+1}\times \cdots \times [0,1]^{k_n+1}$ is a Lebesgue…

Combinatorics · Mathematics 2022-06-22 Polona Durcik , Mario Stipčić

Let $X=\sum_{k=1}^\infty X_k \beta^{-k}$ be the base-$\beta$ expansion of a continuous random variable $X$ on the unit interval where $\beta$ is the positive solution to $\beta^n = 1 + \beta + \cdots + \beta^{n-1}$ for an integer $n\ge 2$…

Probability · Mathematics 2024-12-18 Ira W. Herbst , Jesper Møller , Anne Marie Svane

We study the half-integral $k$-Directed Disjoint Paths Problem ($\tfrac12$kDDPP) in highly strongly connected digraphs. The integral kDDPP is NP-complete even when restricted to instances where $k=2$, and the input graph is $L$-strongly…

Combinatorics · Mathematics 2016-11-04 Katherine Edwards , Irene Muzi , Paul Wollan

Let $G$ and $H$ be $k$-graphs ($k$-uniform hypergraphs); then a perfect $H$-packing in $G$ is a collection of vertex-disjoint copies of $H$ in $G$ which together cover every vertex of $G$. For any fixed $H$ let $\delta(H, n)$ be the minimum…

Combinatorics · Mathematics 2015-09-16 Richard Mycroft