Related papers: A note on the planar Skorokhod embedding problem
In the recent paper [arXiv:1612.06893] P. B\"urgisser and A. Lerario introduced a geometric framework for a probabilistic study of real Schubert Problems. They denoted by $\delta_{k,n}$ the average number of projective $k$-planes in…
In this note we give a proof of the Sobolev and Morrey embedding theorems based on the representation of functions in terms of the fundamental solution of suitable partial differential operators. We also prove the compactness of the Sobolev…
The moment problem is an important problem in Functional Analysis and in Probability measure. It goes back to Stieltjes, around 1890. There is still an important ongoing interest in the recent literature. But, up today, the main theoretical…
In this paper, we construct a counterexample to a question by Cantelli, asking whether there exists a nonconstant positive measurable function $\varphi$ such that for i.i.d. r.v. $X,Y$ of law $\mathcal{N}(0,1)$, the r.v. $X+\varphi(X)\cdot…
In his book on Convex Polyhedra (section 7.2), A.D. Aleksandrov raised a general question of finding variational statements and proofs of existence of polytopes with given geometric data. The first goal of this paper is to give a…
The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both…
Randomized subspace embedding methods have had a great impact on the solution of a linear least squares (LS) problem by reducing its row dimension, leading to a randomized or sketched LS (sLS) problem, and use the solution of the sLS…
In the $k$-Orthogonal Vectors ($k$-OV) problem we are given $k$ sets, each containing $n$ binary vectors of dimension $d=n^{o(1)}$, and our goal is to pick one vector from each set so that at each coordinate at least one vector has a zero.…
Let $(X_n \colon n\in\Z)$ be a two-sided recurrent Markov chain with fixed initial state $X_0$ and let $\nu$ be a probability measure on its state space. We give a necessary and sufficient criterion for the existence of a non-randomized…
We introduce intrinsic Sobolev-Slobodeckij spaces for a class of ultra-parabolic Kolmogorov type operators satisfying the weak H\"ormander condition. We prove continuous embeddings into Lorentz and intrinsic H\"older spaces. We also prove…
The Sinkhorn algorithm is the most popular method for solving the entropy minimization problem called the Schr\"odinger problem: in the non-degenerate cases, the latter admits a unique solution towards which the algorithm converges…
In this paper we consider the Skorokhod embedding problem in Brownian motion. In particular, we give a solution based on the local time at zero of a variably skewed Brownian motion related to the underlying Brownian motion. Special cases of…
For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable…
Determining whether two STRIPS planning instances are isomorphic is the simplest form of comparison between planning instances. It is also a particular case of the problem concerned with finding an isomorphism between a planning instance…
In the Art Gallery Problem we are given a polygon $P\subset [0,L]^2$ on $n$ vertices and a number $k$. We want to find a guard set $G$ of size $k$, such that each point in $P$ is seen by a guard in $G$. Formally, a guard $g$ sees a point $p…
In this paper we develop a new weak convergence and compact embedding method to study the existence and uniqueness of the $L_{\rho}^2({\mathbb{R}^{d}};{\mathbb{R}^{1}})\otimes L_{\rho}^2({\mathbb{R}^{d}};{\mathbb{R}^{d}})$ valued solution…
A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed and has some known error model. What if…
The exponential B-spline basis function set is used to develop a collocation method for some initial boundary value problems (IBVPs) to the Gardner equation. The Gardner equation has two nonlinear terms, namely quadratic and cubic ones. The…
Let EMBED(k,d) be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into R^d? Known results easily imply polynomiality of EMBED(k,2) (k=1,2;…
Shephard (Canad. J. Math. 26: 302-321, 1974) proved a decomposition theorem for zonotopes yielding a simple formula for their volume. In this note we prove a generalization of this theorem yielding similar formulas for their intrinsic…