Related papers: The multiple Markov theorem on Angelesco sets
The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…
We study piecewise linear Markov maps, with countable Markov partitions, inspired by a problem of the Mikl\'os Schweitzer competition in 2022. We introduce $\ell$-Markov partitions and apply ideas of symbolic dynamics to our systems,…
The Alexander theorem (1923) and the Markov theorem (1936) are two classical results in knot theory that show respectively that every link is the closure of a braid and that braids that have the same closure are related by a finite number…
The purpose of this note is twofold: firstly to characterize all the sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ such that $$ \frac{\triangle}{{\bf \triangle} x(s-1/2)}P_{n+1}(x(s-1/2))=c_n(\triangle +2\,\mathrm{I})P_n(x(s-1/2)),…
We discuss the validity of the proof of the fixed numerator conjecture on Markov numbers, which is the main result of the paper mentioned in the title.
Let $w_{\lambda}(t)=(1-t^2)^{\lambda-1/2}$, $\lambda>-1/2$, be the Gegenbauer weight function, and $\Vert\cdot\Vert$ denote the associated $L_2$-norm, i.e., $$ \Vert f\Vert:=\Big(\int_{-1}^{1}w_{\lambda}(t)\vert f(t)\vert^2\,dt\Big)^{1/2}.…
This paper deals with the ergodicity and the existence of a strong law of large numbers for adaptive Markov Chain Monte Carlo. We show that a diminishing adaptation assumption together with a drift condition for positive recurrence is…
A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the…
The Alexander polynomial (1928) is the first polynomial invariant of links devised to help distinguish links up to isotopy. Fox's conjecture (1962) -- stating that the absolute values of the coefficients of the Alexander polynomial for any…
The methodology of Markov basis initiated by Diaconis and Sturmfels(1998) stimulated active research on Markov bases for more than ten years. It also motivated improvements of algorithms for Grobner basis computation for toric ideals, such…
We revisit the classical problem of approximating a stochastic differential equation by a discrete-time and discrete-space Markov chain. Our construction iterates Caratheodory's theorem over time to match the moments of the increments…
The Markov-Bernstein type inequalities between the norms of functions and of their derivatives are analysed for complex exponential polynomials. We establish a relation between the sharp constants in those inequalities and the stability…
We establish necessary and sufficient conditions for an arbitrary polynomial of degree $n$, especially with only real roots, to be trivial, i.e. to have the form a(x-b)^n. To do this, we derive new properties of polynomials and their roots.…
This paper explicitly details the relation between $M$-matrices, nonnegative roots of nonnegative matrices, and the embedding problem for finite-state stationary Markov chains. The set of nonsingular nonnegative matrices with arbitrary…
We generalize the Varchenko matrix of a hyperplane arrangement to oriented matroids. We show that the celebrated determinant formula for the Varchenko matrix, first proved by Varchenko, generalizes to oriented matroids. It follows that the…
Analogs of Laguerre and Meixner orthogonal polynomials in the algebra of symmetric functions are studied. This is a detailed exposition of part of the results announced in arXiv:1009.2037. The work is motivated by a connection with a model…
We present a new algorithm for computing a truncated Markov basis of a lattice. In general, this new algorithm is faster than existing methods. We then extend this new algorithm so that it solves the linear integer feasibility problem with…
It is well known that the classical families of orthogonal polynomials are characterized as eigenfunctions of a second order linear differential/difference operator. In this paper we present a study of classical orthogonal polynomials in a…
Recently, it was proved by Anari-Oveis Gharan-Vinzant, Anari-Liu-Oveis Gharan-Vinzant and Br\"{a}nd\'{e}n-Huh that, for any matroid $M$, its basis generating polynomial and its independent set generating polynomial are log-concave on the…
In this article, we establish some new second main theorems for meromorphic mappings of $\mathbb C^m$ into $\mathbb P^n(\mathbb C)$ and moving hypersurfaces with truncated counting functions. A uniqueness theorem for these mappings sharing…