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

Given a real $n \times m$ matrix $B$, its operator norm can be defined as $$|B|=\max_{|v|=1}|Bv|.$$ We consider a matrix "small" if it has non-negative integer entries and its operator norm is less than $2$. These matrices correspond to…

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…

Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., "yes" and "no", every voting system can be described by a (monotone) Boolean function…

Many streaming algorithms provide only a high-probability relative approximation. These two relaxations, of allowing approximation and randomization, seem necessary -- for many streaming problems, both relaxations must be employed…

In this paper we define the $p$-density of a finite subset $D\subset\ma{N}^r$, and show that it gives a good lower bound for the $p$-adic valuation of exponential sums over finite fields of characteristic $p$. We also give an application:…

Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…

Permutation tests are among the simplest and most widely used statistical tools. Their p-values can be computed by a straightforward sampling of permutations. However, this way of computing p-values is often so slow that it is replaced by…

We obtain nontrivial bounds for character sums with multiplicative and additive characters over finite fields over elements with restricted coordinate expansion. In particular, we obtain a nontrivial estimate for such a sum over a finite…

Even though every mathematician knows intuitively what it means to "simplify" a mathematical expression, there is still no universally accepted rigorous mathematical definition of "simplify". In this paper, we shall give a simple and…

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

Suppose that A is a subset of F_2^n of density as close to 1/3 as possible. We show that the A(F_2^n)-norm (that is the sum of the absolute values of the Fourier transform) of the characterstic function of A is bounded below by an absolute…

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

A real-valued set function is (additively) approximately submodular if it satisfies the submodularity conditions with an additive error. Approximate submodularity arises in many settings, especially in machine learning, where the function…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

We investigate the almost everywhere convergence of sequences of convolution operators given by probability measures $\mu_n$ on $\mathbb R$. If this sequence of operators constitutes an approximate identity on a particular class of…

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings,…

In order to reprove an old result of R\'edei's on the number of directions determined by a set of cardinality $p$ in $\mathbb{F}_p^2$, Somlai proved that the non-constant polynomials over the field $\mathbb{F}_p$ whose range sums are equal…

The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.

A vector space is commonly defined as a set that satisfies several conditions related to addition and scalar multiplication. However, for beginners, it may be hard to immediately grasp the essence of these conditions. There are probably a…