中文
相关论文

相关论文: On Power Sums and the Kummer Congruences

200 篇论文

The Delannoy polynomial $D_n(x)$ is defined by $$ D_n(x)=\sum_{k=0}^{n}{n\choose k}{n+k\choose k}x^k. $$ We prove that, if $x$ is an integer and $p$ is a prime not dividing $x(x+1)$, then \begin{align*} \sum_{k=0}^{p-1}(2k+1)D_k(x)^3…

数论 · 数学 2014-12-25 Victor J. W. Guo

We give another proof, using tools from Geometric Invariant Theory, of a result due to S. Sam and A. Snowden in 2014, concerning the stability of Kro-necker coefficients. This result states that some sequences of Kronecker coefficients…

表示论 · 数学 2018-04-16 Maxime Pelletier

Fourier matrices naturally appear in many applications and their stability is closely tied to performance guarantees of algorithms. The starting point of this article is a result that characterizes properties of an exponential system on a…

经典分析与常微分方程 · 数学 2025-09-30 Oleg Asipchuk , Laura De Carli , Weilin Li

We study congruences of the form F(j(z)) | U(p) = G(j(z)) mod p, where U(p) is the p-th Hecke operator, j is the basic modular invariant 1/q+744+196884q+... for SL2(Z), and F,G are polynomials with integer coefficients. Using the interplay…

数论 · 数学 2007-05-23 Noam D. Elkies , Ken Ono , Tonghai Yang

We use the resolution of singularities algorithm of [G4] to provide new estimates for exponential sums as well as new bounds on how often a function f(x) such as a polynomial with integer coefficients is divisible by various powers of a…

经典分析与常微分方程 · 数学 2014-12-11 Michael Greenblatt

Let $p=2n+1$ be an odd prime. In this paper, we mainly evaluate determinants involving $(\frac {j+k}p)\pm(\frac{j-k}p)$, where $(\frac{\cdot}p)$ denotes the Legendre symbol. When $p\equiv1\pmod4$, we determine the characteristic polynomials…

数论 · 数学 2025-04-02 Deyi Chen , Zhi-Wei Sun

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

数论 · 数学 2016-01-28 Liuquan Wang

This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…

群论 · 数学 2015-12-16 Peter M. Neumann , Cheryl E. Praeger , Simon M. Smith

Recently, Amdeberhan, Sellers, and Singh introduced the notion of a generalized cubic partition function $a_c(n)$ and proved two isolated congruences via modular forms, namely, $a_3(7n+4)\equiv 0\pmod{7}$ and $a_5(11n+10)\equiv 0\pmod{11}$.…

数论 · 数学 2025-03-03 Russelle Guadalupe

We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.

数论 · 数学 2020-12-08 Alessandro Gambini , Remis Tonon , Alessandro Zaccagnini

We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…

表示论 · 数学 2021-08-04 Jiarui Fei

By use of a natural extension map and a power series method, we obtain a local stability theorem for p-K\"ahler structures with the $(p,p+1)$-th mild $\partial\bar\partial$-lemma under small differentiable deformations.

复变函数 · 数学 2019-03-14 Sheng Rao , Xueyuan Wan , Quanting Zhao

We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be…

数论 · 数学 2013-09-04 Christian Elsholtz , Adam J. Harper

Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…

组合数学 · 数学 2024-03-04 Nadav Kohen

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

数论 · 数学 2018-09-26 Su Hu , Min-Soo Kim , Min Sha

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

环与代数 · 数学 2016-10-31 József Vass

Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…

组合数学 · 数学 2026-05-22 Pierre-Emmanuel Caprace , Justin Vast

In 2007, Andrews studied the odd Durfee symbols and their odd ranks. Let $N^0(m,k,n)$ denote the number of odd Durfee symbols of $n$ with odd rank congruent to $m$ modulo $k$. Motivated by Andrews' work, many authors obtained generating…

组合数学 · 数学 2024-08-20 Renrong Mao , Zhiqian Zhou

In this article, we derive a congruence property of particular sum rules involving prime numbers. The resulting expression involves Bernoulli numbers and polynomials, for which we obtain, as a consequence, a general congruence relation as…

历史与综述 · 数学 2025-02-10 Jean-Christophe Pain
‹ 上一页 1 8 9 10 下一页 ›