# Polynomial Partition Asymptotics

@article{Dunn2017PolynomialPA,
title={Polynomial Partition Asymptotics},
author={Alexander Dunn and Nicolas Robles},
journal={arXiv: Number Theory},
year={2017}
}
• Published 30 April 2017
• Mathematics
• arXiv: Number Theory

### PARTITIONS INTO PRIME POWERS

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use

### Partitions into prime powers and other restricted partition functions

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n )$ denote the restricted partition function, which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we

### Counting the Number of Solutions to Certain Infinite Diophantine Equations

• Mathematics
Taiwanese Journal of Mathematics
• 2019
Let $r, n$ be positive integers. In this paper, we prove a generating function and an asymptotic formula for the number solutions of the following infinite Diophantine equation:  n=1^{r}\cdot

### Random permutations with logarithmic cycle weights

• Mathematics
• 2018
We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study the asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges

### What is an answer? - remarks, results and problems on PIO formulas in combinatorial enumeration, part I

It is proved here that every linear recurrence sequence of integers has an effective formula in the sense of being closed in the authors' sense.

### Partitions into Piatetski-Shapiro sequences

• Mathematics
• 2021
Let κ be a positive real number and m ∈ N ∪ {∞} be given. Let pκ,m(n) denote the number of partitions of n into the parts from the Piatestki-Shapiro sequence (⌊l⌋)l∈N with at most m times (repetition

### Adversarial Erasing Attention for Person Re-Identification in Camera Networks Under Complex Environments

• Computer Science
IEEE Access
• 2020
A novel person Re-ID method named Adversarial Erasing Attention (AEA) to mine discriminative completed features using an adversarial way and combine the features learned from the basic and complementary networks to represent the pedestrian image.