In this paper we give a full classification of global solutions the obstacle problem for fractional Laplacian (including thin problem) with compact coincidence set and at most polynomial growth in dimension N≥3. We do terms bijection onto polynomials describing asymptotics solution. Furthermore prove that sets are also convex if solution has quadratic growth.

The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These notions were further generalized by Grohe and Marx who introduced the fractional hypertree width of a hypergraph. All these width parameters on hypergraphs are useful for extending tractability of many problems in database...

This paper gathers the tools for solving Riemann-Liouville time fractional non-linear PDE’s by using a Galerkin method. method has advantage of not being more complicated than one used to solve same PDE with first order derivative. As model problem, existence and uniqueness is proved semilinear heat equations polynomial growth at infinity.

we find an explicit expression of the tutte polynomial of an $n$-fan. we also find a formula of the tutte polynomial of an $n$-wheel in terms of the tutte polynomial of $n$-fans. finally, we give an alternative expression of the tutte polynomial of an $n$-wheel and then prove the explicit formula for the tutte polynomial of an $n$-wheel.

In this paper, we propose a polynomial time algorithm for fractional assignment problems. The fractional assignment problem is interpreted as follows. Let G = (I; J;E) be a bipartite graph where I and J are vertex sets and E I J is an edge set. We call an edge subset X( E) an assignment if every vertex is incident to exactly one edge from X: Given an integer weight c ij and a positive integer w...

The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These notions were further generalized by Grohe and Marx, who introduced the fractional hypertree width of a hypergraph. All these width parameters on hypergraphs are useful for extending the tractability of many problems in dat...

We present a polynomial Hybrid Monte Carlo (PHMC) algorithm as an exact simulation algorithm with dy-namical Kogut-Susskind fermions. The algorithm uses a Hermitian polynomial approximation for the fractional power of the KS fermion matrix. The systematic error from the polynomial approximation is removed by the Kennedy-Kuti noisy Metropolis test so that the algorithm becomes exact at a finite ...

This paper builds on the notion of the so-called orthogonal derivative, where an n-th order derivative is approximated by an integral involving an orthogonal polynomial of degree n. This notion was reviewed in great detail in a paper by the author and Koornwinder in 2012. Here, an approximation of the Weyl or Riemann–Liouville fractional derivative is considered by replacing the n-th derivative...

We consider mixed-integer sets of the type MIX = {x : Ax ≥ b; xi integer, i ∈ I}, where A is a totally unimodular matrix, b is an arbitrary vector and I is a nonempty subset of the column indices of A. We show that the problem of checking nonemptiness of a setMIX is NP-complete even in the case in which the system describes mixed-integer network flows with half-integral requirements on the node...

In this paper, constructed a fractional polynomial spline to compute the solution of FDEs; interpolation with coefficients must be using Caputo derivative. For provided function, error bounds were studied and stability analysis was completed. To consider numerical explanation for method compared, three examples studied. The which interpolates data, appears useful accurate in solving unique prob...