A QUANTUM ALGORITHM BASED ON ENTANGLEMENT MEASURE FOR CLASSIFYING BOOLEAN MULTIVARIATE FUNCTION INTO NOVEL HIDDEN CLASSES REVISITED

The algorithm that solves a generalized form of the Deutsch- Jozsa problem was proposed. This algorithm uses the degree of entanglement computing model to classify an arbitrary Oracle Uf to one of the 2n classes. In this paper, we will analyze this algorithm based on the degree of entanglement.

BOX DIMENSIONS OF THE RIEMANN–LIOUVILLE FRACTIONAL INTEGRAL OF HÖLDER CONTINUOUS MULTIVARIATE FUNCTIONS

If a continuous multivariate function satisfies a Lipschitz condition on its domain, Box dimension of its graph equals to the number of its arguments. Furthermore, Box dimension of the graph of its Riemann–Liouville fractional integral also equals to the number of its arguments.

A combinatorial analysis of Severi degrees

International audience Based on results by Brugallé and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees Nd,δ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic versionof a special function associated to long-edge graphs which appeared in Fomin-Mikhalkin’s formula, and conjecturedit to be linear. They have since proved their conjecture. At the same time, motivated by their conjecture, we considera special multivariate function associated to long-edge graphs that generalizes their function. The main result of thispaper is that the multivariate function we define is always linear.The first application of our linearity result is that by applying it to classical Severi degrees, we recover quadraticity of Qd,δ and a bound δ for the threshold of polynomiality ofNd,δ.Next, in joint work with Osserman, we apply thelinearity result to a special family of toric surfaces and obtain universal polynomial results having connections to the Göttsche-Yau-Zaslow formula. As a result, we provide combinatorial formulas for the two unidentified power series B1(q) and B2(q) appearing in the Göttsche-Yau-Zaslow formula.The proof of our linearity result is completely combinatorial. We defineτ-graphs which generalize long-edge graphs,and a closely related family of combinatorial objects we call (τ,n)-words. By introducing height functions and aconcept of irreducibility, we describe ways to decompose certain families of (τ,n)-words into irreducible words,which leads to the desired results.