相关论文: An (almost) optimal answer to a question by Wilf

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

Vincular or dashed patterns resemble classical patterns except that some of the letters within an occurrence are required to be adjacent. We prove several infinite families of Wilf-equivalences for k-ary words involving vincular patterns…

The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…

In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over $\F_{q^r}$. In addition, we present a class of complete permutation multinomials, which…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $0.989<\gamma<1$, there exist infinitely many primes $p$ such that…

This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

We launch a systematic study of the refined Wilf-equivalences by the statistics $\mathsf{comp}$ and $\mathsf{iar}$, where $\mathsf{comp}(\pi)$ and $\mathsf{iar}(\pi)$ are the number of components and the length of the initial ascending run…

We adapt a known technique for searching for ideal classes of arbitrary order and then apply it to three families of number fields. We show that a family of cyclic sextic number fields has infinitely many fields in it that contain a…

This paper focuses on the size-biased permutation of $n$ independent and identically distributed (i.i.d.) positive random variables. This is a finite dimensional analogue of the size-biased permutation of ranked jumps of a subordinator…

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…

We establish near-optimal quantitative uniqueness of continuation for solutions of evolution equations vanishing on the lateral boundary. These results were obtained simply by combining existing observability inequalities and energy…

The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures in number theory. We investigate a generalization introduced…

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

Let $\mathbb{V}$ denote an $n$-tuple of shifts of finite multiplicity, and denote by $\mathrm{Ann}(\mathbb{V})$ the ideal consisting of polynomials $p$ in $n$ complex variables such that $p(\mathbb{V})=0$. If $\mathbb{W}$ on $\mathfrak{K}$…

We show that the difference between consecutive terms in sequences of integers whose greatest prime factor grows slowly tends to infinity.

We characterize the minimum-length sequences of independent lazy simple transpositions whose composition is a uniformly random permutation. For every reduced word of the reverse permutation there is exactly one valid way to assign…