Related papers: A composition theorem for the Fourier Entropy-Infl…
We revisit the Fourier transform of a Hankel function, of considerable importance in the theory of knife edge diffraction. Our approach is based directly upon the underlying Bessel equation, which admits manipulation into an alternate…
Entanglement (Renyi) entropies of spatial regions are a useful tool for characterizing the ground states of quantum field theories. In this paper we investigate the extent to which these are universal quantities for a given theory, and to…
The partial entanglement entropy (PEE) $s_{\mathcal{A}}(\mathcal{A}_i)$ characterizes how much the subset $\mathcal{A}_i$ of $\mathcal{A}$ contribute to the entanglement entropy $S_{\mathcal{A}}$. We find one additional physical requirement…
Composite structure of particles somewhat modifies their statistics, compared to the pure Bose- or Fermi-ones. The spin-statistics theorem, so, is not valid anymore. Say, $\pi$-mesons, excitons, Cooper pairs are not ideal bosons, and,…
The (measure-theoretical) entropy of a diffeomorphism along an expanding invariant foliation is the rate of complexity generated by the diffeomorphism along the leaves of the foliation. We prove that this number varies upper…
A celebrated unresolved conjecture of Peter Frankl states that every finite collection of sets, with finite universe, admits an abundant element. In this paper, we prove Frankl's union-closed conjecture(FC). We provide an induction proof…
In the early 2000's the first and second named authors worked for a period of six years in an attempt of proving the Compositional Shuffle Conjecture [1]. Their approach was based on the discovery that all the Combinatorial properties…
Causal inference relies on two fundamental assumptions: ignorability and positivity. We study causal inference when the true confounder value can be expressed as a function of the observed data; we call this setting estimation with…
Local consistency arises in diverse areas, including Bayesian statistics, relational databases, and quantum foundations, and so does the notion of functional dependence. We adopt a general approach to study logical inference in a setting…
This paper is the first in a series revisiting the Faraday effect, or more generally, the theory of electronic quantum transport/optical response in bulk media in the presence of a constant magnetic field. The independent electron…
Given a convex function $\Phi:[0,1]\to\mathbb{R}$ and the mean $\mathbb{E}f(\mathbf{X})=a\in[0,1]$, which Boolean function $f$ maximizes the $\Phi$-stability $\mathbb{E}[\Phi(T_{\rho}f(\mathbf{X}))]$ of $f$? Here $\mathbf{X}$ is a random…
A key ingredient of the Kochen-Specker theorem is the so-called functional composition principle, which asserts that hidden states must ascribe values to observables in a way that is consistent with all functional relations between them.…
The Eisenbud-Green-Harris (EGH) conjecture offers a generalization of the famous Macaulay's theorem about the Hilbert functions of homogeneous ideals in a polynomial ring $K[x_1,\ldots, x_n]$. In this survey paper, we provide a good…
A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…
We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…
This paper proposes an algorithm for deciding consistency of systems of Boolean equations in several variables with co-efficients in the two element Boolean algebra $B_{0}=\{0,1\}$ and find all satisfying assignments. The algorithm is based…
We derive formulas for the Fourier coefficients of $|f|^2$, where $f(z_1,z_2)=(1-\frac{z_1+z_2}{r})^{-\alpha}$, in terms of hypergeometric functions. Using these formulas we provide additional counterexamples to the weak Shanks conjecture,…
$\newcommand{\sp}{\mathsf{sparsity}}\newcommand{\s}{\mathsf{s}}\newcommand{\al}{\mathsf{alt}}$ The well-known Sensitivity Conjecture states that for any Boolean function $f$, block sensitivity of $f$ is at most polynomial in sensitivity of…
Given a Boolean function f, the quantity ess(f) denotes the largest set of assignments that falsify f, no two of which falsify a common implicate of f. Although ess(f)$ is clearly a lower bound on cnf_size(f) (the minimum number of clauses…
We study the probability of Boolean functions with small max influence to become constant under random restrictions. Let $f$ be a Boolean function such that the variance of $f$ is $\Omega(1)$ and all its individual influences are bounded by…