English
Related papers

Related papers: High-entropy dual functions over finite fields and…

200 papers

D. Leviatan has investigated the behavior of the higher order derivatives of approximation polynomials of the differentiable function $f$ on $[-1,1]$. Especially, when $P_n$ is the best approximation of $f$, he estimates the differences…

Classical Analysis and ODEs · Mathematics 2014-03-04 Hee Sun Jung , Ryozi Sakai

We show that finite quasisimple groups of Lie type in characteristic $p$ with an irreducible representation of prime degree $r$ over a finite field of characteristic $p$ have orders bounded above by a function of $r$, independent of $p$. We…

Group Theory · Mathematics 2026-01-06 D. L. Flannery , A. E. Zalesski

Potential functional approximations are an intriguing alternative to density functional approximations. The potential functional that is dual to the Lieb density functional is defined and properties given. The relationship between…

Other Condensed Matter · Physics 2014-01-08 Attila Cangi , E. K. U. Gross , Kieron Burke

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Number Theory · Mathematics 2024-09-09 Jonathan W. Bober , Lara Du , Dan Fretwell , Gene S. Kopp , Trevor D. Wooley

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt

The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…

Classical Analysis and ODEs · Mathematics 2007-05-23 P. V. Fedotova , I. Kh. Musin

In the first part of this paper, we develop a general framework that permits a comparison between explicit class field theories for a family of rational function fields $\mathbb{F}_s(t)$ over arbitrary constant fields $\mathbb{F}_s$ and…

Number Theory · Mathematics 2024-08-06 Dong Quan Ngoc Nguyen

We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights $w$ having finitely many zeros and singularities (i.e., points where $w$ becomes infinite) on an interval and not too ``rapidly…

Classical Analysis and ODEs · Mathematics 2015-07-20 Kirill A. Kopotun

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

Classical Analysis and ODEs · Mathematics 2015-07-20 Kirill A. Kopotun

For a given second order elliptic operation $\mathcal{L}$ in a domain $\Omega\subset{\mathbb{R}}^\mathbf{N}$, $\mathbf{N}\ $, and a compact set $\mathbf{K}\subset\Omega$, order $\mathbf{N}$-$2$-Ahlfors-David regular, we define the space…

Analysis of PDEs · Mathematics 2026-01-07 Grigori Rozenblum , Nikolay Shirokov

We obtain the asymptotic equalities for the least upper bounds of approximations by interpolation trigonometric polynomials with the equidistant nodes $x_k^{(n-1)}=\frac{2k\pi}{2n-1},\ k\in\mathbb{Z},$ in metrics of the spaces $L_p$ on…

Classical Analysis and ODEs · Mathematics 2018-06-08 A. S. Serdyuk , I. V. Sokolenko

Inspired by the works in [1] and [8] we introduce what we call $k$-th-order fluctuation fields and study their scaling limits. This construction is done in the context of particle systems with the property of orthogonal self-duality. This…

Probability · Mathematics 2020-04-21 Mario Ayala , Gioia Carinci , Frank Redig

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…

Computational Complexity · Computer Science 2017-05-11 Shuichi Hirahara

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

Classical Analysis and ODEs · Mathematics 2016-06-27 R. M. Trigub

The Hardy--Littlewood prime $k$-tuples conjecture has long been thought to be completely unapproachable with current methods. While this sadly remains true, startling breakthroughs of Zhang, Maynard, and Tao have nevertheless made…

Number Theory · Mathematics 2014-03-25 Abel Castillo , Chris Hall , Robert J. Lemke Oliver , Paul Pollack , Lola Thompson

Matom\"aki proved that if $\alpha\in \mathbb{R}$ is irrational, then there are infinitely many primes $p$ such that $|\alpha-a/p|\le p^{-4/3+\varepsilon}$ for a suitable integer a. In this paper, we extend this result to all quadratic…

Number Theory · Mathematics 2024-08-01 Stephan Baier , Sourav Das , Esrafil Ali Molla

We consider the problem of approximation of matrix functions of class $L^p$ on the unit circle by matrix functions analytic in the unit disk in the norm of $L^p$, $2\le p<\be$. For an $m\times n$ matrix function $\Phi$ in $L^p$, we consider…

Functional Analysis · Mathematics 2008-05-29 L. Baratchart , F. L. Nazarov , V. V. Peller

We study some problems in metric Diophantine approximation over local fields of positive characteristic.

Number Theory · Mathematics 2018-12-19 Arijit Ganguly , Anish Ghosh

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin

We consider the problem of determining, given x, y in Z^k and a finite set F of affine functions on Z^k, whether y is reachable from x by applying the functions F. We also consider the analogous problem over N^k. These problems are known to…

Formal Languages and Automata Theory · Computer Science 2013-04-10 Daniel Fremont
‹ Prev 1 2 3 10 Next ›