相关论文: The structure of critical sets for F_p arithmetic …

The numerical effects of the known all-order leading and next-to-leading logarithmic small-$x$ contributions to the anomalous dimensions and coefficient functions of the unpolarized singlet evolution are discussed for the structure…

If a function $f$, acting on a Euclidean space $\mathbb{R}^n$, is "almost" orthogonally additive in the sense that $f(x+y)=f(x)+f(y)$ for all $(x,y)\in\bot\setminus Z$, where $Z$ is a "negligible" subset of the $(2n-1)$-dimensional manifold…

Motivated by the orthogonal series density estimation in $L^2([0,1],\mu)$, in this project we consider a new class of functions that we call the approximate sparsity class. This new class is characterized by the rate of decay of the…

Let A be a finite set of integers. We prove that if |A| is at least 2 and |A+A| is 3|A|-3, then one of the following is true: 1. A is a bi-arithmetic progression; 2. A+A contains an arithmetic progression of length 2|A|-1; 3. |A| is 6 and A…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

We consider the weak-type inequality for Littlewood-Paley square functions on A_p weighted Lebesgue spaces. Of interest is the sharp in the A_p characteristic estimate. The case of 1<p<2 is subcritical, and the sharp power of 1/p is…

For all $p>1$ and all centrally symmetric convex bodies $K\subset \mathbb{R}^d$ define $Mf$ as the centered maximal function associated to $K$. We show that when $d=1$ or $d=2$, we have $||Mf||_p\ge (1+\epsilon(p,K))||f||_p$. For $d\ge 3$,…

We investigate finite sets of rational functions $\{ f_{1},f_{2}, \dots, f_{r} \}$ defined over some number field $K$ satisfying that any $t_{0} \in K$ is a $K_{p}$-value of one of the functions $f_{i}$ for almost all primes $p$ of $K$. We…

The paper deals with the problem of nonparametric estimating the $L_p$--norm, $p\in (1,\infty)$, of a probability density on $R^d$, $d\geq 1$ from independent observations. The unknown density %to be estimated is assumed to belong to a ball…

In this exploratory article, we draw attention to the common formal ground among various estimators such as the belief functions of evidence theory and their relatives, approximation quality of rough set theory, and contextual probability.…

We prove that the fundamental function of any almost greedy basis of $L_p$, $1<p<\infty$, grows as either $(m^{1/p})_{m=1}^\infty$ or $(m^{1/2})_{m=1}^\infty$.

We study the growth rate of the inclusion length of an almost periodic function. For a given a. p. function such growth rate depends on the algebraic structure of Fourier exponents, i. e. on how good they can be approximated by rational…

Let $P^-(n)$ denote the smallest prime factor of a natural integer $n>1$. Furthermore let $\mu$ and $\omega$ denote respectively the M\"obius function and the number of distinct prime factors function. We show that, given any set ${{\scr…

We characterise the minimum weight codewords of the $p$-ary linear code of intersecting lines in ${\rm PG}(3,q)$, $q=p^h$, $q\geq19$, $p$ prime, $h\geq 1$. If $q$ is even, the minimum weight equals $q^3+q^2+q+1$. If $q$ is odd, the minimum…

We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…

The study of a machine learning problem is in many ways is difficult to separate from the study of the loss function being used. One avenue of inquiry has been to look at these loss functions in terms of their properties as scoring rules…

Let $p$ be a large odd prime, let $x=\log p)(\log\log p)^{3+\varepsilon}$ and let $q\ll\log\log p$ be an integer, where $\varepsilon>0$ is a small number. This note proves the existence of small prime quadratic residues and small prime…

We exhibit subshifts admitting weakly mixing (probability) measures, for arbitrary $\epsilon > 0$, with word complexity $p$ satisfying $\limsup \frac{p(q)}{q} < 1.5 + \epsilon$. For arbitrary $f(q) \to \infty$, said subshifts can be made to…

Let a be a real number between 0 and 1. Ernie Croot showed that the quantity \max_A #(3-term arithmetic progressions in A)/p^2, where A ranges over all subsets of Z/pZ of size at most a*p, tends to a limit as p tends to infinity through…

The well-known $|supp(f)||supp(\widehat{f}|\geq |G|$ inequality gives lower estimation of each supports. In the present paper we give upper estimation under arithmetic constrains. The main notion will be the additive energy which plays a…