English
Related papers

Related papers: A Refinement of Pohst's Inequality

200 papers

We generalize McDiarmid's inequality for functions with bounded differences on a high probability set, using an extension argument. Those functions concentrate around their conditional expectations. We further extend the results to…

Machine Learning · Computer Science 2024-05-03 Richard Combes

We present a conjectural formula for the principal minors and the characteristic polynomial of Gross's regulator matrix associated to a totally odd character of a totally real field. The formula is given in terms of the Eisenstein cocycle,…

Number Theory · Mathematics 2017-05-29 Samit Dasgupta , Michael Spiess

This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…

Number Theory · Mathematics 2019-05-15 Nickolas Andersen , William Duke

Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…

Number Theory · Mathematics 2021-03-11 Johannes Schleischitz

In $1977$, G. Bennett proved, by means of non-deterministic methods, an inequality which plays a fundamental role in a series of optimization problems. More precisely, Bennett's inequality shows that, for $p_{1},p_{2} \in\lbrack1,\infty]$…

Combinatorics · Mathematics 2022-09-26 Daniel Pellegrino , Anselmo Raposo

We present an elementary proof of a conjecture by I. Ra\c{s}a which is an inequality involving Bernstein basis polynomials and convex functions. It was affirmed in positive very recently by the use of stochastic convex orderings. Moreover,…

Classical Analysis and ODEs · Mathematics 2016-09-02 Ulrich Abel

Goeman and Solari [Statist. Sci. 26 (2011) 584-597, arXiv:1208.2841] have addressed the interesting topic of multiple testing for exploratory research, and provided us with nice suggestions for exploratory analysis. They defined properties…

Methodology · Statistics 2012-08-17 Ruth Heller

We obtain a new bound on exponential sums over integers without large prime divisors, improving that of Fouvry and Tenenbaum (1991). For a fixed integer $\nu\ne 0$, we also obtain new bounds on exponential sums with $\nu$-th powers of such…

Number Theory · Mathematics 2025-05-06 Sary Drappeau , Igor E. Shparlinski

We obtain a new general extension theorem in Banach spaces for operators which are not required to be symmetric, and apply it to obtain Harnack estimates and a priori regularity for solutions of fractional powers of several second order…

Analysis of PDEs · Mathematics 2016-10-12 Hugo Aimar , Gastón Beltritti , Ivana Gómez , Cristian Rios

We prove inequalities that compare the size of an S-regulator with a product of heights of multiplicatively independent S-units. Our upper bound for the S-regulator follows from a general upper bound for the determinant of a real matrix…

Number Theory · Mathematics 2016-01-05 Shabnam Akhtari , Jeffrey D. Vaaler

We give necessary and sufficient conditions for Borel measures to satisfy the inequality introduced by Komisarski, Rajba (2018). This inequality is a generalization of the convex order inequality for binomial distributions, which was proved…

Classical Analysis and ODEs · Mathematics 2018-11-12 Andrzej Komisarski , Teresa Rajba

In this paper we show that the weighted Bernstein-Walsh inequality in logarithmic potential theory is sharp up to some new universal constant, provided that the external field is given by a logarithmic potential. Our main tool for such…

Numerical Analysis · Mathematics 2017-07-26 Bernhard Beckermann , Thomas Helart

We present a new, very short proof of a conjecture by I. Ra\c{s}a, which is an inequality involving basic Bernstein polynomials and convex functions. It was affirmed positively very recently by J. Mrowiec, T. Rajba and S. W\k{a}sowicz…

Classical Analysis and ODEs · Mathematics 2017-08-29 Andrzej Komisarski , Teresa Rajba

The subject of these Notes is the new proof, proposed in [F. H{\'e}lein, In{\'e}galit{\'e} isop{\'e}rim{\'e}trique et calibrations, Annales de l'Institut Fourier 44, 4 (1994), 1211-1218] of the classical isoperimetric inequality in the…

Differential Geometry · Mathematics 2018-05-28 Frédéric Hélein

We establish an operator extension of the following generalization of Bohr's inequality, due to M.P. Vasi\'c and D.J. Ke\v{c}ki\'{c}: $$|\sum_{i=1}^n z_i|^r \leq (\sum_{i=1}^n \alpha_i^{1/(1-r)})^{r-1}\sum_{i=1}^n \alpha_i|z_i|^r \quad…

Operator Algebras · Mathematics 2010-05-31 M. S. Moslehian , J. Pecaric , I. Peric

For the general obstacle problem, we prove by direct methods an epiperimetric inequality at regular and singular points, thus answering a question of Weiss (Invent. Math., 138 (1999), 23--50). In particular at singular points we introduce a…

Analysis of PDEs · Mathematics 2017-08-08 Maria Colombo , Luca Spolaor , Bozhidar Velichkov

In this paper we give some sharper refinements and generalizations of inequalities related to Shafer's inequality for the arctangent function, stated in Theorems 1, 2 and 4 in [1], by C. Mortici and H.M. Srivastava.

Classical Analysis and ODEs · Mathematics 2019-10-15 Branko Malesevic , Marija Rasajski , Tatjana Lutovac

Generalized versions of the entropic (Hirschman-Beckner) and support (Elad-Bruckstein) uncertainty principle are presented for frames representations. Moreover, a sharpened version of the support inequality has been obtained by introducing…

Information Theory · Computer Science 2012-10-30 Benjamin Ricaud , Bruno Torrésani

Combining recent results on noetherianity of twisted commutative algebras by Draisma and the resolution of Stillman's conjecture by Ananyan-Hochster, we prove a broad generalization of Stillman's conjecture. Our theorem yields an array of…

Commutative Algebra · Mathematics 2021-10-05 Daniel Erman , Steven V Sam , Andrew Snowden

Deriving generalization bounds for stable algorithms is a classical question in learning theory taking its roots in the early works by Vapnik and Chervonenkis (1974) and Rogers and Wagner (1978). In a series of recent breakthrough papers by…

Machine Learning · Computer Science 2020-05-27 Olivier Bousquet , Yegor Klochkov , Nikita Zhivotovskiy