Related papers: Lattice models and generalized Rogers Ramanujan id…

We propose a general error analysis related to the low-rank approximation of a given real matrix in both the spectral and Frobenius norms. First, we derive deterministic error bounds that hold with some minimal assumptions. Second, we…

Following [7,8], we analyze regularity properties of single-site probability distributions of the random potential and of the Integrated Density of States (IDS) in the Anderson models with infinite-range interactions and arbitrary…

Two new generalizations of the relation of comonotonicity of lattice-valued vectors are introduced and discussed. These new relations coincide on distributive lattices and they share several properties with the comonotonicity for the…

We prove tight probabilistic bounds for the shortest vectors in module lattices over number fields using the results of arXiv:2308.15275. Moreover, establishing asymptotic formulae for counts of fixed rank matrices with algebraic integer…

We determine the joint distribution of the lengths of, and angles between, the N shortest lattice vectors in a random n-dimensional lattice as n tends to infinity. Moreover we interpret the result in terms of eigenvalues and eigenfunctions…

Let $A$ be a $r\times r$ rational nonzero symmetric matrix, $B$ a rational column vector, $C$ a rational scalar. For any integer lattice $L$ and vector $v$ of $\mathbb{Z}^r$, we define Nahm sum on the lattice coset $v+L\in \mathbb{Z}^r/L$:…

Following S\"odergren, we consider a collection of random variables on the space $X_n$ of unimodular lattices in dimension $n$: Normalizations of the angles between the $N = N(n)$ shortest vectors in a random unimodular lattice, and the…

We study numerically Anderson localization on lattices that are tree-like except for the presence of one loop of varying length $L$. The resulting expressions allow us to compute corrections to the Bethe lattice solution on i)…

The local convergence of alternating optimization methods with overrelaxation for low-rank matrix and tensor problems is established. The analysis is based on the linearization of the method which takes the form of an SOR iteration for a…

We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…

We prove a generalized version of Rogers' mean value formula in the space $X_n$ of unimodular lattices in $R^n$, which gives the mean value of a multiple sum over a lattice $L$ and its dual $L^*$. As an application, we prove that for $L$…

We study the large class of solvable lattice models, based on the data of conformal field theory. These models are constructed from any conformal field theory. We consider the lattice models based on affine algebras described by Jimbo et…

Let $S_n$ be a lattice random walk with mean zero and finite variance, and let $\Lambda^a_n$ be its occupation measure at level $a$. In this note, we prove local limit theorems for $\Pr[S_n=x,\Lambda^a_n=\ell]$ and…

We consider real symmetric and complex Hermitian random matrices with the additional symmetry $h_{xy}=h_{N-x,N-y}$. The matrix elements are independent (up to the fourfold symmetry) and not necessarily identically distributed. This ensemble…

We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…

The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…

We present a procedure in which known solutions to reflection equations for interaction-round-a-face lattice models are used to construct new solutions. The procedure is particularly well-suited to models which have a known fusion hierarchy…

In this paper, we prove two identities on the partition of a totally positive algebraic integer over a totally real number field which are the generalization of the Sylvester Theorem and that of the Rogers-Ramanujan Identities.…

Reliability of a system is considered where the components' random lifetimes may be dependent. The structure of the system is described by an associated "lattice polynomial" function. Based on that descriptor, general framework formulas are…

The lifetime of a system of connected units under some natural assumptions can be represented as a random variable Y defined as a weighted lattice polynomial of random lifetimes of its components. As such, the concept of a random variable Y…