Related papers: Computing the partition function of a polynomial o…
Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…
A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let $\epsilon,n,\eta$ be the energy gap, the system size, and the desired precision, respectively.…
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a…
We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…
We obtain an estimate for uniform approximation rate of bounded analytic in the unit disk functions by logarithmic derivatives of $C$-polynomials, i.e., polynomials, all of whose zeros lie on the unit circle $C:|z|=1$.
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…
Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…
The approximate non-deterministic degree of a Boolean function $f$, denoted $\mathsf{ndeg}_\epsilon(f)$ (written $\mathsf{N}_\epsilon(f)$ for brevity), is the minimum degree of a real polynomial $p$ such that $0 \le |p(x)| \le \epsilon$…
Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…
We show that, for almost all N-variable Boolean functions f, at least N/4-O(\sqrt{N} log N) queries are required to compute f in quantum black-box model with bounded error.
In the quantum theory, using the notion of partial supersymmetry, in which some, but not all, operators have superpartners we derive the Euler theorem in partition theory. The paraferminic partition function gives another identity in…
We have done a study of the zero-dimensional $\lambda\phi^{4}$ model. Firstly, we exhibit the partition function as a simple exact expression in terms of the Macdonald's function for $Re(\lambda)>0$. Secondly, an analytic continuation of…
With the aim of derive a quasi-monomiality formulation in the context of discrete hypercomplex variables, one will amalgamate through a Clifford-algebraic structure of signature $(0,n)$ the umbral calculus framework with Lie-algebraic…
The algebraic degree is an important parameter of Boolean functions used in cryptography. When a function in a large number of variables is not given explicitly in algebraic normal form, it might not be feasible to compute its degree.…
For univalent and normalized functions $f$ the logarithmic coefficients $\gamma_n(f)$ are determined by the formula $\log(f(z)/z)=\sum_{n=1}^{\infty}2\gamma_n(f)z^n$. In the paper \cite{Pon} the authors posed the conjecture that a locally…
We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for, parametric optimization. The idea is to first consider the variable x1 as a parameter and solve the…
The Fourier-Walsh expansion of a Boolean function $f \colon \{0,1\}^n \rightarrow \{0,1\}$ is its unique representation as a multilinear polynomial. The Kindler-Safra theorem (2002) asserts that if in the expansion of $f$, the total weight…
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…
We describe a subdivision algorithm for isolating the complex roots of a polynomial $F\in\mathbb{C}[x]$. Given an oracle that provides approximations of each of the coefficients of $F$ to any absolute error bound and given an arbitrary…