Related papers: Separations between Combinatorial Measures for Tra…
This work considers the problem of finding a first-order stationary point of a non-convex function with potentially unbounded smoothness constant using a stochastic gradient oracle. We focus on the class of $(L_0,L_1)$-smooth functions…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…
We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…
Analyzing the covariance structure of data is a fundamental task of statistics. While this task is simple for low-dimensional observations, it becomes challenging for more intricate objects, such as multivariate functions. Here, the…
This work considers the asymptotic behavior of the distance between two sample covariance matrices (SCM). A general result is provided for a class of functionals that can be expressed as sums of traces of functions that are separately…
We show that there exists a Boolean function $F$ which observes the following separations among deterministic query complexity $(D(F))$, randomized zero error query complexity $(R_0(F))$ and randomized one-sided error query complexity…
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been…
We derive and study a significance test for determining if a panel of functional time series is separable. In the context of this paper, separability means that the covariance structure factors into the product of two functions, one…
We consider a variant of the Boolean satisfiability problem where a subset E of the propositional variables appearing in formula Fsat encode a symmetric, transitive, binary relation over N elements. Each of these relational variables,…
A function $f$ from an Abelian group $(A,+)$ to an Abelian group $(B,+)$ is $(n, m, S)$ zero-difference (ZD), if $S=\{\lambda_\alpha \mid \alpha \in A\setminus\{0\}\}$ where $n=|A|$, $m=|f(A)|$ and $\lambda_\alpha=|\{x \in A \mid…
Musical chords, harmonies or melodies in Just Intonation have note frequencies which are described by a base frequency multiplied by rational numbers. For any local section, these notes can be converted to some base frequency multiplied by…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…
Following Davies, Elekes and Keleti, we study measured sets, i.e. Borel sets $B$ in $\mathbb{R}$ (or in a Polish group) for which there is a translation invariant Borel measure assigning positive and \sigma-finite measure to $B$. We…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
In a recent result, Knop, Lovett, McGuire and Yuan (STOC 2021) proved the log-rank conjecture for communication complexity, up to log n factor, for any Boolean function composed with AND function as the inner gadget. One of the main tools…
We introduce the notion of symmetric covariation, which is a new measure of dependence between two components of a symmetric $\alpha$-stable random vector, where the stability parameter $\alpha$ measures the heavy-tailedness of its…
In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…
We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…
In the current work, we provide theoretical results for testing (in)dependence between pairs of paths of most commonly studied non-stationary Gaussian processes - standard Brownian motion and fractional Brownian motion (fBm). Please see the…
Consider a large system of $N$ Brownian motions in $\mathbb{R}^d$ with some non-degenerate initial measure on some fixed time interval $[0,\beta]$ with symmetrised initial-terminal condition. That is, for any $i$, the terminal location of…