Related papers: Structure of sparse Boolean functions over Abelian…
We describe a general framework of functional and Fourier analysis on domains with a free action of an Abelian Lie group $G$. Namely, on a domain of the form $G\times Y$ we introduce the appropriate spaces of distributions and measurable…
An $s$-sparse polynomial has at most $s$ monomials with nonzero coefficients. The Equivalence Testing problem for sparse polynomials (ETsparse) asks to decide if a given polynomial $f$ is equivalent to (i.e., in the orbit of) some…
This thesis is concerned with the behavior of random analytic functions. In particular, we are interested in the value distribution of Taylor series with independent random coefficients. We begin with a study of the properties of Fourier…
A special case of a conjecture raised by Forrest and Runde (Math. Zeit., 2005) asserts that the Fourier algebra of every non-abelian connected Lie group fails to be weakly amenable; this was aleady known to hold in the non-abelian compact…
We prove that the set of all integrable functions whose sequences of negative (resp. nonnegative) Fourier coefficients belong to $\ell^1\cap\ell^\Phi_{\phi,w}$ (resp. to $\ell^1\cap\ell^\Psi_{\psi,\varrho}$), where $\ell^\Phi_{\phi,w}$ and…
For a finite abelian group $G$, let $\beta_{\mathrm{sep}}(G)$ denote its separating Noether number. We determine $\beta_{\mathrm{sep}}(G)$ exactly for every finite abelian group $ G \cong C_{n_1}\oplus \cdots \oplus C_{n_r}$ with $ 1<n_1…
Factor analysis is a statistical technique that explains correlations among observed random variables with the help of a smaller number of unobserved factors. In traditional full factor analysis, each observed variable is influenced by…
We investigate the density properties of generalized divisor functions $\displaystyle f_s(n)=\frac{\sum_{d|n}d^s}{n^s}$ and extend the analysis from the already-proven density of $s=1$ to $s\geq0$. We demonstrate that for every $s>0$, $f_s$…
We consider the minimization of the number of non-zero coefficients (the $\ell_0$ "norm") of the representation of a data set in terms of a dictionary under a fidelity constraint. (Both the dictionary and the norm defining the constraint…
We show that if $f\colon S_n \to \{0,1\}$ is $\epsilon$-close to linear in $L_2$ and $\mathbb{E}[f] \leq 1/2$ then $f$ is $O(\epsilon)$-close to a union of "mostly disjoint" cosets, and moreover this is sharp: any such union is close to…
A polynomial $P \in \mathbb{C}[z_1, \ldots, z_d]$ is strongly $\mathbb{D}^d$-stable if $P$ has no zeroes in the closed unit polydisc $\overline{\mathbb{D}}^d.$ For such a polynomial define its spectral density function as…
A seminal result of Nisan and Szegedy (STOC, 1992) shows that for any total Boolean function, the degree of the real polynomial that computes the function, and the minimal degree of a real polynomial that point-wise approximates the…
We study sampling properties of the zero set of the Gaussian entire function on Fock spaces. Firstly, we relax Seip and Wallst\'en's density and separation conditions for sampling sets on Fock spaces to obtain weighted inequalities for sets…
The factorizable vectors of a complete Boolean algebra of type I factors, acting on a separable Hilbert space, are shown to be total, resolving a conjecture of Araki and Woods. En route, the spectral theory of noise-type Boolean algebras of…
Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…
We investigate Boolean degree 1 functions for several classical association schemes, including Johnson graphs, Grassmann graphs, graphs from polar spaces, and bilinear forms graphs, as well as some other domains such as multislices (Young…
The fundamental task of group testing is to recover a small distinguished subset of items from a large population while efficiently reducing the total number of tests (measurements). The key contribution of this paper is in adopting a new…
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in…
We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…
We consider the so-called {\it strongly co-Hopfian} and {\it uniformly strongly co-Hopfian} Abelian groups, significantly generalizing some important results due to Abdelalim in the J. Math. Analysis (2015). Specifically, we prove that any…