For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is
called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them …

We study time/memory tradeoffs of function inversion: an algorithm, ie, an inverter, equipped
with an s-bit advice on a randomly chosen function $$f:[n] \mapsto [n]$$ and using q oracle …

The index coding problem is concerned with broadcasting encoded information to a collection
of receivers in a way that enables each receiver to discover its required data based on its …

The orthogonality dimension of a graph \(G\) over \(\mathbb{R}\) is the smallest integer \(k\)
for which one can assign a nonzero \(k\) -dimensional real vector to each vertex of \(G\) such …

This study proposes a fine-tuned approach to modeling musical form in Classical repertoires
by analyzing pitch-class distributions in symbolic data using machine learning algorithms. …

A graph $G$ is said to be $k$-subspace choosable over a field $\mathbb{F}$ if for every
assignment of $k$-dimensional subspaces of some finite-dimensional vector space over $\…

The index coding problem is concerned with the amount of information that a sender has to
transmit to multiple receivers in a way that enables each of them to retrieve its requested data …

… © 2021 Raz, Chawin, & Rom. This article is published under a Creative Commons
Attribution-NonCommercial 4.0 International License (https://creativecommons.org/licenses/by-nc/4.0/) …

The vector choice number of a graph G over a field $$\mathbb {F}$$ F , introduced by Haynes
et al. (Electron. J. Comb., 2010), is the smallest integer k such that for every assignment of …

… I would like to thank my friends Tal Yankovitz, Orr Fischer, Roni Con and Dror Chawin, for
lending me their ears countless times, many hours of technical discussions and for their …