Related papers: Computing Lewis Weights to High Precision
Given a set $P$ of $n$ points in the plane and a multiset $W$ of $k$ weights with $k\leq n$, we assign each weight in $W$ to a distinct point in $P$ to minimize the maximum weighted distance from the weighted center of $P$ to any point in…
In this paper, we study the weighted estimates for multilinear Calder\'{o}n-Zygmund operators %with multiple $A_{\vec{P}}$ weights from $L^{p_1}(w_1)\times...\times L^{p_m}(w_m)$ to $L^{p}(v_{\vec{w}})$, where $1<p, p_1,...,p_m<\infty$ with…
The maximum independent set problem is one of the most important problems in graph algorithms and has been extensively studied in the line of research on the worst-case analysis of exact algorithms for NP-hard problems. In the weighted…
In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
Let $\mathfrak{g}$ be a semisimple Lie algebra over $\mathbb{C}$ having rank $l$ and let $V=L(\lambda)$ be an irreducible finite-dimensional $\mathfrak{g}$-module having highest weight $\lambda.$ Computations of weight multiplicities in…
We give a deterministic algorithm for approximately counting satisfying assignments of a degree-$d$ polynomial threshold function (PTF). Given a degree-$d$ input polynomial $p(x_1,\dots,x_n)$ over $R^n$ and a parameter $\epsilon> 0$, our…
In this paper, we establish $L^{\infty}$ and $L^{p}$ estimates for solutions of some polyharmonic elliptic equations via the Morse index. As far as we know, it seems to be the first time that such explicit estimates are obtained for…
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…
For $q$ a prime power, the discrete logarithm problem (DLP) in $\mathbb{F}_{q}$ consists in finding, for any $g \in \mathbb{F}_{q}^{\times}$ and $h \in \langle g \rangle$, an integer $x$ such that $g^x = h$. We present an algorithm for…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
We provide quantitative weighted estimates for the $L^p(w)$ norm of a maximal operator associated to cube skeletons in $\mathbb{R}^n$. The method of proof differs from the usual in the area of weighted inequalities since there are no…
In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form $w_i(\lambda) = a_i + \lambda \cdot b_i$ for $i \in \{1,\ldots,n\}$ depending on a real-valued parameter…
In this paper, we introduce an exact algorithm with a time complexity of $O^*(1.325^m)$ for the {\sc weighted mutually exclusive maximum set cover} problem, where $m$ is the number of subsets in the problem. This is an NP-hard motivated and…
Given a weighted bipartite graph $G = (L, R, E, w)$, the maximum weight matching (MWM) problem seeks to find a matching $M \subseteq E$ that maximizes the total weight $\sum_{e \in M} w(e)$. This paper presents a novel algorithm with a time…
This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that…
The ELM method has become widely used for classification and regressions problems as a result of its accuracy, simplicity and ease of use. The solution of the hidden layer weights by means of a matrix pseudoinverse operation is a…
We study the $\ell_p$ regression problem, which requires finding $\mathbf{x}\in\mathbb R^{d}$ that minimizes $\|\mathbf{A}\mathbf{x}-\mathbf{b}\|_p$ for a matrix $\mathbf{A}\in\mathbb R^{n \times d}$ and response vector…
This paper is devoted to the study of quantitative weighted norm estimates for martingale square functions in both scalar-weighted and matrix-weighted settings. In particular, we introduce the martingale square functions $S_W$ via matrix…
We investigate the weighted bounds for multilinear maximal functions and Calder\'on-Zygmund operators from $L^{p_1}(w_1)\times...\times L^{p_m}(w_m)$ to $L^{p}(v_{\vec{w}})$, where $1<p_1,...,p_m<\infty$ with $1/{p_1}+...+1/{p_m}=1/p$ and…