In this paper, we consider the partial inverse assignment problem under l1 norm without bound constraints. We show that the partial inverse problem can be solved by a strongly polynomial algorithm. The technique for solving this problem can be extended to handle a special type of partial inverse 0.1 combinatorial optimization problems. © 2006 Elsevier B.V. All rights reserved.

The thesis develops a new approach to the central themes of algebraic coding theory. The focus here is the newly introduced concept of a partial-inverse polynomial in a quotient ring F [x]/m(x). In particular, the decoding of Reed-Solomon codes can be attributed to the computation of a partial-inverse polynomial. The problem of practical computation of a partial-inverse polynomial is closely re...

We look at the hypothesis that all honest onto polynomial-time computable functions have a polynomial-time computable inverse. We show this hypothesis equivalent to several other complexity conjectures including • In polynomial time, one can find accepting paths of nondeterministic polynomialtime Turing machines that accept Σ∗. • Every total multivalued nondeterministic function has a polynomia...

After discussing the Study point transformation operator, a unified way to formulate kinematic problems, using “points moving on planes or spheres” constraint equations, is introduced. Application to the direct kinematics problem solution of a number of different parallel Schönflies motion robots is then developed. Certain not widely used but useful tools of algebraic geometry are explained and...

Drop the term ∑ i1,...in 6=k λinpinin−1 · · · pi1j we obtain λj > Pk(X1 = j, Rk > 1) + Pk(X2 = j, Rk > 2) + · · ·+ Pk(Xn = j, Rk > n) → γ j as n→∞ (where Rk is the first return time of k) So we have λ > γ(k). If in addition P is invariant, then we proved earlier that γ(k) is invariant, so μ = λ − γ(k) is also invariant with μ > 0 and μk = λk − γ (k) k = 0. Since P is irreducible, for any i ∈ I,...

The objective of this paper is to study the performance of a sixth order polynomial approach to model hysteresis behaviour of a magnetorheological (MR) damper under harmonic excitations. The polynomial model is developed based on curve fitting from the experimental results and consists of a pair subsystem namely positive and negative acceleration which correspond to the upper and lower curves. ...

Using principles of the theory of smoothness spaces we give systematic constructions of scales of inverse-closed subalgebras of a given Banach algebra with the action of a d-parameter automorphism group. In particular we obtain the inverse-closedness of Besov algebras, Bessel potential algebras and approximation algebras of polynomial order in their defining algebra. By a proper choice of the g...

It is shown that a polynomial map F = (P, Q) of C with finite fibres is a polynomial automorphism if for all (a : b) ∈ P the polynomials aP + bQ are irreducible and the curves aP + bQ = 0 are rational curves. In consequence, a non-zero constant Jacobian polynomial map F of C is a polynomial automorphism if the inverse images F(l) of complex lines l ⊂ C passing through (0, 0) are irreducible rat...