A Survey of Counterexamples to Hilbert's Fourteenth Problem

We survey counterexamples to Hilbert’s Fourteenth Problem, beginning with those of Nagata in the late 1950s, and including recent counterexamples in low dimension constructed with locally nilpotent derivations. Historical framework and pertinent references are provided. We also include 8 important open questions.

A Fast Algorithm for Weber Problem on a Grid

AMS subject classification: 90B80.

On an ODE Relevant for the General Theory of the Hyperbolic Cauchy Problem

2000 Mathematics Subject Classification: 34E20, 35L80, 35L15.

Ontology View on Automata Theory

The summary of automata theory ontology is presented in the paper. It is based on the following dependences: a type of an automaton – the language accepted by the automaton – applications. The given ontology does not claim to be exhaustive as automata theory is very extensive and it is a complicated problem to survey all its aspects within one article. Only the main properties of automata and their applications are considered.

Highest Weight Modules of W1+∞, Darboux Transformations and the Bispectral Problem

This paper is a survey of our recent results on the bispectral problem. We describe a new method for constructing bispectral algebras of any rank and illustrate the method by a series of new examples as well as by all previously known ones. Next we exhibit a close connection of the bispectral problem to the representation theory of W1+∞–algerba. This connection allows us to explain and generalise to any rank the result of Magri and Zubelli on the symmetries of the manifold of the bispectral operators of rank and order two.

The Development of the Generalization Algorithm Based on the Rough Set Theory

This paper considers the problem of concept generalization in decision-making systems where such features of real-world databases as large size, incompleteness and inconsistence of the stored information are taken into account. The methods of the rough set theory (like lower and upper approximations, positive regions and reducts) are used for the solving of this problem. The new discretization algorithm of the continuous attributes is proposed. It essentially increases an overall performance of generalization algorithms and can be applied to processing of real value attributes in large data tables. Also the search algorithm of the significant attributes combined with a stage of discretization is developed. It allows avoiding splitting of continuous domains of insignificant attributes into intervals.

Stability of an Optimal Schedule for a Job-Shop Problem with Two Jobs

The usual assumption that the processing times of the operations are known in advance is the strictest one in scheduling theory. This assumption essentially restricts practical aspects of deterministic scheduling theory since it is not valid for the most processes arising in practice. The paper is devoted to a stability analysis of an optimal schedule, which may help to extend the significance of scheduling theory for decision-making in the real-world applications. The term stability is generally used for the phase of an algorithm, at which an optimal solution of a problem has already been found, and additional calculations are performed in order to study how solution optimality depends on variation of the numerical input data.

Caputo Derivatives in Viscoelasticity: A Non-Linear Finite-Deformation Theory for Tissue

Mathematics Subject Classification: 26A33, 74B20, 74D10, 74L15

On a 3D-Hypersingular Equation of a Problem for a Crack

MSC 2010: 45DB05, 45E05, 78A45

Financial Decisions via Methods of Guaranteed Control Theory

AMS subject classification: 93C95, 90A09.

Well-Behavior, Well-Posedness and Nonsmooth Analysis

AMS subject classification: 90C30, 90C33.

Interior Boundaries for Degenerate Elliptic Equations of Second Order Some Theory and Numerical Observations

2010 Mathematics Subject Classification: Primary 35J70; Secondary 35J15, 35D05.

Optimization Problem in a Class of Linear System. Application to Multiple Drug Administration

2000 Mathematics Subject Classification: 62H15, 62P10.

Sensor Location Problem for a Multigraph

MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35

Probabilistic Approach to the Neumann Problem for a Symmetric Operator

2000 Mathematics Subject Classification: Primary 60J45, 60J50, 35Cxx; Secondary 31Cxx.