English
Related papers

Related papers: Products of extended binomial coefficients and the…

200 papers

We establish new operational formulae of Burchnall type for the complex disk polynomials (generalized Zernike polynomials). We then use them to derive some interesting identities involving these polynomials. In particular, we establish…

Classical Analysis and ODEs · Mathematics 2015-04-03 Bouchra Aharmim , Amal El Hamyani , Fouzia El Wassouli , Allal Ghanmi

We consider crossed product von Neumann algebras arising from free Bogoljubov actions of the integers. We describe several presentations of them as amalgamated free products and cocycle crossed products and give a criterion for…

Operator Algebras · Mathematics 2012-12-14 Sven Raum

The classical invariant theory for the queer Lie superalgebra $\mathfrak{q}_n$ investigates its invariants in the supersymmetric algebra $$\mathcal{U}_{s,l}^{r,k}:=\mathrm{Sym}\left(V^{\oplus r}\oplus \Pi(V)^{\oplus k}\oplus V^{*\oplus…

Representation Theory · Mathematics 2023-08-28 Zhihua Chang , Yongjie Wang

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

Combinatorics · Mathematics 2023-08-08 Édouard Bonnet , Romain Bourneuf , Colin Geniet , Stéphan Thomassé

It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…

Rings and Algebras · Mathematics 2017-12-06 Albert Heinle , Viktor Levandovskyy

We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the…

Combinatorics · Mathematics 2010-12-14 G. Berkolaiko , J. M. Harrison , M. Novaes

G. Andrews proved that if $n$ is a prime number then the coefficients $a_k$ and $a_{k+n}$ of the product $(q,q)_\infty/(q^n,q^n)_\infty=\sum_k a_kq^k$ have the same sign, see [A1]. We generalize this result in several directions. Our…

Quantum Algebra · Mathematics 2008-11-26 E. Mukhin

We extend A.B. Mingarelli's method for constructing generalized factorials. Our extension uses a pair of arithmetic functions $(x, y)$, where $x$ is superadditive. When $x$ is the identity function, our generalized factorial reduces to…

Number Theory · Mathematics 2025-09-18 Wanli Ma

For a polynomial $f(x) = \sum_{i=0}^n a_i x^i$, we study the double discriminant $DD_{n,k} = \operatorname{disc}_{a_k} \operatorname{disc}_x f(x)$. This object has been well studied in algebraic geometry, but has been brought to recent…

Number Theory · Mathematics 2025-11-26 Theresa C. Anderson , Ufuoma V. Asarhasa , Adam Bertelli , Fabian Gundlach , Evan M. O'Dorney

We investigate the continued fraction expansion of the infinite products $g(x) = x^{-1}\prod_{t=0}^\infty P(x^{-d^t})$ where polynomials $P(x)$ satisfy $P(0)=1$ and $\deg(P)<d$. We construct relations between partial quotients of $g(x)$…

Number Theory · Mathematics 2018-03-08 Dmitry Badziahin

Recently, an analogue over $\mathbb{F}_q[T]$ of Landau's theorem on sums of two squares was considered by Bary-Soroker, Smilansky and Wolf. They counted the number of monic polynomials in $\mathbb{F}_q[T]$ of degree $n$ of the form…

Number Theory · Mathematics 2024-11-20 Ofir Gorodetsky

Several determinants with gamma functions as elements are evaluated. This kind of determinants are encountered in the computation of the probability density of the determinant of random matrices. The s-shifted factorial is defined as a…

Mathematical Physics · Physics 2007-05-23 Jean-Marie Normand

We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…

Number Theory · Mathematics 2025-11-04 Boyuan Xiong

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

Number Theory · Mathematics 2007-05-23 Florian Luca , Pantelimon Stanica

We study the factorization of the numbers $N = X^2+c$, where $c$ is a fixed constant, and this independently of the value of gcd$(X,c)$. We prove the existence of a family of sequences with arithmetic difference $(U_n, Z_n)$ generating…

General Mathematics · Mathematics 2023-11-13 Marc Wolf , François Wolf

Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…

Number Theory · Mathematics 2017-09-20 Markus Hittmeir

I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer $n$. The bijection leads also to a product on…

Combinatorics · Mathematics 2009-06-17 Alain Goupil

Products, multiplicative Chern characters, and finite coefficients, are unarguably among the most important tools in algebraic K-theory. Although they admit numerous different constructions, they are not yet fully understood at the…

K-Theory and Homology · Mathematics 2011-01-12 Goncalo Tabuada

Let $n\geq 1$ and $X_{n}$ be the random variable representing the size of the smallest component of a random combinatorial object made of $n$ elements. A combinatorial object could be a permutation, a monic polynomial over a finite field, a…

Combinatorics · Mathematics 2023-08-15 Claude Gravel , Daniel Panario

The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…

Combinatorics · Mathematics 2023-01-24 Simone Costa , Stefano Della Fiore , M. A. Ollis