Related papers: Clairvoyant embedding in one dimension

Given any positive integers $m$ and $d$, we say the a sequence of points $(x_i)_{i\in I}$ in $\mathbb R^m$ is {\em Lipschitz-$d$-controlling} if one can select suitable values $y_i\; (i\in I)$ such that for every Lipschitz function…

Let $\mathcal{R}$ denote the set of integers $n$ that can be represented as the sum $n = x^2 + y^2$ with $(x,y) = 1$. Let $a$ and $b$ be integers with $a>0$, $a \nmid b$. We show that for sufficiently large positive integer $N$ there are…

The change of variable theorem is proved under the sole hypothesis of differentiability of the transformation. Specifically, it is shown under this hypothesis that the transformed integral equals the given one over every measurable subset…

I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot…

A result by C. C.-A. Cheng, J. H. Mckay and S. S.-S. Wang says the following: Suppose the Jacobian of $A$ and $B$ is invertible in $\mathbb{C}[x,y]$ and the Jacobian of $A$ and $w$ is zero for $A,B,w \in \mathbb{C}[x,y]$. Then $w \in…

The certification of entanglement dimensionality is of great importance in characterizing quantum systems. Recently, it is pointed out that quantum correlation of high-dimensional states can be simulated with a sequence of lower-dimensional…

This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…

We further investigate the class of models of a strongly dependent (first order complete) theory T, continuing math.LO/0406440. If |A|+|T|<= mu, I subseteq C, |I| >=beth_{|T|^+}(mu) then some J subseteq I of cardinality mu^+ is an…

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks…

Consider a random graph process with $n$ vertices corresponding to points $v_{i} \sim {Unif}[0,1]$ embedded randomly in the interval, and where edges are inserted between $v_{i}, v_{j}$ independently with probability given by the graphon…

The (2+1)-dimensional integrable M-XX equation is considered.

The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded…

Reflected random walk in higher dimension arises from an ordinary random walk (sum of i.i.d. random variables): whenever one of the reflecting coordinates becomes negative, its sign is changed, and the process continues from that modified…

When prior information is lacking, the go-to strategy for probabilistic inference is to combine a "default prior" and the likelihood via Bayes's theorem. Objective Bayes, (generalized) fiducial inference, etc. fall under this umbrella. This…

Given a finite nonempty sequence of integers S, by grouping adjacent terms it is always possible to write it, possibly in many ways, as S = X Y^k, where X and Y are sequences and Y is nonempty. Choose the version which maximizes the value…

Let $A$ be an artin algebra. The aim of this work is to describe the enlargements of an indecomposable complex in $\mathbf{C}_{n}(\mbox{proj} \,A)$, and to study the irreducible morphisms between them. Precisely, we prove that any…

This is the third of three papers about the Compression Theorem: if M^m is embedded in Q^q X R with a normal vector field and if q-m > 0, then the given vector field can be straightened (ie, made parallel to the given R direction) by an…

We give a dimension bound on the irreducible components of the characteristic variety of a system of linear partial differential equations defined from a suitable filtration of the Weyl algebra $A_{n}(k)$. This generalizes an important…

Shape constraints yield flexible middle grounds between fully nonparametric and fully parametric approaches to modeling distributions of data. The specific assumption of log-concavity is motivated by applications across economics, survival…