English
Related papers

Related papers: On Proinov's lower bound for the diaphony

200 papers

In this paper we provide key estimates used in the stability and error analysis of discontinuous Galerkin finite element methods (DGFEMs) on domains with curved boundaries. In particular, we review trace estimates, inverse estimates,…

Numerical Analysis · Mathematics 2019-04-02 Ellya L. Kawecki

We prove in this short report the existence of a fundamental solution (F.S.) for the Cauchy initial boundary problem on the whole space for the parabolic differential equation having at origin the point of non-integrable unbounded…

Analysis of PDEs · Mathematics 2019-12-05 M. R. Formica , E. Ostrovsky , L. Sirota

This article is devoted to the study of discrete potentials on the sphere in $\mathbb{R}^n$ for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical…

Metric Geometry · Mathematics 2023-09-13 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova

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

We consider a boundary value problem involving conformable derivative of order $\alpha ,$ $1<\alpha <2$ and Dirichlet conditions. To prove the existence of solutions, we apply the method of upper and lower solutions together with Schauder's…

Classical Analysis and ODEs · Mathematics 2017-10-31 Rabah Khaldi , Guezane-Lakoud Assia

For n > d/2, the Sobolev (Bessel potential) space H^n(R^d, C) is known to be a Banach algebra with its standard norm || ||_n and the pointwise product; so, there is a best constant K_{n d} such that || f g ||_{n} <= K_{n d} || f ||_{n} || g…

Functional Analysis · Mathematics 2007-05-23 Carlo Morosi , Livio Pizzocchero

For a convex domain K in the complex plane C, the well-known general Markov inequality asserting that a polynomial p of degree n ||p'|| < c(K) n^2 ||p|| holds. On the other hand for polynomials in general, ||p'|| can be arbitrarily small as…

Classical Analysis and ODEs · Mathematics 2007-05-23 Szilárd Gy. Révész

We give new lower asymptotical estimate of constant \[ C_n=\sup\biggl\{\frac{\|t_n\|_{C(\mathbb T)}}{\|t_n\|_{L(\mathbb T)}}:t_n\text{are real trigonometric polynomials}, \operatorname{deg}t_n<n\biggr\} \] as $n\to\infty$. This estimate…

Classical Analysis and ODEs · Mathematics 2007-05-23 D. V. Gorbachev

In his groundbreaking work from 2002, Perelman introduced two fundamental monotonic quantities: the reduced volume and the entropy. While the reduced volume was motivated by the Bishop-Gromov volume comparison applied to a suitably…

Differential Geometry · Mathematics 2025-07-17 Ignacio Bustamante , Martin Reiris

The Shannon lower bound is one of the few lower bounds on the rate-distortion function that holds for a large class of sources. In this paper, it is demonstrated that its gap to the rate-distortion function vanishes as the allowed…

Information Theory · Computer Science 2016-11-17 Tobias Koch

An improved lower bound is given for the decay of conical averages of Fourier transforms of measures, for cones of dimension $d \geq 4$. The proof uses a weighted version of the broad restriction inequality, a narrow decoupling inequality…

Analysis of PDEs · Mathematics 2019-11-05 Terence L. J. Harris

The method of Lyapunov functions is one of the most effective ones for the investigation of stability of dynamical systems, in particular, of stochastic differential systems. The main purpose of the paper is the analysis of the stability of…

Analysis of PDEs · Mathematics 2015-03-13 Tomas Caraballo , Mohamed Ali Hammami , Lasaad Mchiri

We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The…

Number Theory · Mathematics 2019-10-01 Karin Halupczok

In this paper we prove an inequality for individual and uniform Diophantine exponents in the case of simultaneous approximation. This inequality is better than Jarnik's for small values of the uniform exponent.

Number Theory · Mathematics 2010-09-07 Oleg N. German

Recently, the higher order Tur\'{a}n inequalities for the Boros-Moll sequences $\{d_\ell(m)\}_{\ell=0}^m$ were obtained by Guo. In this paper, we show a different approach to this result. Our proof is based on a criterion derived by Hou and…

Combinatorics · Mathematics 2022-11-04 James Jing Yu Zhao

A long standing question is if maximum number $\mu(d)$ of nodes on a surface of degree $d$ in $\dP^3(\dC)$ can be achieved by a surface defined over the reals which has only real singularities. The currently best known asymptotic lower…

Algebraic Geometry · Mathematics 2007-05-23 Sonja Breske , Oliver Labs , Duco van Straten

We show that the Urysohn sphere is pseudofinite. As a consequence, we derive an approximate $0$-$1$ law for finite metric spaces of diameter at most $1$.

Logic · Mathematics 2019-11-05 Isaac Goldbring , Bradd Hart

Along with widely used numerical methods for estimating and computing the Lyapunov dimension there is an effective analytical approach, proposed by G.A. Leonov in 1991. The Leonov method is based on the direct Lyapunov method with special…

Chaotic Dynamics · Physics 2016-11-29 N. V. Kuznetsov

Explicit lower bounds for the length of the shortest opaque set for the unit disc and the unit square in the Euclidean plane are derived. The results are based on an explicit application of the general method of Kawamura, Moriyama, Otachi…

Metric Geometry · Mathematics 2025-12-11 Markus Kiderlen , Florian Pausinger

We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…

Computational Complexity · Computer Science 2022-11-16 Prashanth Amireddy , Ankit Garg , Neeraj Kayal , Chandan Saha , Bhargav Thankey
‹ Prev 1 4 5 6 7 8 10 Next ›