Related papers: Deciding One to One property of Boolean maps: Cond…
We study the uniform query reliability problem, which asks, for a fixed Boolean query Q, given an instance I, how many subinstances of I satisfy Q. Equivalently, this is a restricted case of Boolean query evaluation on tuple-independent…
Given a finite set $X$ and a function $f:X\to X$, we define the degree of noninvertibility of $f$ to be $\displaystyle\text{deg}(f)=\frac{1}{|X|}\sum_{x\in X}|f^{-1}(f(x))|$. This is a natural measure of how far the function $f$ is from…
It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…
This thesis is devoted to algorithmic aspects of the implementation of Cartan's moving frame method to the problem of the equivalence of submanifolds under a Lie group action. We adopt a general definition of a moving frame as an…
The aim of the paper is to answer a long-standing open problem on the relationship between NP and BQP. The paper shows that BQP contains NP by proposing a BQP quantum algorithm for the MAX-E3-SAT problem which is a fundamental NP-hard…
We study the problem of allocating indivisible goods among agents with additive valuation functions to achieve both fairness and efficiency under the constraint that each agent receives exactly the same number of goods (the \emph{balanced…
A Boolean function $f:\{0,1\}^n \mapsto \{0,1\}$ is said to be $\eps$-far from monotone if $f$ needs to be modified in at least $\eps$-fraction of the points to make it monotone. We design a randomized tester that is given oracle access to…
Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier…
A one-to-one correspondence is proved between the N-rooted ribbon graphs, or maps, with e edges and the (e-N+1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for…
Let $\Gamma$ be an oriented Jordan smooth curve and $\alpha$ be a diffeomorphism of $\Gamma$ onto itself which has an arbitrary nonempty set of periodic points. We prove criteria for one-sided invertiblity of the binomial functional…
We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points. To compute (with) the 0-dimensional projection and the…
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…
Decision of whether a Boolean equation system has a solution is an NPC problem and finding a solution is NP hard. In this paper, we present a quantum algorithm to decide whether a Boolean equation system FS has a solution and compute one if…
We present an $\tilde{O}(n^{2/3}/\epsilon^2)$-query algorithm that tests whether an unknown Boolean function $f\colon\{0,1\}^n\rightarrow \{0,1\}$ is unate (i.e., every variable is either non-decreasing or non-increasing) or $\epsilon$-far…
In this paper, we explore the 'equivalence principle' (EP): roughly, statements about mathematical objects should be invariant under an appropriate notion of equivalence for the kinds of objects under consideration. In set theoretic…
For K a field of characteristic 0 and d any integer number greater than or equal to 2, we prove the invertibility of polynomial endomorphisms of the affine space of dimension d over K of the form F=Id+H, where each coordinate of H is the…
We introduce novel mathematical and computational tools to develop a complete algorithm for computing the set of non-properness of polynomials maps in the plane. In particular, this set, which we call \emph{the Jelonek set}, is a subset of…
Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only…
In \cite{Valette}, Guillaume and Anna Valette associate singular varieties $V_F$ to a polynomial mapping $F: \C^n \to \C^n$. In the case $F: \C^2 \to \C^2$, if the set $K_0(F)$ of critical values of $F$ is empty, then $F$ is not proper if…
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with…