Related papers: Computing the nearest $\Omega$-admissible descript…
We consider the family of singularly nonautonomous plate equation with structural damping \[ u_{tt} + a(t,x)u_{t} + (- \Delta) u_{t} + (-\Delta)^{2} u + \lambda u = f(u), \] in a bounded domain $\Omega \subset \R^n$, with Navier boundary…
The Metropolis-Hastings algorithm allows one to sample asymptotically from any probability distribution $\pi$. There has been recently much work devoted to the development of variants of the MH update which can handle scenarios where such…
We demonstrate how a one parameter family of interacting non-commuting Hamiltonians, which are physically equivalent, can be constructed in non-commutative quantum mechanics. This construction is carried out exactly (to all orders in the…
In this paper we give a new, less restrictive condition for removability of singular sets, $E$, of smooth solutions to the m-Hessian equation (and also for more general fully nonlinear elliptic equations) in $\Omega \setminus E$, $\Omega…
An exact result for the reduced density matrix on a finite interval for a $1+1$ dimensional free real scalar field in the ground state is presented. In the massless case, the Williamson decomposition of the appearing kernels is explicitly…
In this work, the space of admissible entropy functions for the compressible multicomponent Euler equations is explored, following up on [Harten, \textit{J. Comput. Phys.}, 49 (1), 1983, pp. 151-164]. This effort allows us to prove a…
A novel matching based heuristic algorithm designed to detect specially formulated infeasible zero-one IPs is presented. The algorithm input is a set of nested doubly stochastic subsystems and a set E of instance defining variables set at…
We consider optimal interpolation of functions analytic in simply connected domains in the complex plane. By choosing a specific structure for the approximant, we show that the resulting first order optimality conditions can be interpreted…
We study the problem of list-decodable sparse mean estimation. Specifically, for a parameter $\alpha \in (0, 1/2)$, we are given $m$ points in $\mathbb{R}^n$, $\lfloor \alpha m \rfloor$ of which are i.i.d. samples from a distribution $D$…
We study embedding a subset $K$ of the unit sphere to the Hamming cube $\{-1,+1\}^m$. We characterize the tradeoff between distortion and sample complexity $m$ in terms of the Gaussian width $\omega(K)$ of the set. For subspaces and several…
The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…
When are asymptotic approximations using the delta-method uniformly valid? We provide sufficient conditions as well as closely related necessary conditions for uniform negligibility of the remainder of such approximations. These conditions…
An oblivious subspace embedding (OSE), characterized by parameters $m,n,d,\epsilon,\delta$, is a random matrix $\Pi\in \mathbb{R}^{m\times n}$ such that for any $d$-dimensional subspace $T\subseteq \mathbb{R}^n$, $\Pr_\Pi[\forall x\in T,…
We propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix of maximal row rank without columns of zeros, we associate a symmetric whole…
Given a graph $\Gamma = (V, E)$ on $n$ vertices and $m$ edges, we define the Erd\H{o}s-R\'{e}nyi graph process with host $\Gamma$ as follows. A permutation $e_1,\dots,e_m$ of $E$ is chosen uniformly at random, and for $t\leq m$ we let…
This paper focuses on a class of binary orthogonal optimization problems frequently arising in semantic hashing. Consider that this class of problems may have an empty feasible set, rendering them not well-defined. We introduce an…
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…
Given a bounded domain $\Omega \subset {\Bbb R}^d$ with positive measure and a finite set $A=\{a^1, a^2, \dots, a^d\}$, we say that the set ${\mathcal E}(A)={\{e^{2 \pi i x \cdot a^j}\}}_{a^j \in A}$ is a complete exponential system if for…
This paper is the companion article to [Ann. Probab. 39 (2011) 779--856]. We consider a discrete elliptic equation on the $d$-dimensional lattice $\mathbb{Z}^d$ with random coefficients $A$ of the simplest type: They are identically…
Many real-world data sets are sparse or almost sparse. One method to measure this for a matrix $A\in \mathbb{R}^{n\times n}$ is the \emph{numerical sparsity}, denoted $\mathsf{ns}(A)$, defined as the minimum $k\geq 1$ such that…