Necessary and Sufficient Conditions for the Extendability of Ternary Linear Codes

We give the necessary and sufficient conditions for the extendability of ternary linear codes of dimension k ≥ 5 with minimum distance d ≡ 1 or 2 (mod 3) from a geometrical point of view.

Sufficient Conditions of Optimality for Control Pproblem Governed by Variational Inequalities

* This work was completed while the author was visiting the University of Limoges. Support from the laboratoire “Analyse non-linéaire et Optimisation” is gratefully acknowledged.

On some Sufficient Conditions for High Breakdown Point of ML Estimators

High breakdown point estimators LME(k) and LT E(k) for location and scale are obtained for symmetrical exponentially decreasing density family.

Necessary and Sufficient Condition for Oscillations of Neutral Differential Equation

2000 Mathematics Subject Classification: 34K15, 34C10.

Second Order Optimality Conditions in Nonsmooth Unconstrained Optimization

AMS subject classification: 49J52, 90C30.

New Coefficient Conditions for Functions Starlike with Respect to Symmetric Points

2000 Mathematics Subject Classification: Primary 30C45, secondary 30C80.

Multialgebraic Systems in Information Granulation

In different fields a conception of granules is applied both as a group of elements defined by internal properties and as something inseparable whole reflecting external properties. Granular computing may be interpreted in terms of abstraction, generalization, clustering, levels of abstraction, levels of detail, and so on. We have proposed to use multialgebraic systems as a mathematical tool for synthesis and analysis of granules and granule structures. The theorem of necessary and sufficient conditions for multialgebraic systems existence has been proved.

Some Examples of Rigid Representations

*Research partially supported by INTAS grant 97-1644.

Examples Illustrating some Aspects of the Weak Deligne-Simpson Problem

Research partially supported by INTAS grant 97-1644

Ideal Criteria for both Ideal Criteria for both X2-dy2 = M1 And X2-dy2 = M2 to have Primitive Solutions for any Integers M1, M2 Prime to D > 0

This article provides necessary and sufficient conditions for both of the Diophantine equations X^2 − DY^2 = m1 and x^2 − Dy^2 = m2 to have primitive solutions when m1 , m2 ∈ Z, and D ∈ N is not a perfect square. This is given in terms of the ideal theory of the underlying real quadratic order Z[√D].

Integral Manifolds and Bounded Solutions of Singularly Perturbed Systems of Impulsive Differential Equations

Sufficient conditions for the existence of bounded solutions of singularly perturbed impulsive differential equations are obtained. For this purpose integral manifolds are used.

Abstract Subdifferential Calculus and Semi-Convex Functions

∗ The work is partially supported by NSFR Grant No MM 409/94.

Application of Lyapunov's Direct Method to the Existence of Integral Manifolds of Impulsive Differential Equations

The present paper investigates the existence of integral manifolds for impulsive differential equations with variable perturbations. By means of piecewise continuous functions which are generalizations of the classical Lyapunov’s functions, sufficient conditions for the existence of integral manifolds of such equations are found.

Integral Manifolds and Perturbations of the Nonlinear Part of Systems of Autonomous Differential Equations with Impulses at Fixed Moments

* This investigation was supported by the Bulgarian Ministry of Science and Education under Grant MM-7.

Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times

Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the job processing times. We find necessary and sufficient conditions (Theorem 1) when there exists a dominant permutation that is optimal for all possible realizations of the job processing times. Our computational studies show the percentage of the problems solvable under these conditions for the cases of randomly generated instances with n ≤ 100 . We also show how to use additional information about the processing times of the completed jobs during optimal realization of a schedule (Theorems 2 – 4). Computational studies for randomly generated instances with n ≤ 50 show the percentage of the two- machine flow-shop scheduling problems solvable under the sufficient conditions given in Theorems 2 – 4.