中文
相关论文

相关论文: Arithmetic properties of generalized Euler numbers

200 篇论文

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

组合数学 · 数学 2025-11-07 George E. Andrews , Rahul Kumar , Ae Ja Yee

The $k$-dimensional generalized Euler function $\varphi_k(n)$ is defined to be the number of ordered $k$-tuples $(a_1,a_2,\ldots, a_k) \in \mathbb{N}^k$ with $1\leq a_1,a_2,\ldots, a_k \leq n$ such that both the product $a_1a_2\cdots a_k$…

数论 · 数学 2021-06-29 Subha Sarkar

We develop a general method for computing the homological Euler characteristic of finite index subgroups G of GL_m(O_K) where O_K is the ring of integers in a number field K. With this method we find, that for large, explicitly computed…

群论 · 数学 2007-05-23 Ivan E. Horozov

For $m$ an even positive integer and $p$ a prime, we show that the generalized Euler polynomial $E_{mp}^{(mp)}(x)$ is in Eisenstein form with respect to $p$ if and only if $p$ does not divide $m (2^m-1)B_m$. As a consequence, we deduce that…

数论 · 数学 2023-06-30 Michael Filaseta , Thomas Luckner

Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. The aim of this article is to give a result about the sum of euler's totient function from k equal 1 to n whene p divides n and p…

综合数学 · 数学 2021-01-07 E. En-naoui

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

群论 · 数学 2014-02-26 Nick Gill

In this paper, we will define general Eulerian numbers and Eulerian polynomials based on general arithmetic progressions. Under the new definitions, we have been successful in extending several well-known properties of traditional Eulerian…

组合数学 · 数学 2012-07-03 Tingyao Xiong , Hung-ping Tsao , Jonathan I. Hall

In this paper, we introduce a novel identity for generalized Euler polynomials, leading to further generalizations for several relations involving classical Euler numbers, Euler polynomials, Genocchi polynomials, and Genocchi numbers.

数论 · 数学 2024-02-28 Chellal Redha

Tangent numbers $T_{2n-1}$, which enumerate alternating permutations of odd length, play a prominent role in the Taylor series expansion of the tangent function $\tan(x)$. In this work, we adopt a combinatorial approach based on the…

组合数学 · 数学 2026-03-25 Jean-Christophe Pain

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

组合数学 · 数学 2012-08-23 William Y. C. Chen , Ae Ja Yee , Albert J. W. Zhu

This paper is concerned with the generalized Euler polynomial matrix $\E^{(\alpha)}(x)$ and the Euler matrix $\E$. Taking into account some properties of Euler polynomials and numbers, we deduce product formulae for $\E^{(\alpha)}(x)$ and…

数论 · 数学 2018-11-06 Yamilet Quintana , William Ramírez , Alejandro Urieles

For positive integers $p_1,p_2,\ldots,p_k,q$ with $q>1$, we define the Euler $T$-sum $T_{p_1p_2\cdots p_k,q}$ as the sum of those terms of the usual infinite series for the classical Euler sum $S_{p_1p_2\cdots p_k,q}$ with odd denominators.…

数论 · 数学 2020-09-16 Ce Xu , Weiping Wang

In this article, we introduce congruential Euler numbers, which are a further generalization of generalized Euler numbers. We prove the $p$-adic congruences of congruential Euler numbers, which include answers to a conjecture related to…

数论 · 数学 2026-05-12 Yuta Nishibuchi

Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…

组合数学 · 数学 2007-05-23 Helmut Prodinger

Using general identities for difference operators, as well as a technique of symbolic computation and tools from probability theory, we derive very general kth order (k \ge 2) convolution identities for Bernoulli and Euler polynomials. This…

数论 · 数学 2015-07-21 K. Dilcher , C. Vignat

We consider quotients of the unit cube semigroup algebra by particular $\mathbb{Z}_r\wr S_n$-invariant ideals. Using Gr\"obner basis methods, we show that the resulting graded quotient algebra has a basis where each element is indexed by…

组合数学 · 数学 2018-04-11 Benjamin Braun , McCabe Olsen

The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…

组合数学 · 数学 2024-07-17 Giulio Cerbai , Anders Claesson

Recently the new q-Euler numbers are defined. In this paper we derive the the Kummer type congruence related to q-Euler numbers and we introduce some interesting formulae related to these q-Euler numbers.

数论 · 数学 2008-08-08 Taekyun Kim

By considering generalized logarithm and exponential functions used in nonextensive statistics, the four usual algebraic operators : addition, subtraction, product and division, are generalized. The properties of the generalized operators…

数学物理 · 物理学 2009-11-10 L. Nivanen , A. Le Mehaute , Q. A. Wang

Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…

组合数学 · 数学 2024-03-25 Sergi Elizalde