Related papers: A Tenth Hilbert Problem-like Result: The Decidabil…
Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…
The definition of conservative-irreversible functions is extended to smooth manifolds. The local representation of these functions is studied and reveals that not each conservative-irreversible function is given by the weighted product of…
The determinisation problem for min-plus (tropical) weighted automata was recently shown to be decidable. However, the proof is purely existential, relying on several non-constructive arguments. Our contribution in this work is twofold:…
It was proposed that the tensor product structure of the Hilbert space is uniquely determined by the Hamiltonian's spectrum, for most finite-dimensional cases satisfying certain conditions. I show that any such method would lead to…
Hilbert's 10th problem, stated in modern terms, is: Find an algorithm that will, given $p \in \mathbb{Z}[x_1,\ldots,x_n]$ determine if there exists $a_1, a_2, \ldots, a_n \in \mathbb{Z}$ such that $p(a_1,\ldots,a_n)=0$. Davis, Putnam,…
Graphical models are powerful tools for capturing conditional dependence structures in complex systems but remain underexplored in analyzing ordinal data, especially in sports analytics. Ordinal variables, such as team rankings, player…
Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums…
This paper proposes a novel way to solve transient linear, and non-linear solid dynamics for compressible, nearly incompressible, and incompressible material in the updated Lagrangian framework for tetrahedral unstructured finite elements.…
We find conditions which guarantee moment (in)determinacy of powers and products of nonnegative random variables. We establish new and general results which are based either on the rate of growth of the moments of a random variable or on…
A Dirichlet-type problem is studied for an equation of even order with variable coefficients. A criterion for the uniqueness of a solution is given. The solution is built in the form of a Fourier series. When justifying the convergence of…
The aim of this article is to investigate the multiple-high-order pole solutions to the focusing NLS equation with quartic terms(QNLS) under the non-vanishing boundary conditions(NVBC) via the Riemann-Hilbert(RH) method. The determinant…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…
In this paper we study the complexity of solving orientable quadratic equations in wreath products $A\wr B$ of finitely generated abelian groups. We give a classification of cases (depending on genus and other characteristics of a given…
We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such…
We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…
We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This…
We consider Markov decision processes (MDPs) in which the transition probabilities and rewards belong to an uncertainty set parametrized by a collection of random variables. The probability distributions for these random parameters are…