Related papers: Translation invariant realizability problem on the…
We prove Haag duality property of any translation invariant pure state on $\clb = \otimes_{\IZ}M_d(C), \;d \ge 2$, where $M_d(C)$ is the set of $d \times d$ dimensional matrices over field of complex numbers. We also prove a necessary and…
Our earlier article proved that if $n > 1$ translates of sublattices of $Z^d$ tile $Z^d$, and all the sublattices are Cartesian products of arithmetic progressions, then two of the tiles must be translates of each other. We re-prove this…
In this paper, we study tractability of $L_2$-approximation of one-periodic functions from weighted Korobov spaces in the worst-case setting. The considered weights are of product form. For the algorithms we allow information from the class…
We study non-trivial translation-invariant probability measures on the space of entire functions of one complex variable. The existence (and even an abundance) of such measures was proven by Benjamin Weiss. Answering Weiss question, we find…
In this article, we prove some results concerning the truncated two-point function of the infinite-range Ising model above and below the critical temperature. More precisely, if the coupling constants are of the form $J_{x}= \psi(x)e^{…
We study right tail large deviations of the logarithm of the partition function for directed lattice paths in i.i.d. random potentials. The main purpose is the derivation of explicit formulas for the $1+1$-dimensional exactly solvable case…
The integrable structure, recently revealed in some classical problems of the theory of functions in one complex variable, is discussed. Given a simply connected domain in the complex plane, bounded by a simple analytic curve, we consider…
Recently, a class of solvable interaction round the face lattice models (IRF) were constructed for an arbitrary rational conformal field theory (RCFT) and an arbitrary field in it. The Boltzmann weights of the lattice models are related in…
The problem of optimal real-time transmission of a Markov source under constraints on the expected number of transmissions is considered, both for the discounted and long term average cases. This setup is motivated by applications where…
Real-world machine learning applications may require functions that are fast-to-evaluate and interpretable. In particular, guaranteed monotonicity of the learned function can be critical to user trust. We propose meeting these goals for…
We consider infinite or periodic 2D triangular Ising lattices with arbitrary positive or negative nearest-neighbor couplings $K_i(\vec{r})$, where $\vec{r}$ and $i$ indicate the bond position and orientation, respectively. Iterative…
In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The algorithm works by converting a potentially large…
It is well-known that the functions $f \in L^1(\mathbb{R}^d)$ whose translates along a lattice $\Lambda$ form a tiling, can be completely characterized in terms of the zero set of their Fourier transform. We construct an example of a…
We consider optimal transport based distributionally robust optimization (DRO) problems with locally strongly convex transport cost functions and affine decision rules. Under conventional convexity assumptions on the underlying loss…
Set- and vector-valued optimization problems can be re-formulated as complete lattice-valued problems. This has several advantages, one of which is the existence of a clear-cut solution concept which includes the attainment as the infimum…
We study $L_2$-approximation problems $\text{APP}_d$ in the worst case setting in the weighted Korobov spaces $H_{d,\a,{\bm \ga}}$ with parameter sequences ${\bm \ga}=\{\ga_j\}$ and $\a=\{\az_j\}$ of positive real numbers $1\ge \ga_1\ge…
In this paper we consider $L_p$-approximation, $p \in \{2,\infty\}$, of periodic functions from weighted Korobov spaces. In particular, we discuss tractability properties of such problems, which means that we aim to relate the dependence of…
For a given directed tree and weights associated with vertices from a subtree the completion problem is to determine if these weights may be completed in a way to obtain a bounded weighted shift on the whole tree, which possibly satisfies…
Motivated by the geometric reduction of Cauchy--Szeg\H{o} projections on quadratic surfaces of higher codimension (Nagel--Ricci--Stein, 2001) and recent developments on the real-variable theory adapted to twisted multiparameter structures…
A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…