English
Related papers

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

200 papers

In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…

Combinatorics · Mathematics 2020-12-01 Kaarel Hänni

By the von Neumann inequality for homogeneous polynomials there exists a positive constant $C_{k,q}(n)$ such that for every $k$-homogeneous polynomial $p$ in $n$ variables and every $n$-tuple of commuting operators $(T_1, \dots, T_n)$ with…

Functional Analysis · Mathematics 2015-06-29 Daniel Galicer , Santiago Muro , Pablo Sevilla-Peris

Let $S_k(N)$ denote the space of cusp forms of even integer weight $k$ and level $N$. We prove an asymptotic for the Petersson trace formula for $S_k(N)$ under an appropriate condition. Using the non-vanishing of a Kloosterman sum involved…

Number Theory · Mathematics 2024-11-27 Jishu Das

Let $\mathcal{A}$ be a unital $\mathbf{C}^*$-algebra with unit $e$. We develop several inequalities for a positive linear functional $f$ on $\mathcal{A}$ and obtain several bounds for the numerical radius $v(a)$ of an element $a\in…

Functional Analysis · Mathematics 2024-10-04 Pintu Bhunia

We compute asymptotic formulas for the $k^{\rm th}$ Fourier coefficients of $b_\lambda^n$, where $b_\lambda(z)=\frac{z-\lambda}{1-\lambda z}$ is the Blaschke factor associated to $\lambda\in\mathbb{D}$, $k\in[0,\infty)$ and $n$ is a large…

Complex Variables · Mathematics 2021-07-02 Alexander Borichev , Karine Fouchet , Rachid Zarouf

The set of all error--correcting block codes over a fixed alphabet with $q$ letters determines a recursively enumerable set of rational points in the unit square with coordinates $(R,\delta)$:= (relative transmission rate, relative minimal…

Information Theory · Computer Science 2015-03-20 Yuri I. Manin , Matilde Marcolli

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

Number Theory · Mathematics 2026-02-16 Meselem Karras

Let $G=(V,E)$ be a finite undirected graph. A set $S$ of vertices in $V$ is said to be total $k$-dominating if every vertex in $V$ is adjacent to at least $k$ vertices in $S$. The total $k$-domination number, $\gamma_{kt}(G)$, is the…

Combinatorics · Mathematics 2022-05-11 Walter Carballosa , Justin Wisby

For integers $k,t \geq 2$, and $1\leq r \leq t$ let $D_k^\times(r,t;n)$ be the number of parts among all $k$-indivisible partitions of $n$ (i.e., partitions where all parts are not divisible by $k$) of $n$ that are congruent to $r$ modulo…

Combinatorics · Mathematics 2025-09-30 Faye Jackson , Misheel Otgonbayar

$ $Let $F$ be a multivariate function from a product set $\Sigma^n$ to an Abelian group $G$. A $k$-partition of $F$ with cost $\delta$ is a partition of the set of variables $\mathbf{V}$ into $k$ non-empty subsets $(\mathbf{X}_1, \dots,…

Machine Learning · Computer Science 2020-03-31 Andrej Bogdanov , Baoxiang Wang

Let $\overline{p}(n)$ denote the overpartition function. In this paper, our primary goal is to study the asymptotic behavior of the finite differences of the logarithm of the overpartition function, i.e., $(-1)^{r-1}\Delta^r \log \p(n)$, by…

Number Theory · Mathematics 2022-04-04 Gargi Mukherjee

We determine the optimal inequality of the form $\sum_{k=1}^m a_k\sin kx\leq 1$, in the sense that $\sum_{k=1}^m a_k$ is maximal. We also solve exactly the analogous problem for the sawtooth (or signed fractional part) function.…

Algebraic Geometry · Mathematics 2021-09-30 Louis Esser , Terence Tao , Burt Totaro , Chengxi Wang

Here we study the quantity $$ \tau_{n,k}:=\frac{|T_n^{(k)}(\omega_{n,k})|}{T_n^{(k)}(1)}\,, $$ where $T_n$ is the $n$-th Chebyshev polynomial of the first kind and $\omega_{n,k}$ is the largest zero of $T_n^{(k+1)}$. Since the absolute…

Classical Analysis and ODEs · Mathematics 2022-03-11 Nikola Naidenov , Geno Nikolov

Let ${\bf P}_k^{(\alpha, \beta)} (x)$ be an orthonormal Jacobi polynomial of degree $k.$ We will establish the following inequality \begin{equation*} \max_{x \in [\delta_{-1},\delta_1]}\sqrt{(x- \delta_{-1})(\delta_1-x)}…

Classical Analysis and ODEs · Mathematics 2007-05-23 Ilia Krasikov

Let $d^{(k)}(n)$ be the $k$-free divisor function for integer $k\ge2$. Let $a$ be a nonzero integer. In this paper, we establish an asymptotic formula \begin{equation*} \sum_{p\leq x} d^{(k)}(p-a) =b_k \cdot x+O\left(\frac{x}{\log x}\right)…

Number Theory · Mathematics 2024-06-19 Biao Wang

We consider the real $\beta$-ensemble (or 1D log-gas) of dimension $N$ in the high-temperature regime, \textit{i.e.} where the inverse temperature $\beta$ scales as $N\beta=2P$ with $P$ a fixed positive parameter. We establish the large-$N$…

Probability · Mathematics 2026-05-12 Charlie Dworaczek Guera

Using the Davenport-Heilbronn circle method, we show that for almost all additive Diophantine inequalities of degree $k$ in more than $2k$ variables the expected asymptotic formula for the density of solutions holds true. This appears to be…

Number Theory · Mathematics 2011-10-18 Jörg Brüdern , Rainer Dietmann

Let $j,n$ be even positive integers, and let $\overline{p}_j(n)$ denote the number of partitions with BG-rank $j$, and $\overline{p}_j(a,b;n)$ to be the number of partitions with BG-rank $j$ and $2$-quotient rank congruent to $a \pmod{b}$.…

Number Theory · Mathematics 2022-09-27 Andrew Baker , Joshua Males

This note focuses on the properties of two blocks of elements of the probability mass function (pmf) of the Poisson distribution of order $k\ge2$. The first block is the elements for $n\in[1,k]$ and the second block is the elements for…

Probability · Mathematics 2023-10-10 S. R. Mane

We study the extent to which divisors of a typical integer $n$ are concentrated. In particular, defining the Erd\H{o}s-Hooley $\Delta$-function by $\Delta(n) := \max_t \# \{d | n, \log d \in [t,t+1]\}$, we show that $\Delta(n) \geq (\log…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Ben Green , Dimitris Koukoulopoulos