Related papers: Decoding Rauzy Induction: An Effective Answer to B…
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…
The Fuzzy transform is ubiquitous in different research fields and applications, such as image and data compression, data mining, knowledge discovery, and the analysis of linguistic expressions. As a generalisation of the Fuzzy transform,…
We study the solutions of the inverse problem \[ g(z)=\int f(y) P_T(z,dy) \] for a given $g$, where $(P_t(\cdot,\cdot))_{t \geq 0}$ is the transition function of a given Markov process, $X$, and $T$ is a fixed deterministic time, which is…
Interval Pairwise Comparison Matrices have been widely used to account for uncertain statements concerning the preferences of decision makers. Several approaches have been proposed in the literature, such as multiplicative and fuzzy…
We suggest a two-matrix model depending on three (infinite) sets of parameters which interpolates between all the models proposed in arXiv:2206.13038, and defined there through $W$-representations. We also discuss further generalizations of…
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…
Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense…
Given a finite nonempty set of primes S, we build a graph $\mathcal{G}$ with vertex set $\mathbb{Q}$ by connecting x and y if the prime divisors of both the numerator and denominator of x-y are from S. In this paper we resolve two…
In this paper, we prove a criterion for existence of continuous non constant eigenfunctions for interval exchange transformations, that is for non topologically weak mixing. We first construct, for any m>3, uniquely ergodic interval…
The embedding problem for Markov chains is a famous problem in probability theory and only partial results are available up till now. In this paper, we propose a variant of the embedding problem called the reversible embedding problem which…
In the present work, a new time-dependent exchange theory is presented wherein the symmetry constraints, on a multi-electron wavefunction, are properly accounted for. In so doing, the equations of motion, incorporating the required…
We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…
The sequence reconstruction problem involves a model where a sequence is transmitted over several identical channels. This model investigates the minimum number of channels required for the unique reconstruction of the transmitted sequence.…
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
Autoregressive models have emerged as a powerful framework for modeling exchangeable sequences - i.i.d. observations when conditioned on some latent factor - enabling direct modeling of uncertainty from missing data (rather than a latent).…
For a given intuitionistic propositional formula A and a propositional variable x occurring in it, define the infinite sequence of formulae { A \_i | i$\ge$1} by letting A\_1 be A and A\_{i+1} be A(A\_i/x). Ruitenburg's Theorem [8] says…
The embedding problem of Markov transition matrices into continuous-time Markov semigroups is a classic problem that regained a lot of impetus and activities in recent years. We consider it here for the following generalisation of the…
This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a…
A rotated odometer is an infinite interval exchange transformation (IET) obtained as a composition of the von Neumann-Kakutani map and a finite IET of intervals of equal length. In this paper, we consider rotated odometers for which the…
Multiple conventions have been adopted for denoting Interval Exchange Transformations (IETs). The "non-labeled" convention was the original, while the "labeled" convention has proven convenient when investigating Flat Surfaces as described…