Related papers: Saturation of Markov Polynomials
This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…
We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and…
The classical $q$-analogue of the integers was recently generalized by Morier-Genoud and Ovsienko to give $q$-analogues of rational numbers. Some combinatorial interpretations are already known, namely as the rank generating functions for…
We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated to the chain form a linear space spanning a Lie algebra. The key…
Cumulants are a notion that comes from the classical probability theory, they are an alternative to a notion of moments. We adapt the probabilistic concept of cumulants to the setup of a linear space equipped with two multiplication…
In this paper, we first extend the celebrated PageRank modification to a higher-order Markov chain. Although this system has attractive theoretical properties, it is computationally intractable for many interesting problems. We next study a…
Let $p$ be a polynomial in several non-commuting variables with coefficients in a field $K$ of arbitrary characteristic. It has been conjectured that for any $n$, for $p$ multilinear, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by…
We prove complete monotonicity of sums of squares of generalized Baskakov basis functions by deriving the corresponding results for hypergeometric functions. Moreover, in the central Baskakov case we study the distribution of the complex…
The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].
We give a new and constructive proof of the existence of a special class of univariate polynomials whose graphs have preassigned shapes. By definition, all the critical points of a Morse polynomial function are real and distinct and all its…
Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…
Given a pure binomial ideal I in variables x_i, we define a new measure of the complexity of the saturation of I with respect to the product of the variables x_i, which we call the norm. We give a bound on the norm in terms of…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
The analysis of many problems of interest associated with Markov chains, e.g. stationary distributions, moments of first passage time distributions and moments of occupation time random variables, involves the solution of a system of linear…
We study multiplicative nested sums, which are generalizations of harmonic sums, and provide a calculation through multiplication of index matrices. Special cases interpret the index matrices as stochastic transition matrices of random…
Let $V$ be a symmetric convex body in $\R^m$. We prove sharp Bernstein-type inequalities for entire functions of exponential type with the spectrum in $V$ and discuss certain properties of the extremal functions. Markov-type inequalities…
In this article, we discuss and survey the recent progress towards the Schottky problem, and make some comments on the relations between the Andr{\'e}-Oort conjecture, Okounkov convex bodies, Coleman's conjecture, stable modular forms,…
We study piecewise linear Markov maps, with countable Markov partitions, inspired by a problem of the Mikl\'os Schweitzer competition of the J\'anos Bolyai Mathematical Society in 2022. We introduce $\ell$-Markov partitions and apply ideas…
We use the geometric reformulation of Markov's uniqueness conjecture in terms of the simple length spectrum on the modular torus to rewrite the conjecture in combinatorial terms by explicitly describing this set of lengths.
A wide class of ``counting'' problems have been studied in Computer Science. Three typical examples are the estimation of - (i) the permanent of an $n\times n$ 0-1 matrix, (ii) the partition function of certain $n-$ particle Statistical…