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

This paper provides two characterizations of regularity for near-vector spaces: first, by expressing them as a direct sum of vector spaces over division rings formed by distributive elements; second, by expressing their dimension in term of…

Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions over the non-negative reals. We show how to approximate the…

This paper considers a particular parameter estimator for switched systems and analyzes its properties. The estimator in question is defined as the map from the data set to the solution set of an optimization problem where the…

The $p$-curvature of a system of linear differential equations in positive characteristic $p$ is a matrix that measures how far the system is from having a basis of polynomial solutions. We show that the similarity class of the…

We address the problems of computing operator norms of matrices induced by given norms on the argument and the image space. It is known that aside of a fistful of "solvable cases," most notably, the case when both given norms are Euclidean,…

We consider a two-point correlator in massless $\phi^3$ model within the ladder approximation . The spectral density of the correlator is known explicitly and does not contain any resonances. Meanwhile making use of the standard sum rules…

Let $H$ be an infinite dimensional separable Hilbert space and $B(H)$ the C*-algebra of bounded operators on $H.$ Suppose that $T_1,T_2,..., T_n$ are self-adjoint operators in $B(H).$ We show that, if commutators $[T_i, T_j]$ are…

A specific family of point processes are introduced that allow to select samples for the purpose of estimating the mean or the integral of a function of a real variable. These processes, called quasi-systematic processes, depend on a tuning…

This paper derives new results for the analysis of nonlinear systems by extending contraction theory in the framework of vector distances. A new tool, vector contraction analysis utilizing a notion of the vector-valued norm which evidently…

We consider the problem of reconstructing an $N$-dimensional continuous vector $\bx$ from $P$ constraints which are generated by its linear transformation under the assumption that the number of non-zero elements of $\bx$ is typically…

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…

We consider learning the principal subspace of a large set of vectors from an extremely small number of compressive measurements of each vector. Our theoretical results show that even a constant number of measurements per column suffices to…

Computations involving invariant random vectors are directly related to the theory of invariants (cf. e.g \cite{Weing_1}). Some simple observations along these lines are presented in this paper. We note in particular that sum of elements of…

We consider the hardness of approximation of optimization problems from the point of view of definability. For many NP-hard optimization problems it is known that, unless P = NP, no polynomial-time algorithm can give an approximate solution…

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…

This paper considers a restriction to non-negative matrix factorization in which at least one matrix factor is stochastic. That is, the elements of the matrix factors are non-negative and the columns of one matrix factor sum to 1. This…

We give a {\em deterministic} algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-$2$ polynomial threshold function. Given a degree-2 input polynomial $p(x_1,\dots,x_n)$ and a parameter $\eps >…

For a vector $\mathbf a=(a_1,\ldots,a_r)$ of positive integers we prove formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0,…

We give a vector identity for $n+2$ points in $\mathbb R^n$. It follows as a corollary that when $n$ is odd the sum of the signed volumes of the $n$-simplices is zero, and when $n$ is even, the alternating sum of the signed volumes is zero.

In this work, we continue the line of research on the complexity of distributions (Viola, Journal of Computing 2012), and study samplers defined by low degree polynomials. An $n$-tuple $P = (P_1,\dots, P_n)$ of functions $P_i \colon…