Related papers: Rigidity for zero sets of Gaussian entire function…
Let $g$ be a entire function of exponential type on the complex plane $\mathbb C$, $Z=\{ z_k\}_{k=1,2,\dots}$ be a sequence of points in $\mathbb C$. We give a criterion for the existence of an entire function $f\neq 0$ of exponential type…
A function $f:\RR \to \RR$ is called \emph{vertically rigid} if $graph(cf)$ is isometric to $graph (f)$ for all $c \neq 0$. We prove Jankovi\'c's conjecture by showing that a continuous function is vertically rigid if and only if it is of…
We derive completeness criteria for sequences of functions of the form $% f(x\lambda_{n})$, where $\lambda_{n}$ is the $nth$ zero of a suitably chosen entire function. Using these criteria, we construct systems of nonorthogonal…
We propose a principled way to define Gaussian process priors on various sets of unweighted graphs: directed or undirected, with or without loops. We endow each of these sets with a geometric structure, inducing the notions of closeness and…
We investigate the complex Gaussian as well as non-Gaussian distributed random analytical and entire functions (complex entire random field) and calculate their domain of definiteness (radius of convergence) as well as some important…
We study geometric rigidity of a class of fractals, which is slightly larger than the collection of self-conformal sets. Namely, using a new method, we shall prove that a set of this class is contained in a smooth submanifold or is totally…
We put forward a new definition of complexity, for static and spherically symmetric self--gravitating systems, based on a quantity, hereafter referred to as complexity factor, that appears in the orthogonal splitting of the Riemann tensor,…
For any infinite zero-density integer set M, we found a rigid measure-preserving transformation mixing along M by answering Bergelson's question. Gaussian and Poisson suspensions over infinite constructions are suggested as suitable…
We show that every finitely-generated non-amenable linear group over a field of characteristic zero admits an ergodic action which is rigid in the sense of Popa. If this group has trivial solvable radical, we prove that these actions can be…
We summarize the recent results about complete solvability of Hermitian and rectangular complex matrix models. Partition functions have very simple character expansions with coefficients made from dimensions of representation of the linear…
Consider the following property of a topological group G: every continuous affine G-action on a Hilbert space with a bounded orbit has a fixed point. We prove that this property characterizes amenability for locally compact sigma-compact…
This paper studies coarse compactifications and their boundary. We introduce two alternative descriptions to Roe's original definition of coarse compactification. One approach uses bounded functions on $X$ that can be extended to the…
We develop a model-theoretic framework for the study of distal factors of strongly ergodic, measure-preserving dynamical systems of countable groups. Our main result is that all such factors are contained in the (existential) algebraic…
As part of a programme to classify quasi-Einstein metrics $(M,g,X)$ on closed manifolds and near-horizon geometries of extreme black holes, we study such spaces when the vector field $X$ is divergence-free but not identically zero. This…
The Gaussian process (GP) is a widely used probabilistic machine learning method with implicit uncertainty characterization for stochastic function approximation, stochastic modeling, and analyzing real-world measurements of nonlinear…
We study robust properties of zero sets of continuous maps $f:X\to\mathbb{R}^n$. Formally, we analyze the family $Z_r(f)=\{g^{-1}(0):\,\,\|g-f\|<r\}$ of all zero sets of all continuous maps $g$ closer to $f$ than $r$ in the max-norm. The…
We establish sharp global rigidity upper bounds for universal determinantal point processes describing edge eigenvalues of random matrices. For this, we first obtain a general result which can be applied to general (not necessarily…
This work represents a natural coalescence of two important lines of work: learning mixtures of Gaussians and algorithmic robust statistics. In particular we give the first provably robust algorithm for learning mixtures of any constant…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
Bayesian nonparametric regression under a rescaled Gaussian process prior offers smoothness-adaptive function estimation with near minimax-optimal error rates. Hierarchical extensions of this approach, equipped with stochastic variable…