相关论文: A factorization constant for $l^n_p

We note that the well-known result of Von Neumann \cite{von} is not valid for all doubly substochastic operators on discrete Lebesgue spaces $\ell^p(I)$, $p\in[1,\infty)$. This fact lead us to distinguish two classes of these operators.…

In this note, we comprehensively characterize the proximal operator of the $q$-th power of the $\ell_{1,q}$-norm (denoted by $\ell_{1,q}^{q}$) with $0\!<\!q\!<\!1$ by exploiting the well-known proximal operator of $|\cdot|^q$ on the real…

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

We study conditions under which a partial differential operator of arbitrary order $n$ in two variables or ordinary linear differential operator admits a factorization with a first-order factor on the left. The factorization process…

The principal aim of this note is to illustrate how factorizations of singular, even-order partial differential operators yield an elementary approach to classical inequalities of Hardy-Rellich-type. More precisly, introducing the…

A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

In this paper we characterize EP operators through the existence of different types of factorizations. Our results extend to EP operators existing characterizations for EP matrices and give new characterizations both for EP matrices and EP…

In this note, we answer a question raised by Johnson and Schechtman \cite{JS}, about the hypercontractive semigroup on $\{-1,1\}^{\NN}$. More generally, we prove the folllowing theorem. Let $1<p<2$. Let $(T(t))_{t>0}$ be a holomorphic…

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

We prove that if $\delta>0$ and $p$ is real then $$ \sup_T \int_T^{T+\delta} |\zeta(1+it)|^p dt <\infty,$$ if and only if $-1<p<1$. Furthermore, we show the omega estimates $$ \int_T^{T+\delta} |\zeta(1+it)|^{\pm 1} dt = \Omega(\log \log…

We study the effect of a splitting operator S_t on the L^p norm of the Fourier transform of a function f and on the operator norm of a Fourier multiplier m. Most of our results assume p is an even integer, and are often stronger when f or m…

For a polynomial $F(t,A_1,\ldots,A_n)\in\mathbf{F}_p[t,A_1,\ldots,A_n]$ ($p$ being a prime number) we study the factorization statistics of its specializations $$F(t,a_1,\ldots,a_n)\in\mathbf{F}_p[t]$$ with $(a_1,\ldots,a_n)\in S$, where…

We show some elementary facts about the semantical analogue of Parikh's Splitting, which we call Factorization.

Let T : Lp --> Lp be a positive contraction, with p strictly between 1 and infinity. Assume that T is analytic, that is, there exists a constant K such that \norm{T^n-T^{n-1}} < K/n for any positive integer n. Let q strictly betweeen 2 and…

For any semifinite von Neumann algebra ${\mathcal M}$ and any $1\leq p<\infty$, we introduce a natutal $S^1$-valued noncommutative $L^p$-space $L^p({\mathcal M};S^1)$. We say that a bounded map $T\colon L^p({\mathcal M})\to L^p({\mathcal…

We obtain hardness of approximation results for the $\ell_p$-Shortest Path problem, a variant of the classic Shortest Path problem with vector costs. For every integer $p \in [2,\infty)$, we show a hardness of $\Omega(p(\log n / \log^2\log…

A factorization theory is proposed for Wiener-Hopf plus Hankel operators with almost periodic Fourier symbols. We introduce a factorization concept for the almost periodic Fourier symbols such that the properties of the factors will allow…

In this paper, we intend to present a new algorithm to factorize large numbers. According to the algorithm proposed here, we prove that there is a common factor between p and q. With this procedure, the time of factorization considerably…

Let $p(z)$ be a monic polynomial of degree $n$, with complex coefficients, and let $q(z)$ be its monic factor. We prove an asymptotically sharp inequality of the form $\|q\|_{E} \le C^n \|p\|_E$, where $\|\cdot\|_E$ denotes the sup norm on…