Related papers: Computing transcendence and linear relations of 1-…
We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
In this paper, we study the growth of transcendental entire solutions of linear difference equations \begin{equation} P_m(z)\Delta^mf(z)+\cdots+P_1(z)\Delta f(z)+P_0(z)f(z)=0,\tag{+} \end{equation} where $P_j(z)$ are polynomials for…
A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been known. This paper introduces a new subclass of linear-interval orders. We call a partial…
A linear inference is a valid inequality of Boolean algebra in which each variable occurs at most once on each side. In this work we leverage recently developed graphical representations of linear formulae to build an implementation that is…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal')…
One-dimensional nonrelativistic systems are studied when time-independent potential interactions are involved. Their supersymmetries are determined and their closed subsets generating kinematical invariance Lie superalgebras are pointed…
An algebraic criterion that is sufficient to establish the existence of certain a priori estimates for the solution of first-order homogeneous linear characteristic problems is derived. Estimates of such kind ensure the stability of the…
We discuss as a fundamental characteristic of orthogonal polynomials like the existence of a Lie algebra behind them, can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we put…
We show that if a Laurent series $f\in\mathbb{C}((t))$ satisfies a particular kind of linear iterative equation, then $f$ is either a rational function or it is differentially transcendental over $\mathbb{C}(t)$. This condition is more…
This work focuses on the question of how identifiability of a mathematical model, that is, whether parameters can be recovered from data, is related to identifiability of its submodels. We look specifically at linear compartmental models…
Using Schmidt's Subspace Theorem, this paper improves and extends an existing transcendence result for sequences of algebraic numbers. The theorems thus produced correspond to a central theorem on the irrationality of sequences due to…
Achieving a provable exponential quantum speedup for an important machine learning task has been a central research goal since the seminal HHL quantum algorithm for solving linear systems and the subsequent quantum recommender systems…
In this paper we present an algorithm to compute all unirational fields of transcendence degree one containing a given finite set of multivariate rational functions. In particular, we provide an algorithm to decompose a multivariate…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
We construct canonical integral transforms, analogous to the Fourier transform, that have periods six and three. The existence of such transforms is shown to arise naturally from the expectation that the Schwartz space on the real line,…
We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is…