English
Related papers

Related papers: $(P,Q)$ complex hypercontractivity

200 papers

We study the computational complexity of approximating the 2->q norm of linear operators (defined as ||A||_{2->q} = sup_v ||Av||_q/||v||_2), as well as connections between this question and issues arising in quantum information theory and…

Computational Complexity · Computer Science 2014-11-18 Boaz Barak , Fernando G. S. L. Brandão , Aram W. Harrow , Jonathan A. Kelner , David Steurer , Yuan Zhou

We study the spaces $Q_m$ of $m$-quasi-invariant polynomials of the symmetric group $S_n$ in characteristic $p$. Using the representation theory of the symmetric group we describe the Hilbert series of $Q_m$ for $n=3$, proving a conjecture…

Representation Theory · Mathematics 2022-09-30 Frank Wang

We answer a question of Benjamini and Schramm by proving that under reasonable conditions, quotienting a graph strictly increases the value of its percolation critical parameter $p_c$. More precisely, let $\mathcal{G}=(V,E)$ be a…

Probability · Mathematics 2018-09-17 Sébastien Martineau , Franco Severo

Let $f(t)=\sum_{n=0}^{+\infty}\frac{C_{f,n}}{n!}t^n$ be an analytic function at $0$, and let $C_{f, n}(x)=\sum_{k=0}^{n}\binom{n}{k}C_{f,k} x^{n-k}$ be the sequence of Appell polynomials, referred to as $\textit{C-polynomials associated to…

Number Theory · Mathematics 2023-05-09 Lahcen Lamgouni

Given a complex polynomial $P$ with zeroes $z_1,\dotsc,z_d$, we show that the asymptotic zero-counting measure of the iterated derivatives $Q^{(n)}, \ n=1,2,\dotsc$, where $Q=R/P$ is any irreducible rational function, converges to an…

Classical Analysis and ODEs · Mathematics 2017-03-06 Rikard Bögvad , Christian Hägg

Fix a sequence of integers $Q=\{q_n\}_{n=1}^\infty$ such that $q_n$ is greater than or equal to 2 for all $n$. In this paper, we improve upon results by J. Galambos and F. Schweiger showing that almost every (in the sense of Lebesgue…

Number Theory · Mathematics 2011-09-09 Bill Mance

In this paper, we discuss hypercontractivity for the Markov semigroup $P_t$ which is generated by segment processes associated with a range of functional SDEs of neutral type. As applications, we also reveal that the semigroup $P_t$…

Probability · Mathematics 2015-01-27 Jianhai Bao , Chenggui Yuan

It is shown that the continuous q-Hermite polynomials for q a root of unity have simple transformation properties with respect to the classical Fourier transform. This result is then used to construct q-extended eigenvectors of the finite…

Classical Analysis and ODEs · Mathematics 2009-10-31 Mesuma K. Atakishiyeva , Natig M. Atakishiyev , Tom H. Koornwinder

A family of sets has the $(p,q)$ property if among any $p$ members of the family some $q$ have a nonempty intersection. It is shown that for every $p\ge q\ge d+1$ there is a $c=c(p,q,d)<\infty$ such that for every family $\scr F$ of…

Metric Geometry · Mathematics 2016-09-06 Noga Alon , Daniel J. Kleitman

There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient…

Algebraic Geometry · Mathematics 2021-01-05 Jose Capco , Claus Scheiderer

We define $(p,q)$ hermitian geometry as the target space geometry of the two dimensional $(p,q)$ supersymmetric sigma model. This includes generalised K\"{a}hler geometry for $(2,2)$, generalised hyperk\"{a}hler geometry for $(4,2)$, strong…

High Energy Physics - Theory · Physics 2020-04-22 Chris Hull , Ulf Lindström

Exploiting the recent work of Tao and Ziegler on a concatenation theorem on factors, we find explicit characteristic factors for multiple averages along polynomials on systems with commuting transformations, and use them to study criteria…

Dynamical Systems · Mathematics 2023-02-06 Sebastián Donoso , Andreas Koutsogiannis , Wenbo Sun

Rational approximations of generalized hypergeometric functions ${}_pF_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations…

Numerical Analysis · Mathematics 2023-07-13 Richard Mikael Slevinsky

Let $F_{p,q}$ be the generalized friendship graph $K_1\bigvee (pK_q)$ on $pq+1$ vertices obtained by joining a vertex to all vertices of $p$ disjoint copies of the complete graph $K_q$ on $q$ vertices. In this paper, we prove that $F_{p,q}$…

Combinatorics · Mathematics 2018-05-29 Abraham Berman , Dong-Mei Chen , Zhi-Bing Chen , Wen-Zhe Liang , Xiao-Dong Zhang

Let $C$ be a smooth projective curve over $\mathbb{F}_q$ with function field $K$, $E/K$ a nonconstant elliptic curve and $\phi:\mathcal{E}\to C$ its minimal regular model. For each $P\in C$ such that $E$ has good reduction at $P$, i.e., the…

Number Theory · Mathematics 2015-06-26 Amilcar Pacheco

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

Group Theory · Mathematics 2015-03-09 J. C. Birget

It is known from the Runge approximation theorem that every function which is holomorphic in a neighborhood of a compact polynomially convex set $K\subset \complexes^{n}$ can be approximated uniformly on $K$ by analytic polynomials. We…

Complex Variables · Mathematics 2007-05-23 Youssef Alaoui , My Abdelhakim El Idrissi Saad

We prove a low characteristic counterpart to the main result in (Peluse, 2019), establishing power saving bounds for the polynomial Szemer\'{e}di theorem for certain families of polynomials. Namely, we show that if $P_1, \dots, P_m \in…

Number Theory · Mathematics 2023-03-03 Ethan Ackelsberg , Vitaly Bergelson

We find the precise range of $(p,q)$ for which local averages along graphs of a class of two-variable polynomials in $\mathbb{R}^3$ are of restricted weak type $(p,q)$, given the hypersurfaces have Euclidean surface measure. We derive these…

Classical Analysis and ODEs · Mathematics 2021-01-01 Jeremy Schwend

We use the polynomial method of Guth and Katz to establish stronger and {\it more efficient} regularity and density theorems for such $k$-uniform hypergraphs $H=(P,E)$, where $P$ is a finite point set in ${\mathbb R}^d$, and the edge set…

Computational Geometry · Computer Science 2024-08-15 Natan Rubin
‹ Prev 1 3 4 5 6 7 10 Next ›