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

We consider the asymptotic minimum density $f(s,k)$ of monotone $k$-subwords of words over a totally ordered alphabet of size $s$. The unrestricted alphabet case, $f(\infty,k)$, is well-studied, known for $f(\infty,3)$ and $f(\infty,4)$,…

We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the…

The tree-level three-point correlation functions of local operators in the general $(p,q)$ minimal models coupled to gravity are calculated in the continuum approach. On one hand, the result agrees with the unitary series ($q=p+1$); and on…

Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

For any positive integer $m$ and an odd prime $p$; let $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $q=p^{m}$, be a ring extension of the ring $\mathbb{F}_{p}+u\mathbb{F}_{p}.$ In this paper, we construct linear codes over…

This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…

Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…

Let $\gcd(k,j)$ be the greatest common divisor of the integers $k$ and $j$. For any arithmetical function $f$, we establish several asymptotic formulas for weighted averages of gcd-sum functions with weight concerning logarithms, that is…

In this note, we investigate the supremum and the infimum of the functional $|a_{n+1}|-|a_{n}|$ for functions, convex and analytic on the unit disk, of the form $f(z)=z+a_2z^2+a_3z^3+\dots.$ We also consider the related problem to maximize…

We study point-separating function sets that are minimal with respect to the property of being separating. We first show that for a compact space $X$ having a minimal separating function set in $C_p(X)$ is equivalent to having a minimal…

We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…

Given $d, N\geq 2$ and $p\in (0, \infty]$ we consider a family of functionals, the $p$-frame potentials FP$_{p, N, d}$, defined on the set of all collections of $N$ unit-norm vectors in $\mathbb R^d$. For the special case $p=2$ and…

Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions over the non-negative reals. We show how to approximate the…

For a finite set of natural numbers $D$ consider a complex polynomial of the form $f(z) = \sum_{d \in D} c_d z^d$. Let $\rho_+(f)$ and $\rho_-(f)$ be the fractions of the unit circle that $f$ sends to the right($\operatorname{Re} f(z) > 0$)…

The weighted Selberg integral is a discrete mean-square, that is a generalization of the classical Selberg integral of primes to an arithmetic function $f$, whose values in a short interval are suitably attached to a weight function. We…

We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

Confidence bands are confidence sets for an unknown function f, containing all functions within some sup-norm distance of an estimator. In the density estimation, regression, and white noise models, we consider the problem of constructing…

We consider local minimizers of the functional \[ \sum_{i=1}^N \int (|u_{x_i}|-\delta_i)^p_+\, dx+\int f\, u\, dx, \] where $\delta_1,\dots,\delta_N\ge 0$ and $(\,\cdot\,)_+$ stands for the positive part. Under suitable assumptions on $f$,…

We improve the classical discrete Hardy inequality for $ 1<p<\infty $ for functions on the natural numbers. For integer values of $ p $ the Hardy weight is an absolutely monotonic function.