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

This paper focuses on the problem of finding a distribution for an associated entropic vector in the entropy space nearest to a given, possibly non-entropic, target vector for random variables with a constraint on alphabet size. We show the…

Let $n$ be an arbitrary integer, let $p$ be a prime factor of $n$. Denote by $\omega_1$ the $p^{th}$ primitive unity root, $\omega_1:=e^{\frac{2\pi i}{p}}$. Define $\omega_i:=\omega_1^i$ for $0\leq i\leq p-1$ and…

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…

Numerous machine learning problems require an exploration basis - a mechanism to explore the action space. We define a novel geometric notion of exploration basis with low variance, called volumetric spanners, and give efficient algorithms…

Given a connected graph $G=(V,E)$ and a length function $\ell:E\to {\mathbb R}$ we let $d_{v,w}$ denote the shortest distance between vertex $v$ and vertex $w$. A $t$-spanner is a subset $E'\subseteq E$ such that if $d'_{v,w}$ denotes…

We propose subspace methods for 3-parameter eigenvalue problems. Such problems arise when separation of variables is applied to separable boundary value problems; a particular example is the Helmholtz equation in ellipsoidal and…

We examine the lattice generated by two pairs of supplementary vector subspaces of a finite-dimensional vector space by intersection and sum, with the aim of applying the results to the study of representations admitting two pairs of…

Three events in a probability space form a conjunctive fork if they satisfy specific constraints on conditional independence and covariances. Patterns of conjunctive forks within collections of events are characterized by means of systems…

The probabilities for gaps in the eigenvalue spectrum of the finite dimension $ N \times N $ random matrix Hermite and Jacobi unitary ensembles on some single and disconnected double intervals are found. These are cases where a reflection…

The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…

Assume that $m,s\in\mathbb N$, $m>1$, while $f$ is a polynomial with integer coefficients, $\text{deg}~f>1$, $f^{(i)}$ is the $i$th iteration of the polynomial $f$, $\kappa_n$ has a discrete uniform distribution on the set $\{0,1,\ldots,m^n…

We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden…

In this paper, we study the gap probability problem of the (symmetric) Jacobi unitary ensemble of Hermitian random matrices, namely the probability that the interval $(-a,a)\:(0<a<1)$ is free of eigenvalues. Using the ladder operator…

The Sum-of-Squares (SoS) hierarchy is a semi-definite programming meta-algorithm that captures state-of-the-art polynomial time guarantees for many optimization problems such as Max-$k$-CSPs and Tensor PCA. On the flip side, a SoS lower…

The main result is the following Theorem: Let p=p(n) be such that p(n) in [0,1] for all n and either p(n)<< n^{-1} or for some positive integer k, n^{-1/k}<< p(n)<< n^{-1/(k+1)} or for all epsilon >0, n^{- epsilon}<< p(n) and n^{-…

For a random sample of points in $\mathbb{R}$, we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. The first type of pairs are called reflexive NNs whereas…

The paper is concerned with completeness property of rank one perturbations of unperturbed operators generated by special boundary value problems (BVP) for the following $2 \times 2$ system \begin{equation} L y = -i B^{-1} y' + Q(x) y =…

The symmetric binary perceptron ($\mathrm{SBP}_{\kappa}$) problem with parameter $\kappa : \mathbb{R}_{\geq1} \to [0,1]$ is an average-case search problem defined as follows: given a random Gaussian matrix $\mathbf{A} \sim…

Being inspired by the success of \texttt{word2vec} \citep{mikolov2013distributed} in capturing analogies, we study the conjecture that analogical relations can be represented by vector spaces. Unlike many previous works that focus on the…

Representing token embeddings as probability distributions over learned manifolds allows for more flexible contextual inference, reducing representational rigidity while enhancing semantic granularity. Comparative evaluations demonstrate…