English
Related papers

Related papers: On Markov-Duffin-Schaeffer inequalities with a maj…

200 papers

In this paper, we establish the multiplicative ergodic theorem for McKean-Vlasov stochastic differential equations, in which the Lyapunov exponent is defined using the upper limit. The reasonability of this definition is illustrated through…

Dynamical Systems · Mathematics 2024-01-19 Xianjin Cheng , Zhenxin Liu , Lixin Zhang

We present positivity conjectures for the Schur expansion of Jack symmetric functions in two bases given by binomial coefficients. Partial results suggest that there are rich combinatorics to be found in these bases, including Eulerian…

Combinatorics · Mathematics 2026-02-17 Per Alexandersson , James Haglund , George Wang

We study upper bounds on the Schur multiplier norm of Loewner matrices for concave and convex functions. These bounds then immediately lead to upper bounds on the ratio of Schatten $q$-norms of commutators…

Functional Analysis · Mathematics 2014-10-24 Koenraad M. R. Audenaert

We prove that if $\Sigma_{\mathbf A}(\mathbb N)$ is an irreducible Markov shift space over $\mathbb N$ and $f:\Sigma_{\mathbf A}(\mathbb N) \rightarrow \mathbb R$ is coercive with bounded variation then there exists a maximizing probability…

Dynamical Systems · Mathematics 2019-02-20 Rodrigo Bissacot , Ricardo Freire

We explore the Steklov eigenvalue problem on convex polygons, focusing mainly on the inverse Steklov problem. Our primary finding reveals that, for almost all convex polygonal domains, there exist at most finitely many non-congruent domains…

Spectral Theory · Mathematics 2024-08-06 Emily B. Dryden , Carolyn Gordon , Javier Moreno , Julie Rowlett , Carlos Villegas-Blas

We consider M-estimators and derive supremal-inequalities of exponential-or polynomial type according as a boundedness- or a moment-condition is fulfilled. This enables us to derive rates of r-complete convergence and also to show r-qick…

Statistics Theory · Mathematics 2023-11-30 Dietmar Ferger

We give lower bounds for the degree of the discriminant with respect to y of separable polynomials f in K[x,y] over an algebraically closed field of characteristic zero. Depending on the invariants involved in the lower bound, we give a…

Algebraic Geometry · Mathematics 2015-07-07 Denis Simon , Martin Weimann

Descent polynomials and peak polynomials, which enumerate permutations with given descent and peak sets respectively, have recently received considerable attention. We give several formulas for $q$-analogs of these polynomials which refine…

Combinatorics · Mathematics 2021-11-12 Christian Gaetz , Yibo Gao

Recently Marcus, Spielman and Srivastava proved Weaver's ${\rm{KS}}_r$ conjecture, which gives a positive solution to the Kadison-Singer problem. Cohen and Br\"and\'en independently extended this result to obtain the arbitrary-rank version…

Combinatorics · Mathematics 2021-06-18 Zhiqiang Xu , Zili Xu , Ziheng Zhu

Let $P(z)$ be a polynomial of degree $n$ having no zero in $|z|<k$ where $k\geq 1,$ then for every real or complex number $\alpha$ with $|\alpha|\geq 1$ it is known \begin{equation*} \underset{|z|=1}{\max}|D_\alpha P(z)|\leq…

Complex Variables · Mathematics 2014-03-11 N. A. Rather , S. H. Ahangar , Suhail Gulzar

We study the lower bound for Koldobsky's slicing inequality. We show that there exists a measure $\mu$ and a symmetric convex body $K \subseteq \mathbb{R}^n$, such that for all $\xi\in S^{n-1}$ and all $t\in \mathbb{R},$…

Metric Geometry · Mathematics 2023-07-19 Bo'az Klartag , Galyna V. Livshyts

We establish Hadamard-type inequalities for a class of symmetric matrices called $k$-positive matrices for which the $m$-th elementary symmetric functions of their eigenvalues are positive for all $m\leq k$. These matrices arise naturally…

Rings and Algebras · Mathematics 2021-12-14 Nam Q. Le

We resolve two open problems on Kronecker coefficients $g(\lambda,\mu,\nu)$ of the symmetric group. First, we prove that for partitions $\lambda,\mu,\nu$ with fixed Durfee square size, the Kronecker coefficients grow at most polynomially.…

Combinatorics · Mathematics 2022-12-23 Igor Pak , Greta Panova

In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as "Birch sums". Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the…

Number Theory · Mathematics 2020-07-15 Youness Lamzouri

Let $\varphi$ be a quasi-psh function on a complex manifold $X$ and let $S\subset X$ be a complex submanifold. Then the multiplier ideal sheaves $\mathcal{I}(\varphi|_S)\subset\mathcal{I}(\varphi)|_{S}$ and the complex singularity exponents…

Complex Variables · Mathematics 2021-01-21 Xiankui Meng , Xiangyu Zhou

In $\mathbb{R}^n$, we establish an asymptotically sharp upper bound for the upper Minkowski dimension of $k$-porous sets having holes of certain size near every point in $k$ orthogonal directions at all small scales. This bound tends to…

Classical Analysis and ODEs · Mathematics 2017-01-31 Esa Järvenpää , Maarit Järvenpää , Antti Käenmäki , Ville Suomala

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

Number Theory · Mathematics 2010-11-16 Eduardo Duenez , Steven J. Miller , Howard Straubing , Amitabha Roy

We consider the discrete nonlinear Schr{\"o}dinger equations on a one dimensional lattice of mesh h, with a cubic focusing or defocusing nonlinearity. We prove a polynomial bound on the growth of the discrete Sobolev norms, uniformly with…

Numerical Analysis · Mathematics 2018-11-07 Joackim Bernier

Let $u(t,x)$ be a solution of the heat equation in $\mathbb{R}^n$. Then, each $k-$th derivative also solves the heat equation and satisfies a maximum principle, the largest $k-$th derivative of $u(t,x)$ cannot be larger than the largest…

Analysis of PDEs · Mathematics 2021-02-09 Stefan Steinerberger

We consider the problem of estimating the support size of a discrete distribution whose minimum non-zero mass is at least $ \frac{1}{k}$. Under the independent sampling model, we show that the sample complexity, i.e., the minimal sample…

Statistics Theory · Mathematics 2016-12-13 Yihong Wu , Pengkun Yang