相关论文: The number of fixed points of Wilf's partition inv…

Let $f(x) \in \mathbb{C}[x]$ of degree $n$. We attach to $f$ a $\mathbb{C}$-vector space $W(f)$ which consists of complex polynomials $p(x)$ of degree at most $n - 2$ such that $f(x)$ divides $f"(x)p(x) - f'(x) p'(x)$. The space $W(f)$…

Mullineux defined an involution on the set of $e$-regular partitions of $n$. When $e=p$ is prime, these partitions label irreducible symmetric group modules in characteristic $p$. Mullineux's conjecture, since proven, was that this…

We prove a conjecture of Peter Neumann from 1966, predicting that every finite non-regular primitive permutation group of degree $n$ contains an element fixing at least one point and at most $n^{1/2}$ points. In fact, we prove a stronger…

We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift registers in some special cases. Moreover, we derive a short…

We study the problem of change point localisation and inference for sequentially collected fragmented functional data, where each curve is observed only over discrete grids randomly sampled over a short fragment. The sequence of underlying…

We obtain an equivariant index theorem, or Lefschetz fixed-point formula, for isometries from complete Riemannian manifolds to themselves. The fixed-point set of such an isometry may be noncompact. We build on techniques developed by Roe.…

We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…

The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of $[n]$ with exactly $k$ blocks, and the second one is the total number of non-symmetric…

Let $f$ be a Rademacher random multiplicative function. Let $$M_f(u):=\sum_{n \leq u} f(n)$$ be the partial sum of $f$. Let $V_f(x)$ denote the number of sign changes of $M_f(u)$ up to $x$. We show that for any constant $c > 2$, $$V_f(x) =…

We study the asymptotic behavior of the maximal multiplicity $M_n=M_n(\sigma)$ of the blocks in a set partition of $[n]=\{1,2,...,n\}$, assuming that $\sigma$ is chosen uniformly at random from the set of all such partitions. Let $W=W(n)$…

Let $\Gamma_{g}$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We develop a new method for integrating over the representation space $\mathbb{X}_{g,n}=\mathrm{Hom}(\Gamma_{g},S_{n})$ where $S_{n}$ is…

In 1887, Minkowski determined the least common multiple of the orders of all finite subgroups of $GL_n(\mathbb{Q})$; we refer to this number as $M(n)$. In (Katznelson, 1994), Katznelson provides the asymptotic behaviour of $M(n)$, with a…

We will study the solutions to the equation $f(n) - g(n) = c$, where $f$ and $g$ are multiplicative functions and $c$ is a constant. More precisely, we prove that the number of solutions does not exceed $c^{1-\epsilon}$ when $f, g$ and…

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…

Previously Heyman and Shparlinski gave an asymptotic formula with error term for the number of Eisenstein polynomials of fixed degree and bounded height. Let $\psi(f)$ denote the number of primes for which a polynomial $f$ is Eisenstein. We…

Let $X$ be an algebraic variety over a finite field $\bF_q$, homogeneous under a linear algebraic group. We show that the number of rational points of $X$ over $\bF_{q^n}$ is a periodic polynomial function of $q^n$ with integer…

The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

We work an analogue of a classical arithmetic problem over polynomials. More precisely, we study the fixed points $F$ of the sum of divisors function $\sigma : F_2[x] \mapsto F_2[x]$ (defined \emph{mutatis mutandi} like the usual sum of…