Related papers: Reflect-Push Methods Part I: Two Dimensional Techn…
One powerful technique to solve NP-hard optimization problems in practice is branch-and-reduce search---which is branch-and-bound that intermixes branching with reductions to decrease the input size. While this technique is known to be very…
A compressible Oldroyd--B type model with stress diffusion is derived from a compressible Navier--Stokes--Fokker--Planck system arising in the kinetic theory of dilute polymeric fluids, where polymer chains immersed in a barotropic,…
This paper explores the extension of dimension reduction (DR) techniques to the multi-dimension case by using the Einstein product. Our focus lies on graph-based methods, encompassing both linear and nonlinear approaches, within both…
A classical theorem of Ahlswede and Katona determines the maximum density of the $2$-edge star in a graph with a given edge density. Motivated by its application in hypergraph Tur\'{a}n problems, we establish a refinement of their result…
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…
We generalize the interpolative separable density fitting (ISDF) method, used for compressing the four-index electron repulsion integral (ERI) tensor, to incorporate adaptive real space grids for potentially highly localized single-particle…
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…
Set packing is a fundamental problem that generalises some well-known combinatorial optimization problems and knows a lot of applications. It is equivalent to hypergraph matching and it is strongly related to the maximum independent set…
For positive integers $n$ and $r$, we let $Q_n^r$ denote the $r$th power of the $n$-dimensional discrete hypercube graph, i.e., the graph with vertex-set $\{0,1\}^n$, where two 0-1 vectors are joined if they are Hamming distance at most $r$…
The fully discrete problem for convection-diffusion equation is considered. It comprises compact approximations for spatial discretization, and Crank-Nicolson scheme for temporal discretization. The expressions for the entries of inverse of…
We present an extension of two policy-iteration based algorithms on weighted graphs (viz., Markov Decision Problems and Max-Plus Algebras). This extension allows us to solve the following inverse problem: considering the weights of the…
We construct non-compactness examples for the fully coupled Einstein-Lichnerowicz constraint system in the focusing case. The construction is obtained by combining pointwise a priori asymptotic analysis techniques, finite-dimensional…
We consider a compressed sensing problem in which both the measurement and the sparsifying systems are assumed to be frames (not necessarily tight) of the underlying Hilbert space of signals, which may be finite or infinite dimensional. The…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
In a series of publications of the second author, including some with coauthors, globally strictly convex Tikhonov-like functionals were constructed for some nonlinear ill-posed problems. The main element of such a functional is the…
Tensor parameters that are amortized or regularized over large tensor powers, often called "asymptotic" tensor parameters, play a central role in several areas including algebraic complexity theory (constructing fast matrix multiplication…
We extend to multi-dimensions the work of [1], where new fully explicit kinetic methods were built for the approximation of linear and non-linear convection-diffusion problems. The fundamental principles from the earlier work are retained:…
We study the problem of distance-preserving graph compression for weighted paths and trees. The problem entails a weighted graph $G = (V, E)$ with non-negative weights, and a subset of edges $E^{\prime} \subset E$ which needs to be removed…
Boundary element methods for the Helmholtz equation lead to large dense matrices that can only be handled if efficient compression techniques are used. Directional compression techniques can reach good compression rates even for…
As noted by Witten, compactifying a $d$-dimensional holographic CFT on an $S^1$ gives a class of $(d-1)$-dimensional confining theories with gravity duals. The prototypical bulk solution dual to the ground state is a double Wick rotation of…