相关论文: Computing p-summing norms with few vectors

We prove that the multiple summing norm of multilinear operators defined on some $n$-dimensional real or complex vector spaces with the $p$-norm may be written as an integral with respect to stables measures. As an application we show…

We give conditions that ensure that an operator satisfying a Piestch domination in a given setting also satisfies a Piestch domination in a different setting. From this we derive that a bounded mutlilinear operator $T$ is Lipschitz…

We will show that for $q<p$ there exists an $\al < \infty$ such that \[ \pi_{pq}(T) \pl \le c_{pq} \pi_{pq}^{[n^{\alpha}]}(T) \mbox{for all $T$ of rank $n$.}\] Such a polynomial number is only possible if $q=2$ or $q<p$. Furthermore, the…

We prove an easy version of the minimax theorem with no topological assumption. We deduce from it some domination criteria as well as an application to $p$-summing operators.

We give a constant factor polynomial time pseudo-approximation algorithm for min-sum clustering with or without outliers. The algorithm is allowed to exclude an arbitrarily small constant fraction of the points. For instance, we show how to…

We introduce a general definition of almost $p$-summing mappings and give several concrete examples of such mappings. Some known results are considerably generalized and we present various situations in which the space of almost $p$-summing…

We establish a normal approximation for the limiting distribution of partial sums of random Rademacher multiplicative functions over function fields, provided the number of irreducible factors of the polynomials is small enough. This…

In this article, we study the ideals of mid $p$-summing operators. We obtain representation of these operator ideals by tensor norms. These tensor norms are defined by using a particular kind of sequential dual of the class of mid…

We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.

We show that given a positive integer $m$, a real number $p\in\left[ 2,\infty\right)$ and $1\leq s<p^{\ast}$ the set of non--multiple $\left( r;s\right)$--summing $m$--linear forms on $\ell_{p}\times\cdots\times \ell_{p}$ contains, except…

Let $f$ be a completely multiplicative function that assumes values inside the unit disc. We show that if $\sum_{n<x} f(n) \ll x/(\log x)^A$, $x>2$, for some $A>2$, then either $f(p)$ is small on average or $f$ pretends to be $\mu(n)n^{it}$…

Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

This paper delves into vector and matrix norms of Fibonacci numbers. Two classes of Fibonacci vectors and a parametric p-norm are defined. From this definition, several properties of Fibonacci vector and matrix p-norms are described by…

We estimate weighted character sums with determinants $ad-bc $ of $2\times 2$ matrices modulo a prime $p$ with entries $a,b,c,d $ varying over the interval $ [1,N]$. Our goal is to obtain nontrivial bounds for values of $N$ as small as…

We give some new characterizations of strictly Lipschitz p-summing operators. These operators have been introduced in order to improve the Lipschitz p-summing operators. Therefore, we adapt this definition for constructing other classes of…

We give a domain-theoretic semantics to a statistical programming language, using the plain old category of dcpos, in contrast to some more sophisticated recent proposals. Remarkably, our monad of minimal valuations is commutative, which…

We study the optimization of functions with $n>2$ arguments that have a representation as a sum of several functions that have only $2$ of the $n$ arguments each, termed sums of bivariates, on finite domains. The complexity of optimizing…

Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to…

In applied probability, the normal approximation is often used for the distribution of data with assumed additive structure. This tradition is based on the central limit theorem for sums of (independent) random variables. However, it is…