Related papers: Shift-invariant transformations and almost lifting…
Let $U_{k,N}$ denote the Boolean function which takes as input $k$ strings of $N$ bits each, representing $k$ numbers $a^{(1)},\dots,a^{(k)}$ in $\{0,1,\dots,2^{N}-1\}$, and outputs 1 if and only if $a^{(1)} + \cdots + a^{(k)} \geq 2^N.$…
We introduce a new pair of mutually dual bases of noncommutative symmetric functions and quasi-symmetric functions, and use it to derive generalizations of several results on the reduced incidence algebra of the lattice of noncrossing…
We develop and analyze a broad family of stochastic/randomized algorithms for inverting a matrix. We also develop specialized variants maintaining symmetry or positive definiteness of the iterates. All methods in the family converge…
We study Boolean functions of an arbitrary number of input variables that can be realized by simple iterative constructions based on constant-size primitives. This restricted type of construction needs little global coordination or control…
We study Fourier theory on quantum Euclidean space. A modified version of the general definition of the Fourier transform on a quantum space is used and its inverse is constructed. The Fourier transforms can be defined by their Bochner's…
Given a weighted hypergraph $\mathcal{H}(V, \mathcal{E} \subseteq 2^V, w)$, the approximate $k$-cover problem seeks for a size-$k$ subset of $V$ that has the maximum weighted coverage by \emph{sampling only a few hyperedges} in…
We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…
We consider conformal perturbation theory for $n$-point functions on the sphere in general 2D CFTs to first order in coupling constant. We regulate perturbation integrals using canonical hard disk excisions of size $\epsilon$ around the…
Exact non-perturbative partition functions of coupling constants and external fields exhibit huge hidden symmetry, reflecting the possibility to change integration variables in the functional integral. In many cases this implies also some…
In this work we explore error-correcting codes derived from the "lifting" of "affine-invariant" codes. Affine-invariant codes are simply linear codes whose coordinates are a vector space over a field and which are invariant under…
Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…
Here we revisit the quantum algorithms for obtaining Forrelation [Aaronson et al, 2015] values to evaluate some of the well-known cryptographically significant spectra of Boolean functions, namely the Walsh spectrum, the cross-correlation…
We calculate a certain mean-value of meromorphic functions by using specific ergodic transformations, which we call affine Boolean transformations. We use Birkhoff's ergodic theorem to transform the mean-value into a computable integral…
We investigate a U(1) gauge invariant quantum mechanical system on a 2D noncommutative space with coordinates generating a generalized deformed oscillator algebra. The Hamiltonian is taken as a quadratic form in gauge covariant derivatives…
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We compare several different possible definitions. Our main…
We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…
Using perturbative Quantum Chromodynamics, we compute dihadron fragmentation functions for a large invariant mass of the dihadron pair. The main focus is on the interference fragmentation function $H_1^{\open}$, which plays an important…
A wide class of Hamiltonian systems with N degrees of freedom and endowed with, at least, (N-2) functionally independent integrals of motion in involution is constructed by making use of the two-photon Lie-Poisson coalgebra. The set of…
The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…
This letter presents an almost sure convergence of the zeroth-order mirror descent algorithm. The algorithm admits non-smooth convex functions and a biased oracle which only provides noisy function value at any desired point. We approximate…