English
Related papers

Related papers: On linear-combinatorial problems associated with s…

200 papers

We analyze linear independence of rank one tensors produced by tensor powers of randomly perturbed vectors. This enables efficient decomposition of sums of high-order tensors. Our analysis builds upon [BCMV14] but allows for a wider range…

Data Structures and Algorithms · Computer Science 2018-10-30 Nima Anari , Constantinos Daskalakis , Wolfgang Maass , Christos H. Papadimitriou , Amin Saberi , Santosh Vempala

For every unit vector $\sigma\in\Sigma_{d-1}$ and every $r\ge0$, let % % \begin{displaymath} P_{\sigma,r}=[-1,1]^d\cap\{t\in\Rr^d:t\cdot\sigma\le r\} \end{displaymath} % % denote the intersection of the cube $[-1,1]^d$ with a half-space…

Number Theory · Mathematics 2010-05-11 William W. L. Chen , Giancarlo Travaglini

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…

Numerical Analysis · Mathematics 2023-03-13 Alexander Kushkuley

Given n (discrete or continuous) random variables X_i, the (2^n-1)-dimensional vector obtained by evaluating the joint entropy of all non-empty subsets of {X_1,...,X_n} is called an entropic vector. Determining the region of entropic…

Information Theory · Computer Science 2011-12-02 Sormeh Shadbakht , Babak Hassibi

Let $(Y,X_1,...,X_m)$ be a random vector. It is desired to predict $Y$ based on $(X_1,...,X_m)$. Examples of prediction methods are regression, classification using logistic regression or separating hyperplanes, and so on. We consider the…

Statistics Theory · Mathematics 2007-06-13 Eitan Greenshtein

We compute a primary cohomological obstruction to the existence of an equipartition for j mass distributions in R^d by two hyperplanes in the case 2d-3j = 1. The central new result is that such an equipartition always exists if d=6 2^k +2…

Metric Geometry · Mathematics 2014-03-03 Rade T. Zivaljevic

The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…

Combinatorics · Mathematics 2013-11-18 Ryan Schwartz , Jozsef Solymosi

We prove large (and moderate) deviations for a class of linear combinations of spacings generated by i.i.d. exponentially distributed random variables. We allow a wide class of coefficients which can be expressed in terms of continuous…

Probability · Mathematics 2021-09-07 Camilla Calì , Maria Longobardi , Claudio Macci , Barbara Pacchiarotti

Successive pairs of pseudo-random numbers generated by standard linear congruential transformations display ordered patterns of parallel lines. We study the ``ordered'' and ``chaotic'' distribution of such pairs by solving the eigenvalue…

chao-dyn · Physics 2015-06-24 Antonio Bonelli , Stefano Ruffo

In the Orthogonal Vectors (OV) problem, we wish to determine if there is an orthogonal pair of vectors among $n$ Boolean vectors in $d$ dimensions. The OV Conjecture (OVC) posits that OV requires $n^{2-o(1)}$ time to solve, for all…

Computational Complexity · Computer Science 2017-09-18 Daniel Kane , Ryan Williams

We determine the probability that a random k-dimensional subspace of Euclidean n-space contains a positive vector.

Probability · Mathematics 2010-04-06 Kent E. Morrison

The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…

Statistical Mechanics · Physics 2009-11-10 Fabricio Toscano , Raul O. Vallejos , Constantino Tsallis

Let D be a division ring with centre F. Let T(D) be the vector space over F generated by all multiplicative commutators in D. In [1], authors have conjectured that every division ring is generated as a vector space over its centre by all of…

Rings and Algebras · Mathematics 2020-05-08 Mehdi Aaghabali , Zakeieh Tajfirouz

In our work, we consider the problem of computing a vector $x \in Z^n$ of minimum $\|\cdot\|_p$-norm such that $a^\top x \not= a_0$, for any vector $(a,a_0)$ from a given subset of $Z^n$ of size $m$. In other words, we search for a vector…

Computational Complexity · Computer Science 2026-04-16 Grigorii Dakhno , Dmitry Gribanov , Nikita Kasianov , Anastasiia Kats , Andrey Kupavskii , Nikita Kuz'min , Stanislav Moiseev

In this paper new general modewise Johnson-Lindenstrauss (JL) subspace embeddings are proposed that are both considerably faster to generate and easier to store than traditional JL embeddings when working with extremely large vectors and/or…

Numerical Analysis · Mathematics 2020-12-18 M. A. Iwen , D. Needell , E. Rebrova , A. Zare

For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the…

Combinatorics · Mathematics 2024-06-12 Hyunwoo Lee

Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in an arbitrary field $K$. Kaplansky conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by $n$ matrices is a vector…

Rings and Algebras · Mathematics 2019-06-13 Sergey Malev

More than twenty-five years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for positive integers $n,k$ with $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose…

Combinatorics · Mathematics 2014-07-22 Ameera Chowdhury , Ghassan Sarkis , Shahriar Shahriari

It was observed in \cite{Al2} that the expectation of a squared scalar product of two random independent unit vectors that are uniformly distributed on the unit sphere in $\mathbb{R}^n $ is equal to $1/n$. It is shown below that this is a…

Probability · Mathematics 2022-06-29 Alexander Kushkuley

The region of entropic vectors is a convex cone that has been shown to be at the core of many fundamental limits for problems in multiterminal data compression, network coding, and multimedia transmission. This cone has been shown to be…

Information Theory · Computer Science 2015-12-11 Yunshu Liu , John MacLaren Walsh