English
Related papers

Related papers: An explicit generating function arising in countin…

200 papers

We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…

Classical Analysis and ODEs · Mathematics 2025-05-01 Vitaly Alekseev , Tom Cuchta , Alexander Lyapin

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

Symbolic Computation · Computer Science 2008-10-29 Laurent Busé , Bernard Mourrain

Let G be a group generated by $r$ elements $g_1,g_2,..., g_r.$ Among the reduced words in $g_1,g_2,..., g_r$ of length $n$ some, say $\gamma_n,$ represent the identity element of the group $G.$ It has been shown in a combinatorial way that…

Functional Analysis · Mathematics 2007-11-26 Ryszard Szwarc

Knowing a sequence of moments of a given, infinitely supported, distribution we obtain quickly: coefficients of the power series expansion of monic polynomials $\left\{ p_{n}\right\} _{n\geq 0}$ that are orthogonal with respect to this…

Analysis of PDEs · Mathematics 2014-12-30 Paweł J. Szabłowski

We consider orthogonal polynomials p_n with respect to an exponential weight function w(x) = exp(-P(x)). The related equations for the recurrence coefficients have been explored by many people, starting essentially with Laguerre [49], in…

Classical Analysis and ODEs · Mathematics 2016-09-06 Alphonse P. Magnus

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

Combinatorics · Mathematics 2026-02-25 Mahdi Koutchoukali

We obtain asymptotic formulas for sums over arithmetic progressions of coefficients of polynomials of the form $$\prod_{j=1}^n\prod_{k=1}^{p-1}(1-q^{pj-k})^s,$$ where $p$ is an odd prime and $n, s$ are positive integers. Let us denote by…

Number Theory · Mathematics 2021-04-08 Jiyou Li , Xiang Yu

We develop the theory of weighted P-partitions, which generalises the theory of P-partitions from labelled posets to weighted labelled posets. We define the related generating functions in the natural way and compute their product,…

Combinatorics · Mathematics 2023-01-12 Farid Aliniaeifard , Victor Wang , Stephanie van Willigenburg

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Combinatorics · Mathematics 2008-01-19 Milan Janjic

In this paper, we consider properties of coefficients of a generating functions composition, where the outer function is a logarithmic generating function and the inner function is an ordinary generating function with integer coefficients.…

Combinatorics · Mathematics 2015-06-22 Dmitry Kruchinin , Yuriy Shablya

For a prime number $p$ and any natural number $n$ we introduce, by giving an explicit recursive formula, the $p$-Jones-Wenzl projector ${}^p\operatorname{JW}_n$, an element of the Temperley-Lieb algebra $TL_n(2)$ with coefficients in…

Representation Theory · Mathematics 2019-05-30 Gaston Burrull , Nicolas Libedinsky , Paolo Sentinelli

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

Commutative Algebra · Mathematics 2022-02-09 Roswitha Rissner , Daniel Windisch

In this paper we study the coefficients of the powers of an ordinary generating function and their properties. A new class of functions based on compositions of an integer $n$ is introduced and is termed composita. We present theorems about…

Combinatorics · Mathematics 2013-03-26 Vladimir V. Kruchinin , Dmitry V. Kruchinin

The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.

Combinatorics · Mathematics 2019-01-01 Helmut Prodinger

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

Number Theory · Mathematics 2015-12-01 F. E. Brochero Martínez , Lucas Reis

Let $q = p^s$ be a power of a prime number $p$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi_{2^nr}$ over $\mathbb{F}_q$ where both $r…

Number Theory · Mathematics 2011-09-23 Aleksandr Tuxanidy , Qiang Wang

A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…

Combinatorics · Mathematics 2026-02-10 Dmitry Kruchinin , Vladimir Kruchinin

We obtain explicit expressions for the class in the Grothendieck group of varieties of the moduli space of genus 0 stable curves with n marked points. This information is equivalent to the Poincar\'e polynomial; it implies explicit…

Algebraic Geometry · Mathematics 2024-08-06 Paolo Aluffi , Matilde Marcolli , Eduardo Nascimento

We say that a formal power series $\sum a_n z^n$ with rational coefficients is a 2-function if the numerator of the fraction $a_{n/p}-p^2 a_n$ is divisible by $p^2$ for every prime number $p$. One can prove that 2-functions with rational…

Algebraic Geometry · Mathematics 2017-03-07 Albert Schwarz , Vadim Vologodsky , Johannes Walcher

This note is an attempt to unconditionally prove the existence of weak one way functions (OWF). Starting from a provably intractable decision problem $L_D$ (whose existence is nonconstructively assured from the well-known discrete…

Computational Complexity · Computer Science 2023-07-19 Stefan Rass