Related papers: An application of Kapteyn series to a problem from…
Motivated by queueing systems with heterogeneous parallel servers, we consider a class of structured multi-dimensional Markov processes whose state space can be partitioned into two parts: a finite set of boundary states and a structured…
For the challenging task of modeling multivariate time series, we propose a new class of models that use dependent Mat\'ern processes to capture the underlying structure of data, explain their interdependencies, and predict their unknown…
A FORTRAN program to simulate the operation of infinite servers queues is presented in this work. Poisson arrivals processes are considered but not only. For many parameters of interest in queuing systems study or application, either there…
A structure called a decision making problem is considered. The set of outcomes (consequences) is partially ordered according to the decision maker's preferences. The problem is how these preferences affect a decision maker to prefer one of…
We show that the higher-order matching problem is decidable using a game-theoretic argument.
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The…
We introduced with coauthors some years ago a solution to the problem of time in quantum gravity which consists in formulating the quantum theory in terms of real clocks. It combines Page and Wootters' relational proposal with Rovelli's…
We give a new and elementary proof of the nested Artin approximation Theorem for linear equations with algebraic power series coefficients. Moreover, for any Noetherian local subring of the ring of formal power series, we clarify the…
It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more…
A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: the distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a…
We propose a novel approach for analysing time series using complex network theory. We identify the recurrence matrix calculated from time series with the adjacency matrix of a complex network, and apply measures for the characterisation of…
We present a characterization of sets for which Cartwright's theorem holds true. The connection is discussed between these sets and sampling sets for entire functions of exponential type.
We propose a general solution to the problem of robust Bayesian inference in complex settings where outliers may be present. In practice, the automation of robust Bayesian analyses is important in the many applications involving large and…
How can complexity theory and algorithms benefit from practical advances in computing? We give a short overview of some prior work using practical computing to attack problems in computational complexity and algorithms, informally describe…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
We construct Quantum Representation Theory which describes quantum analogue of representations in frame of "non-commutative linear geometry" developed by Manin. To do it we generalise the internal hom-functor to the case of adjunction with…
In this paper we develop a method to compute the solution to a countable (finite or infinite) set of equations that occurs in many different fields including Markov processes that model queueing systems, birth-and-death processes and…
The exact solution of a Cauchy problem related to a linear second-order difference equation with constant noncommutative coefficients is reported.
We present Korovkin approximation theorems that incorporate summability methods. These result allows us to obtain a unified treatment of several previous results, focusing on the underlying structure and the properties that a summability…
It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…