Related papers: Influences of Fourier Completely Bounded Polynomia…
This manuscript includes some classical results we select apart from the new results we've found on the Analysis of Boolean Functions and Fourier-Entropy-Influence conjecture. We try to ensure the self-completeness of this work so that…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
The aim of this paper is to prove a uniform Fourier restriction estimate for certain $2-$dimensional surfaces in $\mathbb R^{2n}$. These surfaces are the image of complex polynomial curves $\gamma(z) = (p_1(z), \dots, p_n(z))$, equipped…
F-polynomials and g-vectors were defined by Fomin and Zelevinsky to give a formula which expresses cluster variables in a cluster algebra in terms of the initial cluster data. A quantum cluster algebra is a certain noncommutative…
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 consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…
We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of…
In their "Cluster Algebras IV" paper, Fomin and Zelevinsky defined F-polynomials and g-vectors, and they showed that the cluster variables in any cluster algebra can be expressed in a formula involving the appropriate F-polynomial and…
The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almost perfect…
We demonstrate the quantum probabilistic rule (which differ from classical Bayes' formula by the cosinus factor) can be obtained on purely classical basis as a consequence of the perturbation effect of preparation procedures. In any case…
Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak…
We introduce an algebraic theory of integration on quantum planes and other braided spaces. In the one dimensional case we obtain a novel picture of the Jackson $q$-integral as indefinite integration on the braided group of functions in one…
Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has…
The general adversary dual is a powerful tool in quantum computing because it gives a query-optimal bounded-error quantum algorithm for deciding any Boolean function. Unfortunately, the algorithm uses linear qubits in the worst case, and…
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years,…
The Alperin-McKay conjecture is a longstanding open conjecture in the representation theory of finite groups. Sp\"ath showed that the Alperin-McKay conjecture holds if the so-called inductive Alperin-McKay (iAM) condition holds for all…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
We prove the bivariate Cayley-Hamilton theorem, a powerful generalization of the classical Cayley-Hamilton theorem. The bivariate Cayley-Hamilton theorem has three direct corollaries that are usually proved independently: The classical…
We use the implicitization procedure to generate polynomial equality constraints on the set of distributions induced by local interventions on variables governed by a causal Bayesian network with hidden variables. We show how we may reduce…
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's…