Related papers: Markov numbers of semigroups
Markov networks are models for compactly representing complex probability distributions. They are composed by a structure and a set of numerical weights. The structure qualitatively describes independences in the distribution, which can be…
A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…
We introduce a deformed squared Markov equation given by $X^2 + Y^2 + Z^2 + (q+q^{-1})(XY+YZ+XZ) = 3(1 + q + q^{-1})XYZ$. Symmetric solutions of this new equation present a remarkable factorization property which allows us to talk about…
We introduce square diagrams that represent numerical semigroups and we obtain an injection from the set of numerical semigroups into the set of Dyck paths.
We develop a general, functional calculus approach to approximation of $C_0$-semigroups on Banach spaces by bounded completely monotone functions of their generators. The approach comprises most of well-known approximation formulas, yields…
The subgroup pattern of a finite groups $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we present an algorithm for the computation of the subgroup…
In this paper, we introduce a new technique to study the distribution in residue classes of sets of integers with digit and sum-of-digits restrictions. From our main theorem, we derive a necessary and sufficient condition for integers with…
The first goal of the present paper is to study residualities of the set of uniform $P$-ergodic Markov semigroups defined on abstract state spaces by means of a generalized Dobrushin ergodicity coefficient. In the last part of the paper, we…
About two dozens of exactly solvable Markov chains on one-dimensional finite and semi-infinite integer lattices are constructed in terms of convolutions of orthogonality measures of the Krawtchouk, Hahn, Meixner, Charlier, $q$-Hahn,…
Recently there is a large amount of work devoted to the study of Markov chain stochastic gradient methods (MC-SGMs) which mainly focus on their convergence analysis for solving minimization problems. In this paper, we provide a…
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and Renyi about perfect matchings in random bipartite graphs.…
We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's…
We specify the structure of completely positive operators and quantum Markov semigroup generators that are symmetric with respect to a family of inner products, also providing new information on the order strucure an extreme points in some…
We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.
We define a reflective numerical semigroup of genus $g$ as a numerical semigroup that has a certain reflective symmetry when viewed within $\mathbb{Z}$ as an array with $g$ columns. Equivalently, a reflective numerical semigroup has one gap…
We describe Markov interval maps via branching systems and develop the theory of relative branching systems, characterizing when the associated representations of relative graph C*-algebras are faithful. When the Markov interval maps $f$…
We consider the problem of generating symmetric pseudo-random sign (+/-1) matrices based on the similarity of their spectra to Wigner's semicircular law. Using binary m-sequences (Golomb sequences) of lengths n=2^m-1, we give a simple…
The sizes of Markov equivalence classes of directed acyclic graphs play important roles in measuring the uncertainty and complexity in causal learning. A Markov equivalence class can be represented by an essential graph and its undirected…
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…
We study a colored generalization of the famous simple-switch Markov chain for sampling the set of graphs with a fixed degree sequence. Here we consider the space of graphs with colored vertices, in which we fix the degree sequence and…