Related papers: Around the Razumov-Stroganov conjecture: proof of …

The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…

We study the uncertainties of the determination of the ground-state parameters from Shifman-Vainshtein-Zakharov (SVZ) sum rules, making use of the harmonic-oscillator potential model as an example. In this case, one knows the exact solution…

General local spin $S$ ground states, described by a Valence Bond Solid (VBS) on a two dimensional lattice are studied. The norm of these ground states is mapped to a classical O(3) model on the same lattice. Using this quantum-to-classical…

Analogous to Kolmogorov's theorem for the existence of stochastic processes describing random functions, we consider theorems for the existence of stochastic processes describing random measures, as limits of inverse measure systems.…

We develop a metric and probabilistic theory for the Ostrogradsky representation of real numbers, i.e., the expansion of a real number $x$ in the following form: \begin{align*} x&= \sum_n\frac{(-1)^{n-1}}{q_1q_2... q_n}=…

This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

Consider a matroid where all elements are labeled with an element in $\mathbb{Z}$. We are interested in finding a base where the sum of the labels is congruent to $g \pmod m$. We show that this problem can be solved in $\tilde{O}(2^{4m} n…

Given a connected graph $G$ and its vertex $x$, let $U_x(G)$ denote the universal cover of $G$ obtained by unfolding $G$ into a tree starting from $x$. Let $T=T(n)$ be the minimum number such that, for graphs $G$ and $H$ with at most $n$…

We prove a full measurable version of Vizing's theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal{G}$ of degree uniformly bounded by $\Delta\in \mathbb{N}$ defined on a standard probability space…

We consider a random field, defined on an integer-valued d-dimensional lattice, with covariance function satisfying a condition more general than summability. Such condition appeared in the well-known Newman's conjecture concerning the…

We exhibit an explicit sufficient condition for the Lyapunov exponents of a linear cocycle over a Markov map to have multiplicity 1. This builds on work of Guivarc'h-Raugi and Gol'dsheid-Margulis, who considered products of random matrices,…

Finding spanning structures with many distinct colours in properly edge-coloured graphs is a central theme in extremal combinatorics. A classical result of Andersen shows that every proper edge-colouring of the complete graph $K_n$ contains…

We consider a vector of $N$ independent binary variables, each with a different probability of success. The distribution of the vector conditional on its sum is known as the conditional Bernoulli distribution. Assuming that $N$ goes to…

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

Let $c$ be a proper edge colouring of a graph $G=(V,E)$ with integers $1,2,\ldots,k$. Then $k\geq \Delta(G)$, while by Vizing's theorem, no more than $k=\Delta(G)+1$ is necessary for constructing such $c$. On the course of investigating…

We show that the system of equations \begin{align*} \sum_{i=1}^s (x_i^j-y_i^j) = a_j \qquad (1 \le j \le k) \end{align*} has appreciably fewer solutions in the subcritical range $s < k(k+1)/2$ than its homogeneous counterpart, provided that…

We provide a characterisation of the continuous-time Markov models where the Markov matrices from the model can be parameterised directly in terms of the associated rate matrices (generators). That is, each Markov matrix can be expressed as…

Among other results, the purpose of this article is to show the existence of an $\mathbb{R}$-space-vector with basis $\omega^i_j $, $i, j$ are integers such that every graph with n vertex $n \geq 3$ is the vector: $$\mathcal{V}(n) =…

We consider the level 1 solution of quantum Knizhnik-Zamolodchikov equation with reflecting boundary conditions which is relevant to the Temperley--Lieb model of loops on a strip. By use of integral formulae we prove conjectures relating it…

Let $\Psi_n$ be a product of $n$ independent, identically distributed random matrices $M$, with the properties that $\Psi_n$ is bounded in $n$, and that $M$ has a deterministic (constant) invariant vector. Assuming that the probability of…