Related papers: Interval systems over idempotent semiring
This paper is devoted to a new approach of the arithmetic of intervals. We present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any…
Interval calculus is a relatively new branch of mathematics. Initially understood as a set of tools to assess the quality of numerical calculations (rigorous control of rounding errors), it became a discipline in its own rights today.…
This work considers numerical methods for the time-dependent Schr\"{o}dinger equation of incommensurate systems. By using a plane wave method for spatial discretization, the incommensurate problem is lifted to a higher dimension that…
We consider a heat equation and a wave equation in a spatial interval over a time interval. This article deals with inverse problems of determining sizes of spatial intervals by extra boundary data of solutions of the governing equations.…
An incline is an additively idempotent semiring in which the product of two elements is always less than or equal to either factor. By making use of prime numbers, this paper proves that A^{11} is less than or equal to A^5 for all 3x3…
The objective of this paper is to find some inequalities satisfied by periodical solutions of multi-time Hamilton systems, when the Hamiltonian is convex. To our knowledge, this subject of first-order field theory is still open. Section 1…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
Aiming for a systematic feature-extraction from time series, we introduce the iterated-sums signature over arbitrary commutative semirings. The case of the tropical semiring is a central, and our motivating example. It leads to features of…
A persistence module $M$, with coefficients in a field $\mathbb{F}$, is a finite-dimensional linear representation of an equioriented quiver of type $A_n$ or, equivalently, a graded module over the ring of polynomials $\mathbb{F}[x]$. It is…
Recently, M. Kompatscher proved that for each finite supernilpotent algebra $\mathbf{A}$ in a congruence modular variety, there is a polynomial time algorithm to solve polynomial equations over this algebra. Let $\mu$ be the maximal arity…
Interval computation is widely used to certify computations that use floating point operations to avoid pitfalls related to rounding error introduced by inaccurate operations. Despite its popularity and practical benefits, support for…
In this work, initial-boundary value problems for the time-fractional Airy equation are considered on different intervals. We study the properties of potentials for this equation and, using these properties, construct solutions to the…
Inverse spectral problems for Sturm-Liouville operators on a finite interval with non-separated boundary conditions are studied in the central symmetric case, when the potential is symmetric with respect to the middle of the interval. We…
In this paper we propose some very promissing results in interval arithmetics which permit to build well-defined arithmetics including distributivity of multiplication and division according addition and substraction. Thus, it allows to…
The present paper is concerned with a space-time homogenization problem for nonlinear diffusion equations with periodically oscillating (in space and time) coefficients. Main results consist of a homogenization theorem (i.e., convergence of…
We consider perturbations of interval maps with indifferent fixed points, which we refer to as wobbly interval intermittent maps, for which stable laws for general H\"older observables fail. We obtain limit laws for such maps and H\"older…
Dey and Xin (J.Appl.Comput.Top., 2022, arXiv:1904.03766) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators…
We study \emph{sublinear} algorithms that solve linear systems locally. In the classical version of this problem the input is a matrix $S\in \mathbb{R}^{n\times n}$ and a vector $b\in\mathbb{R}^n$ in the range of $S$, and the goal is to…
We consider the problem of finding \textit{semi-matching} in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms for both weighted and unweighted case. For the…
We study an interval ordering problem introduced by D\"urr et al. [Discrete Appl. Math. 2012] which is motivated by applications in bioinformatics. The task is to order a given set of n intervals with the goal of minimizing a certain…