arXivDaily arXiv每日学术速递 周一至周五更新
重置
math.CA经典分析4
2606.11621 2026-06-11 math.CA math.CV 新提交

The general Brannan coefficient conjecture II: Meijer-function approximations

一般Brannan系数猜想II:Meijer函数逼近

T. M. Dunster

AI总结 本文通过Meijer G函数逼近和修正Watson逼近,结合复合Laplace积分表示,证明了Brannan关于系数A_n(α,β,ω)模的猜想对所有奇数n≥5成立,从而完成猜想的证明。

详情
AI中文摘要

考虑Maclaurin展开$(1+\omega z)^{\alpha}(1-z)^{-\beta}=\sum_{n=0}^{\infty} A_n(\alpha,\beta,\omega)z^n$中的系数$A_n(\alpha,\beta,\omega)$,其中$|\omega|=1$且$\alpha,\beta\in(0,1]$。D. A. Brannan在1973年的一篇论文中猜想,对于每个正奇数$n$,有$|A_n(\alpha,\beta,\omega)|\le A_n(\alpha,\beta,1)$。作者最近在$\omega=-1$的一个小邻域之外证明了该猜想。本文通过结合复合Laplace积分表示与两种局部逼近来处理剩余范围:对于有界的$n|\arg(-\omega)|$,使用Meijer $G$函数逼近;对于互补范围,使用修正的Watson逼近。所得下界将问题简化为对紧参数集上显式函数的数值正性检验。这些计算验证了不等式对所有$\alpha,\beta\in(0,1]$和所有奇数$n\ge5$成立,因此,结合Brannan对$n=3$的结果,完成了其猜想的证明。

英文摘要

The coefficients $A_n(\alpha,\beta,\omega)$ in the Maclaurin expansion $(1+\omega z)^{\alpha}(1-z)^{-\beta}=\sum_{n=0}^{\infty} A_n(\alpha,\beta,\omega)z^n$ are considered for $|\omega|=1$ and $\alpha,\beta\in(0,1]$. D. A. Brannan conjectured in a 1973 paper that $|A_n(\alpha,\beta,\omega)|\le A_n(\alpha,\beta,1)$ for every positive odd integer $n$. The present author recently established the conjecture outside a small neighbourhood of $\omega=-1$. The remaining range is treated here by combining compound Laplace integral representations with two types of local approximation: a Meijer $G$ function approximation for $n|\arg(-\omega)|$ bounded, and a modified Watson approximation for the complementary range. The resulting lower bounds reduce the problem to numerical positivity checks for explicit functions on compact parameter sets. These computations verify the inequality for all $\alpha,\beta\in(0,1]$ and all odd integers $n\ge5$, and hence, together with Brannan's result for $n=3$, complete the proof of his conjecture.

2606.11426 2026-06-11 math.OC math.CA q-bio.QM 新提交

Sharpness characterizes Hill functions

Sharpness刻画Hill函数

Marc Stephan

AI总结 本文严格证明了在有理函数中,Hill函数是半对数尺度下导数上确界(sharpness)达到最大值的唯一函数,且sharpness不超过Hill系数n/4。

详情
Comments
10 pages, 2 figures
AI中文摘要

虽然长期以来被视为经验拟合,但Martinez-Corral、Nam、DePace和Gunawardena提出Hill函数是输入-输出响应sharpness的通用Hopfield屏障。Hopfield屏障是生物系统在不消耗能量的情况下处理信息的基本限制。他们的论证基于Hill系数$4$和$6$的数值结果。我们给出了精确表述和证明:通过半对数尺度下导数的上确界衡量sharpness,任何具有实系数$0\leq \alpha_i\leq \beta_i$的有理函数$r(x)=(\alpha_0+\alpha_1 x+ \cdots +\alpha_n x^n)/(\beta_0 + \beta_1 x+ \cdots + \beta_n x^n)$的sharpness至多为$n/4$,当且仅当$r$是Hill系数为$n$的Hill函数时取等。

英文摘要

While long treated as empirical fits, Hill functions have been postulated to be the universal Hopfield barrier for sharpness of input-output responses by Martinez-Corral, Nam, DePace, and Gunawardena. A Hopfield barrier is a fundamental limit on how well biological systems can process information without expending energy. Their case rested on numerical findings for Hill coefficients $4$ and $6$. We give a precise formulation and proof of this: measuring sharpness by the supremum of the derivative in semi-log scale, any rational function $r(x)=(\alpha_0+\alpha_1 x+ \cdots +\alpha_n x^n)/(\beta_0 + \beta_1 x+ \cdots + \beta_n x^n)$ with real coefficients $0\leq \alpha_i\leq \beta_i$ has sharpness at most $n/4$, with equality if and only if $r$ is a Hill function with Hill coefficient $n$.

2606.02847 2026-06-11 math.CA math.FA math.PR 版本更新

Sharp log-Sobolev inequalities on finite cyclic groups

带词长的有限循环群的尖锐对数Sobolev不等式

Xinyuan Xie, Haonan Zhang

AI总结 本文证明了对于均匀概率测度下的循环群Z_n,带词长ψ_n(k)=min(k,n-k)的拉普拉斯算子满足尖锐对数Sobolev不等式,常数2π与n无关(n≥4)。

详情
Comments
10 pages. Presentation revised. Circle case added
AI中文摘要

设$\mathbb Z_n$为配备均匀概率测度$\pi$的循环群,$-A_{\psi_n}$为关于词长$\psi_n(k) = \min(k,n-k)$的拉普拉斯算子。我们证明了尖锐的对数Sobolev不等式$$ \operatorname{Ent}_{\pi}(f^2) \le 2\pi\bigl(f A_{\psi_n} f\bigr), \qquad f:\mathbb Z_n \to \mathbb C, $$ 对所有$n \ge 4$成立。证明受Frank和Ivanisvili~\cite{FrankIvanisvili2026}关于最近邻简单随机游走的尖锐对数Sobolev不等式工作的启发。我们使用他们的三次主项约化思想,但将他们的高频估计替换为适应词长乘子的傅里叶块估计。同样的结果最近也被Yao~\cite{Yao2026}使用完全不同的方法得到。

英文摘要

Let $\mathbb Z_n$ be the cyclic group equipped with the uniform probability measure $\pi$, and let $A_{\psi_n}$ be the Laplacian with word length \[ \psi_n(k) = \min(k,n-k). \] We prove the sharp log-Sobolev inequality \[ \text{Ent}_{\pi}(f^2) \le 2\pi(f A_{\psi_n} f), \qquad f:\mathbb Z_n \to [0,\infty), \] for every $n \ge 4$. The proof is inspired by the recent work of Frank and Ivanisvili~\cite{FrankIvanisvili2026} on a sharp log-Sobolev inequality for nearest-neighbor simple random walk. We use their cubic-majorant reduction, which turns the problem into a 3rd moment estimate; the new point is a blockwise 3rd moment estimate adapted to the word-length multiplier. The same 3rd moment argument also recovers the log-Sobolev inequality for Poisson-semigroup on the circle, first proved by Weissler~\cite{Weissler1980}. The same sharp inequalities were also obtained recently by Yao~\cite{Yao2026} by a different method.

2002.07589 2026-06-11 math.CA

Weighted inequalities in ergodic theory via transference

Sakin Demir

详情
英文摘要

We first extend Calderón's transfer principle to weighted spaces, and then we apply our results to obtain some new weighted inequalities in ergodic theory and ergodic $H^1$ spaces.