Related papers: Interval systems over idempotent semiring
The interval approach to computation of dynamics of celestial bodies in the planetary problem has been considered. It is based on the refusal from idealization of infinitely high resolving capacity of measuring tools, and forms an…
System identification is an important area of science, which aims to describe the characteristics of the system, representing them by mathematical models. Since many of these models can be seen as recursive functions, it is extremely…
We consider a wide class of the discrete optimization problems with interval objective function. We give a generalization of the greedy algorithm for the problems. Using the algorithm, we obtain the set of all possible greedy solutions and…
We consider the problem of numerically solving the Schr\"odinger equation with a potential that is quasi periodic in space and time. We introduce a numerical scheme based on a newly developed multi-time scale and averaging technique. We…
The two-particle models in de Sitter space-time with time-asymmetric retarded-advanced interactions are constructed. Particular cases of the field-type electromagnetic and scalar interactions are considered. The manifestly covariant…
For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…
Motivated by problems in optimization we study the sparsity of the solutions to systems of linear Diophantine equations and linear integer programs, i.e., the number of non-zero entries of a solution, which is often referred to as the…
The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by $A \in\mathbb{Z}^{m\times{}n}$ and present an algorithm to solve such problems in polynomial-time provided that both the…
The purpose of this paper is to propose a semi-analytical technique convenient for numerical approximation of solutions of the initial value problem for $p$-dimensional delayed and neutral differential systems with constant, proportional…
Interval linear programming provides a tool for solving real-world optimization problems under interval-valued uncertainty. Instead of approximating or estimating crisp input data, the coefficients of an interval program may perturb…
In this paper we investigate about the congruence generated by Y on quasi completely regular semirings and obtained the interval which Y* belongs to on quasi completely regular semirings.
The main purpose of this paper is to investigate the zero-divisors of semigroups with zero and semirings and in particular, to discuss eversible and reversible semigroups and semirings. We also introduce a new ring-like algebraic structure…
A rich set of frequentist model averaging methods has been developed, but their applications have largely been limited to point prediction, as measuring prediction uncertainty in general settings remains an open problem. In this paper we…
We revisit the complexity of the classical Interval Scheduling in the dynamic setting. In this problem, the goal is to maintain a set of intervals under insertions and deletions and report the size of the maximum size subset of pairwise…
We design the first polynomial time approximation schemes (PTASs) for the Minimum Betweenness problem in tournaments and some related higher arity ranking problems. This settles the approximation status of the Betweenness problem in…
This book has four chapters. In the first chapter interval bistructures (biinterval structures) such as interval bisemigroup, interval bigroupoid, interval bigroup and interval biloops are introduced. Throughout this book we work only with…
The commutative semiring $\mathbf{D}$ of finite, discrete-time dynamical systems was introduced in order to study their (de)composition from an algebraic point of view. However, many decision problems related to solving polynomial equations…
Let $S$ be an additively idempotent semiring and $\mathbf{M}_n(S)$ be the semiring of all $n\times n$ matrices over $S$. We characterize the conditions of when the semiring $\mathbf{M}_n(S)$ is congruence-simple provided that the semiring…