中文
相关论文

相关论文: Multiplicativity of Maximal p-Norms in Werner-Hole…

200 篇论文

In this paper, we study the generalized volume conjecture for the colored Jones polynomials of links with complements containing more than one hyperbolic piece. First of all, we construct an infinite family of prime links by considering the…

几何拓扑 · 数学 2020-11-06 Ka Ho Wong

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

数论 · 数学 2007-05-23 Pieter Moree , Peter Stevenhagen

The Multiplicity conjecture of Herzog, Huneke, and Srinivasan states an upper bound for the multiplicity of any graded $k$-algebra as well as a lower bound for Cohen-Macaulay algebras. In this note we extend this conjecture in several…

交换代数 · 数学 2007-05-23 Juan Migliore , Uwe Nagel , Tim Roemer

In this paper we prove and discuss some new $\left( H_{p},weak-L_{p}\right) $ type inequalities of maximal operators of $T$ means with respect to Vilenkin systems with monotone coefficients. We also apply these results to prove a.e.…

综合数学 · 数学 2025-09-25 G. Tutberidze

In this work, we extend the theory of B\'ekoll\`e-Bonami $B_p$ weights. Here we replace the constant $p$ by a non-negative measurable function $p(\cdot),$ which is log-H\"older continuous function with lower bound $1$. We show that the…

P\'or and Wood conjectured that for all $k,l \ge 2$ there exists $n \ge 2$ with the following property: whenever $n$ points, no $l + 1$ of which are collinear, are chosen in the plane and each of them is assigned one of $k$ colours, then…

组合数学 · 数学 2014-10-13 Vytautas Gruslys

Every channel can be expressed as a convex combination of deterministic channels with each deterministic channel corresponding to one particular intrinsic state. Such convex combinations are in general not unique, each giving rise to a…

信息论 · 计算机科学 2020-04-28 Shengtian Yang , Rui Xu , Jun Chen , Jian-Kang Zhang

Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…

组合数学 · 数学 2014-12-04 Samuel Fiorini , Selim Rexhep

We show that $\ell_p$ norms are characterized as the unique norms which are both invariant under coordinate permutation and multiplicative with respect to tensor products. Similarly, the $L_p$ norms are the unique rearrangement-invariant…

泛函分析 · 数学 2012-11-08 Guillaume Aubrun , Ion Nechita

Recent research has demonstrated significant achievable performance gains by exploiting circularity/non-circularity or propeness/improperness of complex-valued signals. In this paper, we investigate the influence of these properties on…

信息论 · 计算机科学 2016-11-17 Georg Tauboeck

Extending the methods developed in the author's previous paper and using adapted coordinate systems in two variables, an L^p boundedness theorem is proven for maximal operators over hypersurfaces in R^3 when p > 2. When the best possible p…

经典分析与常微分方程 · 数学 2010-08-25 Michael Greenblatt

We study estimation of multivariate densities $p$ of the form $p(x)=h(g(x))$ for $x\in \mathbb {R}^d$ and for a fixed monotone function $h$ and an unknown convex function $g$. The canonical example is $h(y)=e^{-y}$ for $y\in \mathbb {R}$;…

统计理论 · 数学 2012-11-15 Arseni Seregin , Jon A. Wellner

For Bernoulli site percolation on an infinite, connected, locally finite graph $G=(V,E)$, we obtain quantitative upper bounds on the supercritical disconnection probability \[ \mathbb{P}_p(S\nleftrightarrow\infty) \] for arbitrary finite or…

概率论 · 数学 2026-03-18 Zhongyang Li

We prove the boundedness of the maximal operator and Hilbert transform along certain variable parabolas in $L^p$ for $p>p_0$ with some $p_0\in (1, 2)$. Connections with the Hilbert transform along vector fields and the polynomial Carleson's…

经典分析与常微分方程 · 数学 2015-05-04 Shaoming Guo

We prove the Courtade-Kumar conjecture, for certain classes of $n$-dimensional Boolean functions, $\forall n\geq 2$ and for all values of the error probability of the binary symmetric channel, $\forall 0 \leq p \leq \frac{1}{2}$. Let…

信息论 · 计算机科学 2017-02-15 Septimia Sarbu

Motivated by the Erd\H{o}s--S\'{o}s bipartite link conjecture, F\"{u}redi (Oberwolfach, 2004) asked for the asymptotic maximum edge density $\pi_{\mathrm{link}}(t)$ of $3$-graphs in which the link graph of every vertex is $t$-partite.…

组合数学 · 数学 2026-05-13 Jianfeng Hou , Xinmin Hou , Xizhi Liu , Jiasheng Zeng , Yixiao Zhang

An elementary proof is provided of sharp bounds for the varentropy of random vectors with log-concave densities, as well as for deviations of the information content from its mean. These bounds significantly improve on the bounds obtained…

概率论 · 数学 2019-03-06 Matthieu Fradelizi , Mokshay Madiman , Liyao Wang

Let $\Omega$ be a bounded, smooth domain of $\mathbb{R}^{N},$ $N\geq1.$ For each $p>N$ we study the optimal function $s=s_{p}$ in the pointwise inequality \[ \left\vert v(x)\right\vert \leq s(x)\left\Vert \nabla v\right\Vert…

偏微分方程分析 · 数学 2020-04-21 Grey Ercole , Gilberto de Assis Pereira

For each prime $p\equiv 1\pmod{4}$ consider the Legendre character $\chi=(\frac{\cdot}{p})$. Let $p_\pm(n)$ be the number of partitions of $n$ into parts $\lambda>0$ such that $\chi(\lambda)=\pm 1$. Petersson proved a beautiful limit…

数论 · 数学 2020-12-01 Carlos Castaño-Bernard , Florian Luca

In this paper, we recast a special case of Mahler'c conjecture by the maximum value of box splines. This is the case of polytopes with at most $2n+2$ facets. An asymptotic formula for univariate box splines is given. Based on the formula,…

度量几何 · 数学 2009-01-06 Zhiqiang Xu