相关论文: Prime power order circulant determinants

In this paper, we introduce the power-partible reduction for holonomic (or, P-recursive) sequences and apply it to obtain a series of congruences for Ap\'ery numbers $A_k$. In particular, we prove that, for any $r\in\mathbb{N}$, there…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…

It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…

For each prime p > 7 we obtain the expression for an upper bound on the minimum number of colors needed to non-trivially color T(2, p), the torus knots of type (2, p), modulo p. This expression is t + 2 l -1 where t and l are extracted from…

Any multilinear non-central polynomial $p$ (in several noncommuting variables) takes on values of degree $n$ in the matrix algebra $M_n(F)$ over an infinite field $F$. The polynomial $p$ is called {\it $\nu$-central} for $M_n(F)$ if $p^\nu$…

We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

In this paper it is proved, that for every prime number p, the set of cyclic p-roots in C^p is finite. Moreover the number of cyclic p-roots counted with multiplicity is equal to (2p-2)!/(p-1)!^2. In particular, the number of complex…

We say that k is a P-integer if the first phi(k) primes coprime to k form a reduced residue system modulo k. In 1980 Pomerance proved the finiteness of the set of P-integers and conjectured that 30 is the largest P-integer. We prove the…

We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort $n$ labelled points on a circle by transpositions. Imagine that the vertices of a cycle of length $n$ are labelled by the…

The discriminator of an integer sequence $\textbf{s} = (s(i))_{i \geq 0}$, introduced by Arnold, Benkoski, and McCabe in 1985, is the function $D_{\textbf{s}} (n)$ that sends $n$ to the least integer $m$ such that the numbers $s(0), s(1),…

In this article, we address the lower bounds for the sums $a_f(p)+a_g(p)$ of the $p$-th Fourier coefficients of two twist-inequivalent, non-CM normalized newforms $f$ and $g$. Our main result shows that for such forms with integer Fourier…

Congruences are found modulo powers of 5, 7 and 13 for Andrews' smallest parts partition function spt(n). These congruences are reminiscent of Ramanujan's partition congruences modulo powers of 5, 7 and 11. Recently, Ono proved explicit…

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

We consider the classical theta operator $\theta$ on modular forms modulo $p^m$ and level $N$ prime to $p$ where $p$ is a prime greater than 3. Our main result is that $\theta$ mod $p^m$ will map forms of weight $k$ to forms of weight…

In this note we provide some counterexamples for the conjecture of Moret\'{o} on finite simple groups, which says that any finite simple group $G$ can determined in terms of its order $|G|$ and the number of elements of order $p$, where $p$…

We consider the quotient group $T(G)$ of the multiple holomorph by the holomorph of a finite $p$-group $G$ of class two for an odd prime $p$. By work of the first-named author, we know that $T(G)$ contains a cyclic subgroup of order…

This paper presents a novel primality test based on the eigenvalue structure of circulant matrices constructed from roots of unity. We prove that an integer $n > 2$ is prime if and only if the minimal polynomial of the circulant matrix $C_n…

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

We construct here the first known examples of non-split sharply 2-transitive groups of bounded exponent in odd positive characteristic for every large enough prime $p \equiv 3 \pmod{4}$. In fact, we show that there are countably many…

10 is the smallest positive integer which is whether solitary or friendly is still an open question in mathematics. In this paper, we provide upper bounds for each of the prime divisors of a friend of 10. This paper is precisely a…