English
Related papers

Related papers: Explicit formulas using partitions of integers for…

200 papers

A formal description of quaternions by means of exterior calculus is presented. Considering a three-dimensional space-time characterized by three time-like coordinates, we have been able to consistently recover a suitable formulation of…

General Physics · Physics 2026-04-14 Ivano Colombaro

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

Combinatorics · Mathematics 2018-12-05 Yuriy Choliy , Andrew V. Sills

A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.

Number Theory · Mathematics 2020-08-17 George E. Andrews

We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…

Number Theory · Mathematics 2015-09-01 Michelle Rudolph-Lilith

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…

Combinatorics · Mathematics 2025-10-03 Y. Q. Chen , Thomas Y. He , X. M. Huang , T. T. Zou

We characterize sequences of positive integers $(a_1,a_2,\ldots,a_n)$ for which the $2\times2$ matrix $\left( \begin{array}{cc} a_n&-1 1&0 \end{array} \right) \left( \begin{array}{cc} a_{n-1}&-1 1&0 \end{array} \right) \cdots \left(…

Combinatorics · Mathematics 2018-05-23 Valentin Ovsienko

Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions. Here, we distinguish partitions with a fixed point by which value is fixed and analyze the resulting triangle of integers. In particular, we…

Combinatorics · Mathematics 2024-05-21 Brian Hopkins

We prove an exact formula for OEIS A000119, which counts partitions into distinct Fibonacci numbers. We also establish an exact formula for its mean value, and determine the asymptotic behaviour.

Number Theory · Mathematics 2020-09-18 Sam Chow , Tom Slattery

Any power series with unit constant term can be factored into an infinite product of the form $\prod_{n\geq 1} (1-q^n)^{-a_n}$. We give direct formulas for the exponents $a_n$ in terms of the coefficients of the power series, and vice…

Combinatorics · Mathematics 2025-08-19 Robert Schneider , Andrew V. Sills , Hunter Waldron

The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly…

Number Theory · Mathematics 2021-10-11 Romulo L. Cruz-Simbron

We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…

Combinatorics · Mathematics 2013-03-05 Edinah K. Gnang , Patrick Devlin

For a vector $\mathbf a=(a_1,\ldots,a_r)$ of positive integers we prove formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0,…

Combinatorics · Mathematics 2018-12-11 Mircea Cimpoeas , Florin Nicolae

For any $n$ and $k$, we provide an explicit (that is, computable in polynomial time) example of integer $B_k$-sequence of size $n$ consisting of elements bounded by $n^{k+o(k)}$.

Combinatorics · Mathematics 2023-04-11 Igor S. Sergeev

Extending the notion of $r$-(class) regular partitions, we define $(r_{1},...,r_{m})$-class regular partitions. A partition identity is presented and described by making use of the Glaisher correspondence.

Combinatorics · Mathematics 2015-03-31 Hiroshi Mizukawa , Hiro-Fumi Yamada

We derive an expression for the generalized Bernoulli numbers in terms of the Bernoulli numbers involving the (exponential) complete Bell polynomials.

Classical Analysis and ODEs · Mathematics 2018-01-25 Donal F. Connon

The branching theorem expresses irreducible character values for the symmetric group $S_n$ in terms of those for $S_{n-1}$, but it gives the values only at elements of $S_n$ having a fixed point. We extend the theorem by providing a…

Group Theory · Mathematics 2017-12-22 Randall R. Holmes

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…

Number Theory · Mathematics 2023-03-03 Leonardo F. Bielinski , Giuliano G. La Guardia , Jocemar Q. Chagas

Let d and m be two natural numbers of distinct parities. Let $\pi$ be an admissible irreducible tempered representation of GL(d,F), where F is a p-adic field. We assume that $\pi$ is self-dual. Then we can extend $\pi$ as a representation…

Representation Theory · Mathematics 2012-05-08 Jean-Loup Waldspurger

In Combinatorics Stirling numbers may be defined in several ways. One such definition is given in [1], where an extensive consideration of Stirling numbers is presented. In this paper an alternative definition of Stirling numbers of both…

Combinatorics · Mathematics 2008-06-17 Milan Janjic
‹ Prev 1 8 9 10 Next ›