Related papers: Computing p-summing norms with few vectors

We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$)…

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

We show that for any rational p \in [1,\infty) except p = 1, 2, unless P = NP, there is no polynomial-time algorithm for approximating the matrix p-norm to arbitrary relative precision. We also show that for any rational p\in [1,\infty)…

We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…

The classical Cauchy-Davenport theorem implies the lower bound n+1 for the number of distinct subsums that can be formed from a sequence of n elements of the cyclic group Z_p (when p is prime and n<p). We generalize this theorem to a…

We explicitly evaluate the principal eigenvalue of the extremal Pucci's sup--operator for a class of special plane domains, and we prove that, for fixed area, the eigenvalue is minimal for the most symmetric set.

In this paper, we obtain a lower bound for the number of primes $p\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and…

Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…

Stein's method is used to obtain two theorems on multivariate normal approximation. Our main theorem, Theorem 1.2, provides a bound on the distance to normality for any nonnegative random vector. Theorem 1.2 requires multivariate size bias…

The explicit formulas of operations, in particular addition and multiplication, of $p $-adic integers are presented. As applications of the results, at first the explicit formulas of operations of Witt vectors with coefficients in…

We use bounds of character sums and some combinatorial arguments to show the abundance of very smooth numbers which also have very few non-zero binary digits.

The $p$-norm of $r$-matrices generalizes the $2$-norm of $2$-matrices. It is shown that if a nonnegative $r$-matrix is symmetric with respect to two indices $j$ and $k$, then the $p$-norm is attained for some set of vectors such that the…

We initiate the study of data dimensionality reduction, or sketching, for the $q\to p$ norms. Given an $n \times d$ matrix $A$, the $q\to p$ norm, denoted $\|A\|_{q \to p} = \sup_{x \in \mathbb{R}^d \backslash \vec{0}}…

Fix a density d in (0,1], and let F_p^n be a finite field, where we think of p fixed and n tending to infinity. Let S be any subset of F_p^n having the minimal number of three-term progressions, subject to the constraint |S| is at least…

In this note we prove an abstract version of a result from 2002 due to Delgado and Pi\~{n}ero on absolutely summing operators. Several applications are presented; some of them in the multilinear framework and some in a completely nonlinear…

We prove new summability properties for multilinear operators on $\ell_p$ spaces. An important tool for this task is a better understanding of the interplay between almost summing and absolutely summing multilinear operators.

Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…

By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…

Assume that f is a strict convex function with a unique minimum in R^n. We divide the vector of n-variables to d groups of vector subvariables with d at least two. We assume that we can find the partial minimum of f with respect to each…