Related papers: A Generalization of Markov Numbers
The Numerov method for linear second-order differential equations is generalized to include equations containing a first derivative term. The method presented has the same degree of accuracy as the ordinary Numerov sixth-order method. A…
In this paper we present a pure algebraic construction of the normal factorization of multimode squeezed states and calculate their inner products. This procedure allows one to orthonormalize bases generated by squeezed states. We calculate…
We study the dependence of a cluster algebra on the choice of coefficients. We write general formulas expressing the cluster variables in any cluster algebra in terms of the initial data; these formulas involve a family of polynomials…
In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer…
We define iteration of functions that map n-dimensional vector spaces into m-dimensional vector spaces (m at most equal to n). It happens that usual iteration and Fibonacci iterative methods become special cases of this generalized…
We introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual Cheeger inequalities for eigenvalues of normalized Laplace operators on weighted finite graphs. Our proof proposes a new spectral clustering…
In this announcement we generalize the Markov-Kakutani fixed point theorem for abelian semi-groups of affine transformations extending it on some class of non-commutative semi-groups. As an interesting example we apply it obtaining a…
Let $(\xi_n)_{n=0}^\infty$ be a nonhomogeneous Markov chain taking values from finite state-space of $\mathbf{X}=\{1,2,\ldots,b\}$. In this paper, we will study the generalized entropy ergodic theorem with almost-everywhere and…
Statistics and Optimization are foundational to modern Machine Learning. Here, we propose an alternative foundation based on Abstract Algebra, with mathematics that facilitates the analysis of learning. In this approach, the goal of the…
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…
We study algorithms to analyze a particular class of Markov population processes that is often used in epidemiology. More specifically, Markov binomial chains are the model that arises from stochastic time-discretizations of classical…
In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…
We develop general formulae for the numbers of conjugacy classes and irreducible complex characters of finite p-groups of nilpotency class less than p. This allows us to unify and generalize a number of existing enumerative results, and to…
We generalize Romanoff's theorem. Also, we obtain a result on sums related to Euler's totient function.
The purpose of this paper is to generalize a very famous result on products of normal operators, due to I. Kaplansky. The context of generalization is that of bounded hyponormal and unbounded normal operators on complex separable Hilbert…
We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the…
We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the…
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…