Related papers: Algorithmic Boundedness-From-Below Conditions for …
A method of calculating probability values from a system of marginal constraints is presented. Previous systems for finding the probability of a single attribute have either made an independence assumption concerning the evidence or have…
The two-fermion bound system is an attractive subject of atomic and sub-atomic physics. Despite these systems are rather simple the study of two-particle bound states is challenging and still remains a source of progress in quantum theory.…
This paper investigates the boundedness of bilinear pseudo-differential operators with symbols in the H\"{o}rmander class $BS_{\varrho,\delta}^m(\mathbb{R}^n)$ in the previously unexplored regime $0 \leq \varrho < \delta < 1$. We establish…
We establish sufficient conditions of exact and almost full recovery of the node partition in Bipartite Stochastic Block Model (BSBM) using polynomial time algorithms. First, we improve upon the known conditions of almost full recovery by…
We present new results on Boolean matrix factorization and a new algorithm based on these results. The results emphasize the significance of factorizations that provide from-below approximations of the input matrix. While the previously…
For Fr{\'e}chet spaces E and F we write (E,F) \in {B} if every continuous linear operator from E to F is bounded. Let l be a Banach sequence space with a monotone norm in which the canonical system (e_{n}) is an unconditional basis. We…
Control barrier functions (CBFs) provide an effective framework for enforcing safety in dynamical systems with scalar constraints. However, many safety constraints are more naturally expressed as matrix-valued conditions, such as positive…
Separability of multivariate functions alleviates the difficulty in finding a minimum or maximum value of a function such that an optimal solution can be searched by solving several disjoint problems with lower dimensionalities. In most of…
We find optimal conditions on $m$-linear Fourier multipliers to give rise to bounded operators from a product of Hardy spaces $H^{p_j}$, $0<p_j\le 1$, to Lebesgue spaces $L^p$. The conditions we obtain are necessary and sufficient for…
Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recommendation. In many of these problems, the goal is to find a…
We propose \emph{Scalar-Tensor Baryogenesis} (STB), in which the $C\!P$-violating bias needed for baryogenesis is sourced by the \emph{gravitational} scalars that appear in scalar-tensor representations of modified gravity. Derivative…
We study an important special case of the differential elimination problem: given a polynomial parametric dynamical system $\mathbf{x}' = \mathbf{g}(\boldsymbol{\mu}, \mathbf{x})$ and a polynomial observation function $y =…
Consider the multidimensional Bessel operator $$B f(x) = -\sum_{j=1}^N \left(\partial_j^2 f(x) +\frac{\alpha_j}{x_j} \partial_j f(x)\right), \quad x\in(0,\infty)^N. $$ Let $d = \sum_{j=1}^N \max(1,\alpha_j+1)$ be the homogeneous dimension…
The main theme of this paper is to give sufficient conditions for the weighted boundedness of the bilinear fractional integral operator $\mathsf{BI}_\al$. The proposed condition involves the union of multilinear Muckenhoupt-type conditions.…
We develop fast and memory efficient numerical methods for learning functions of many variables that admit sparse representations in terms of general bounded orthonormal tensor product bases. Such functions appear in many applications…
We derive closed formulas for the condition number of a linear function of the total least squares solution. Given an over determined linear system Ax=b, we show that this condition number can be computed using the singular values and the…
In this paper we prove necessary conditions for the boundedness of fractional operators on the variable Lebesgue spaces. More precisely, we find necessary conditions on an exponent function $\pp$ for a fractional maximal operator $M_\alpha$…
The textbook adversary bound for function evaluation states that to evaluate a function $f\colon D\to C$ with success probability $\frac{1}{2}+\delta$ in the quantum query model, one needs at least $\left( 2\delta -\sqrt{1-4\delta^2}…
The electrostatic modeling of conductors is a fundamental challenge in various applications, including the prediction of parasitic effects in electrical interconnects, the design of biasing networks, and the modeling of biological,…
This paper addresses biquadratic polynomial programming (BPP), an NP-hard optimization problem closely related to biquadratic tensors. We first establish several necessary and sufficient conditions for the positive semi-definiteness and…