相关论文: Translation invariant realizability problem on the…

There are various situations in which it is natural to ask whether a given collection of $k$ functions, $\rho_j(\r_1,...,\r_j)$, $j=1,...,k$, defined on a set $X$, are the first $k$ correlation functions of a point process on $X$. Here we…

A new realization of the conformal algebra is studied which mimics the behaviour of a statistical system on a discrete albeit infinite lattice. The two-point function is found from the requirement that it transforms covariantly under this…

We study the properties of the set of marginal distributions of infinite translation-invariant systems in the 2D square lattice. In cases where the local variables can only take a small number $d$ of possible values, we completely solve the…

We study multivariate integration of functions that are invariant under permutations (of subsets) of their arguments. We find an upper bound for the $n$th minimal worst case error and show that under certain conditions, it can be bounded…

We give sufficient conditions for the number rigidity of a translation invariant or periodic point process on $\mathbb{R}^d$, where $d=1,2$. That is, the probability distribution of the number of particles in a bounded domain $\Lambda…

This paper is concerned with networks of interacting linear systems at sites of a multidimensional lattice. The systems are governed by linear ODEs with constant coefficients driven by external inputs, and their internal dynamics and…

Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…

We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…

Distributionally Favorable Optimization (DFO) is an important framework for decision-making under uncertainty, with applications across fields such as reinforcement learning, online learning, robust statistics, chance-constrained…

The realizability problem is a well-known problem in the analysis of complex systems, which can be modeled as an infinite-dimensional moment problem. More precisely, as a truncated $K-$moment problem where $K$ is the space of all possible…

In this paper we consider integration and $L_2$-approximation for functions over $\RR^s$ from weighted Hermite spaces. The first part of the paper is devoted to a comparison of several weighted Hermite spaces that appear in literature,…

Finding classical canonical observables consists of taking a function space over phase space. For constrained theories, these functions must form zero brackets with a closed algebraic structure of first-class constraints. This brackets…

We study the error of the number of points of the lattice $\mathbb{Z}^{d}$ that fall into a dilated and translated hypercube centred around $0$ and whose axis are parallel to the axis of coordinates. We show that if $t$, the factor of…

This paper describes the formal verification of NP-hardness reduction functions of two key problems relevant in algebraic lattice theory: the closest vector problem and the shortest vector problem, both in the infinity norm. The…

We perform a duality transformation that allows one to express the partition function of the d-dimensional Ising model with random nearest neighbor coupling in terms of new spin variables defined on the square plaquettes of the lattice. The…

An outstanding problem in statistical mechanics is the determination of whether prescribed functional forms of the pair correlation function $g_2(r)$ [or equivalently, structure factor $S(k)$] at some number density $\rho$ can be achieved…

We consider approximation problems for a special space of d variate functions. We show that the problems have small number of active variables, as it has been postulated in the past using concentration of measure arguments. We also show…

We introduce and study Minimum Cut Representability, a framework to solve optimization and feasibility problems over stable matchings by representing them as minimum s-t cut problems on digraphs over rotations. We provide necessary and…

A translation on the d-dimensional torus $\mathbb{T}^d$ has the logarithm property if the Shrinking Target Property holds for the sequence of balls with radius $n^{-\frac{1}{d}}$. On $\mathbb{T}^1$ every irrational translations has this…

Upper bounds on the communication complexity of finding the nearest lattice point in a given lattice $\Lambda \subset \mathbb{R}^2$ was considered in earlier works~\cite{VB:2017}, for a two party, interactive communication model. Here we…