English
Related papers

Related papers: A note on the binary additive divisor problem

200 papers

Let $A, B \subseteq \mathbb{N}$ be two finite sets of natural numbers. We say that $B$ is an additive divisor for $A$ if there exists some $C \subseteq \mathbb{N}$ with $A = B+C$. We prove that among those subsets of $\{0, 1, \ldots, k\}$…

Combinatorics · Mathematics 2024-09-24 Gal Gross

This paper presents a computationally efficient method for binary classification using Manski's (1975,1985) maximum score model when covariates are discretely distributed and parameters are partially but not point identified. We establish…

Econometrics · Economics 2025-07-29 Joel L. Horowitz , Sokbae Lee

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

Combinatorics · Mathematics 2022-05-17 Sergey Agievich

We show how to control the error term in Mertens' formula and related theorems in the context of additive arithmetical semigroups and carry over an old related result of Meissel.

Number Theory · Mathematics 2007-05-23 Stefan Wehmeier

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

Information Theory · Computer Science 2007-07-13 Beniamin Mounits , Tuvi Etzion , Simon Litsyn

In this work, we derive two-sided a posteriori error estimates for the dual-weighted residual (DWR) method. We consider both single and multiple goal functionals. Using a saturation assumption, we derive lower bounds yielding the efficiency…

Numerical Analysis · Mathematics 2018-11-20 Bernhard Endtmayer , Ulrich Langer , Thomas Wick

We study the distribution functions of several classical error terms in analytic number theory, focusing on the remainder term in the Dirichlet divisor problem $\Delta(x)$. We first bound the discrepancy between the distribution function of…

Number Theory · Mathematics 2024-10-07 Youness Lamzouri

In \cite{cheung2019optimally}, the authors presented two finite element methods for approximating second order boundary value problems on polytopial meshes with optimal accuracy without having to utilize curvilinear mappings. This was done…

Numerical Analysis · Mathematics 2023-01-11 James Cheung

Unconstrained submodular maximization captures many NP-hard combinatorial optimization problems, including Max-Cut, Max-Di-Cut, and variants of facility location problems. Recently, Buchbinder et al. presented a surprisingly simple linear…

Data Structures and Algorithms · Computer Science 2014-04-25 Norman Huang , Allan Borodin

Motivated by the sampling problems and heterogeneity issues common in high- dimensional big datasets, we consider a class of discordant additive index models. We propose method of moments based procedures for estimating the indices of such…

Statistics Theory · Mathematics 2018-07-19 Krishnakumar Balasubramanian , Jianqing Fan , Zhuoran Yang

We establish nontrivial bounds for bilinear sums involving the M\"obius function evaluated over solutions to a broad class of equations. Several of our results may be regarded as M\"obius-function analogues of the ternary Goldbach problem.…

Number Theory · Mathematics 2025-06-11 William D. Banks , Igor E. Shparlinski

In this note we extend the Dirac method to partial differential equations involving higher order roots of differential operators.

Mathematical Physics · Physics 2011-04-27 D. Babusci , G. Dattoli , M. Quattromini , P. E. Ricci

In this short note we derive, for bounded domains, an upper bound for a Friedrichs type constant in a weighted Friedrichs type inequality. This upper bound generalizes a well known upper bound of the Friedrichs constant. This upper bound is…

Analysis of PDEs · Mathematics 2019-03-05 Immanuel Anjam , Dirk Pauly

We propose a novel a posteriori error estimator for conforming finite element discretizations of two- and three-dimensional Helmholtz problems. The estimator is based on an equilibrated flux that is computed by solving patchwise mixed…

Numerical Analysis · Mathematics 2021-05-05 T. Chaumont-Frelet , A. Ern , M. Vohralík

We present a numerical method for rigorous over-approximation of a reachable set of differential inclusions. The method gives high-order error bounds for single step approximations and a uniform bound on the error over the finite time…

Classical Analysis and ODEs · Mathematics 2012-06-29 Sanja Gonzalez Zivanovic , Pieter Collins

Appropriate selection of the penalty parameter is crucial to obtaining good performance from the Alternating Direction Method of Multipliers (ADMM). While analytic results for optimal selection of this parameter are very limited, there is a…

Optimization and Control · Mathematics 2017-11-09 Brendt Wohlberg

The problem of binary hypothesis testing between two probability measures is considered. New sharp bounds are derived for the best achievable error probability of such tests based on independent and identically distributed observations.…

Information Theory · Computer Science 2024-05-30 Valentinian Lungu , Ioannis Kontoyiannis

The functional determinant multiplicative anomaly, or defect, is more closely investigated and explicit forms for products of linear operators are produced. I also present formulae for the defect of products of second order operators in…

High Energy Physics - Theory · Physics 2023-09-26 J. S. Dowker

A singularly perturbed linear system of second order ordinary differential equations of reaction-diffusion type with given boundary conditions is considered. The leading term of each equation is multiplied by a small positive parameter.…

Numerical Analysis · Mathematics 2009-06-23 M. Paramasivam , S. Valarmathi , J. J. H. Miller

Additive codes may have better parameters than linear codes. However, still very few cases are known and the explicit construction of such codes is a challenging problem. Here we show that a Griesmer type bound for the length of additive…

Information Theory · Computer Science 2026-05-11 Sascha Kurz