where Sn is the symmetric group of permutations on {1, 2, . . . , n}. Unlike the determinant, computing the exact value of the permanent of a given matrix is known to be #P-hard. Thus, most research has focused on finding approximation algorithms for and proving upper and lower bounds for restricted classes of matrices. A sharp upper-bound on the permanent the case of 0− 1 matrices was proved b...

here a posteriori error estimate for the numerical solution of nonlinear voltena- hammerstein equations is given. we present an error upper bound for nonlinear voltena-hammastein integral equations, in which the form of nonlinearity is algebraic and develop a posteriori error estimate for the recently proposed method of brunner for these problems (the implicitly linear collocation method).we al...

Abstract. A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly i > 0 interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in higher dimensions. In particular, there is only a finite number of quadratic polynomials with fixed leading coefficient being the h∗-polynomial of a ...

We show that the convergence proof of a recent algorithm called dist-EF-SGD for distributed stochastic gradient descent with communication efficiency using error-feedback Zheng et al. (NeurIPS 2019) is problematic mathematically. Concretely, original error bound arbitrary sequences learning rate unfortunately incorrect, leading to an invalidated upper in theorem algorithm. As evidences, we expl...

To take into account that expert’s degrees of certainty are not always comparable, researchers have used partially ordered set of degrees instead of the more traditional linearly (totally) ordered interval [0, 1]. In most cases, it is assumed that this partially ordered set is a lattice, i.e., every two elements have the greatest lower bound and the least upper bound. In this paper, we prove a ...

 In this paper, some basic results concerning strict, nonstrict inequalities, local existence theorem and differential inequalities  have been proved for an IVP of first order hybrid  random differential equations with the linear perturbation of second type. A comparison theorem is proved and  applied to prove the uniqueness of random solution for the considered perturbed random differential eq...

In this paper, we present a method for calculating lower and upper bounds on the mutual information of a broadband relay network. The analysis is carried out for a simple network consisting of a source, one relay and the destination. However, it can be easily extended to larger networks. The relay operates in a half-duplex mode and performs decode-and-forward. In order to overcome the effect of...