5 citations · 34 across the 24 of their papers we have counts for
4 papers · 1 filter
A Comparison of the Triangle Algorithm and SMO for Solving the Hard Margin Problem
Mayank Gupta, Bahman Kalantari
In this article we consider the problem of testing, for two finite sets of points in the Euclidean space, if their convex hulls are disjoint and computing an optimal supporting hyp…
How Many Real Attractive Fixed Points Can A Polynomial Have?
Terence Coelho, Bahman Kalantari
We prove a complex polynomial of degree has at most attractive fixed points lying on a line. We also consider the general case.
A Necessary and Sufficient Condition for Local Maxima of Polynomial Modulus Over Unit Disc
Bahman Kalantari
An important quantity associated with a complex polynomial is , the maximum of its modulus over the unit disc . We prove, is a local max…
On intersective polynomials with non-solvable Galois group
Joachim König
We present new theoretical results on the existence of intersective polynomials with certain prescribed Galois groups, namely the projective and affine linear groups …