English
Related papers

Related papers: The Andrews-Olsson identity and Bessenrodt inserti…

200 papers

We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered…

Combinatorics · Mathematics 2017-03-16 Shashank Kanade , Matthew C. Russell

For $\boldsymbol{\large {\lambda}} = (\lambda_1,\ldots,\lambda_d)$ with $\lambda_i > 0$, it is proved that \begin{equation*} \prod_{i=1}^d \frac{ 1}{(1- r x_i)^{\lambda_i}} = \frac{\Gamma(|\boldsymbol{\large {\lambda}}|)}{\prod_{i=1}^{d}…

Classical Analysis and ODEs · Mathematics 2014-07-01 Yuan Xu

Acoustic room modes and the Green's function mode expansion are well-known for rectangular rooms with perfectly reflecting walls. First-order approximations also exist for nearly rigid boundaries; however, current analytical methods fail to…

Audio and Speech Processing · Electrical Eng. & Systems 2026-02-11 Matteo Calafà , Yuanxin Xia , Jonas Brunskog , Cheol-Ho Jeong

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…

Symbolic Computation · Computer Science 2024-11-21 Lucas Michel , Pierre Mathonet , Naïm Zénaïdi

We find bivariate generating functions for the $k=1$ cases of recently conjectured colored partition identities of Capparelli, Meurman, A. Primc, and M. Primc that are slight variants of the generating functions for the sum sides of the…

Combinatorics · Mathematics 2026-05-14 Matthew C. Russell

We prove a structure theorem for multiplicative functions on the Gaussian integers, showing that every bounded multiplicative function on the Gaussian integers can be decomposed into a term which is approximately periodic and another which…

Number Theory · Mathematics 2014-12-04 Wenbo Sun

Min-plus product of two $n\times n$ matrices is a fundamental problem in algorithm research. It is known to be equivalent to APSP, and in general it has no truly subcubic algorithms. In this paper, we focus on the min-plus product on a…

Data Structures and Algorithms · Computer Science 2022-02-03 Shucheng Chi , Ran Duan , Tianle Xie

We develop the theory of subproduct systems over the monoid $\mathbb{N}\times \mathbb{N}$, and the non-self-adjoint operator algebras associated with them. These are double sequences of Hilbert spaces $\{X(m,n)\}_{m,n=0}^\infty$ equipped…

Operator Algebras · Mathematics 2012-03-27 Maxim Gurevich

We use the $q$-binomial theorem, the $q$-Gauss sum, and the ${}_2\phi_1 \rightarrow {}_2\phi_2$ transformation of Jackson to discover and prove many new weighted partition identities. These identities involve unrestricted partitions,…

Number Theory · Mathematics 2016-11-15 Alexander Berkovich , Ali Kemal Uncu

In this paper, we use an M-theory model to conjecture the refined reminiscence of the OSV formula connecting the refined topological string partition function with the refined BPS states partition function for the toric Calabi-Yau…

High Energy Physics - Theory · Physics 2015-03-17 Haitao Liu , Jie Yang

By employing the classical tools from the theory of $q$-series and theta functions, new fascinating identities on different continued fractions can be achieved. In this article, we use the product expansion of Jacobi's theta function to…

Number Theory · Mathematics 2026-04-01 Shruthi C. Bhat , B. R. Srivatsa Kumar

We develop our method to prove quantum superintegrability of an integrable 2D system, based on recurrence relations obeyed by the eigenfunctions of the system with respect to separable coordinates. We show that the method provides rigorous…

Mathematical Physics · Physics 2011-03-29 Ernie G. Kalnins , Jonathan M. Kress , Willard Miller

Let $i\in\{1,2\}$ and $X_i$ be a space of homogeneous type in the sense of Coifman and Weiss with the upper dimension $\omega_i$. Also let $\eta_i$ be the smoothness index of the Auscher--Hyt\"onen wavelet function $\psi^{k_i}_{\alpha_i}$…

Functional Analysis · Mathematics 2026-02-20 Ziyi He , Dachun Yang , Taotao Zheng

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

Data Structures and Algorithms · Computer Science 2013-12-12 David Rosenbaum

We study the representations of the infinite symmetric group induced from the identity representations of Young subgroups. It turns out that such induced representations can be either of type~I or of type~II. Each Young subgroup corresponds…

Representation Theory · Mathematics 2007-05-23 N. V. Tsilevich , A. M. Vershik

We prove multiplicative congruences mod $2^{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(n)$, the number of partitions of $n$ in which every even part is less than each odd part and only the largest even part…

Number Theory · Mathematics 2025-05-05 Frank Garvan , Connor Morrow

Classical (or ``global'') Bernstein theory establishes sharp control on entire functions of exponential type that are bounded and real-valued on the real axis. We localize some of this theory to rectangular regions $\{ x+iy: x \in I, 0 \leq…

Classical Analysis and ODEs · Mathematics 2026-04-23 Terence Tao

In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…

Combinatorics · Mathematics 2022-02-08 Shishuo Fu

It is shown that the property of being bounded below (having closed range) of weighted composition operators on Hardy and Bergman spaces can be tested by their action on a set of simple test functions, including reproducing kernels. The…

Functional Analysis · Mathematics 2019-02-26 Isabelle Chalendar , Jonathan R. Partington

We design two incremental algorithms for computing an inclusion-minimal completion of an arbitrary graph into a cograph. The first one is able to do so while providing an additional property which is crucial in practice to obtain…

Data Structures and Algorithms · Computer Science 2020-01-23 Christophe Crespelle , Daniel Lokshtanov , Thi Ha Duong Phan , Eric Thierry
‹ Prev 1 8 9 10 Next ›