English
Related papers

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

200 papers

Mullineux defined an involution on the set of $e$-regular partitions of $n$. When $e=p$ is prime, these partitions label irreducible symmetric group modules in characteristic $p$. Mullineux's conjecture, since proven, was that this…

Combinatorics · Mathematics 2025-02-24 David J. Hemmer

We provide combinatorial tools inspired by work of Warnaar to give combinatorial interpretations of the sum sides of the Andrews-Gordon and Bressoud identities. More precisely, we give an explicit weight- and length-preserving bijection…

Combinatorics · Mathematics 2024-03-11 Jehanne Dousse , Frédéric Jouhet , Isaac Konan

If $\gcd(r,t)=1$, then a theorem of Alladi offers the M\"obius sum identity $$-\sum_{\substack{ n \geq 2 \\ p_{\rm{min}}(n) \equiv r \pmod{t}}} \mu(n)n^{-1}= \frac{1}{\varphi(t)}. $$ Here $p_{\rm{min}}(n)$ is the smallest prime divisor of…

Combinatorics · Mathematics 2017-05-10 Ken Ono , Robert Schneider , Ian Wagner

We give a commutative algebra viewpoint on Andrews recursive formula for the partitions appearing in "Gordon's identities", which are a generalization of Rogers-Ramanujan identities. Using this approach and differential ideals we conjecture…

Algebraic Geometry · Mathematics 2021-11-11 Pooneh Afsharijoo

In 1967, Andrews found a combinatorial generalization of the G\"ollnitz-Gordon theorem, which can be called the Andrews-G\"ollnitz-Gordon theorem. In 1980, Bressoud derived a multisum Rogers-Ramanujan-type identity, which can be considered…

Combinatorics · Mathematics 2018-03-19 Thomas Y. He , Kathy Q. Ji , Allison Y. F. Wang , Alice X. H. Zhao

Regarding Euler's odd-strict theorem, which is the most basic partition identity, A refinement was done by Sylvester, and it was generalized by Bessenrodt to the r-regular and r-class regular cases. In this paper, we focus on the…

Combinatorics · Mathematics 2023-02-14 Masanori Ando

A certain family of orthogonal groups (called "Clifford groups" by G. E. Wall) has arisen in a variety of different contexts in recent years. These groups have a simple definition as the automorphism groups of certain generalized…

Combinatorics · Mathematics 2007-07-16 G. Nebe , E. M. Rains , N. J. A. Sloane

We present proofs of two new families of sum-product identities arising from the cylindric partitions paradigm. Most of the presented expressions, the related sum-product identities, and the ingredients for the proofs were first conjectured…

Number Theory · Mathematics 2023-01-05 Ali Kemal Uncu

An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…

Combinatorics · Mathematics 2024-12-18 Ilse Fischer

For a set of positive integers $A$, let $p_A(n)$ denote the number of ways to write $n$ as a sum of integers from $A$, and let $p(n)$ denote the usual partition function. In the early 40s, Erd\H{o}s extended the classical Hardy--Ramanujan…

Number Theory · Mathematics 2021-04-07 Asaf Cohen Antonir , Asaf Shapira

In this paper we prove the identity that generalizes the Andrews-Gordon identity. Also we discuss the relation of our formula to the geometry of affine flag varieties and to the geometry of polyhedra.

Quantum Algebra · Mathematics 2010-12-15 B. Feigin , S. Loktev

We use the celebrated circle method of Hardy and Ramanujan to develop convergent formulae for counting a restricted class of partitions that arise from the G\"ollnitz--Gordon identities.

Number Theory · Mathematics 2020-05-20 Nicolas Allen Smoot

The goal of this paper is to get truly subcubic algorithms for Min-Plus product for less structured inputs than what was previously known, and to apply them to versions of All-Pairs Shortest Paths (APSP) and other problems. The results are…

Data Structures and Algorithms · Computer Science 2019-10-14 Virginia Vassilevska Williams , Yinzhan Xu

We prove several new tight distributed lower bounds for classic symmetry breaking graph problems. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a $\Delta$-coloring on…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-06-03 Alkida Balliu , Sebastian Brandt , Fabian Kuhn , Dennis Olivetti

We give a new combinatorial model for the crystals of integrable highest weight modules over the classical Lie algebras of type $B$ and $C$ in terms of classical Young tableux. We then obtain a new description of its Littlewood-Richardson…

Representation Theory · Mathematics 2015-01-07 Jae-Hoon Kwon

In 2010, Andrews considers a variety of parity questions connected to classical partition identities of Euler, Rogers, Ramanujan and Gordon. As a large part in his paper, Andrews considered the partitions by restricting the parity of…

Combinatorics · Mathematics 2018-01-08 Doris D. M. Sang , Diane Y. H. Shi

In this paper, we prove the category of finite length modules for the $\mathbb{Z}_2$-orbifold $M(1)^+$ of the Heisenberg vertex operator algebra whose simple composition factors are $M(1)^\pm$ or $M(1,\lambda)$ for $\lambda \in…

Quantum Algebra · Mathematics 2026-04-15 Drazen Adamovic , Xingjun Lin , Jinwei Yang

Given any pair of positive integers m and n, we construct a new Hopf algebra, which may be regarded as a degenerate version of the quantum group of gl(m+n). We study its structure and develop a highest weight representation theory. The…

Quantum Algebra · Mathematics 2018-05-21 Jin Cheng , Yan Wang , Ruibin Zhang

Consider an arithmetic group $\mathbf{G}(O_S)$, where $\mathbf{G}$ is an affine group scheme with connected, simply connected absolutely almost simple generic fiber, defined over the ring of $S$-integers $O_S$ of a number field $K$ with…

Group Theory · Mathematics 2016-01-26 Nir Avni , Benjamin Klopsch , Uri Onn , Christopher Voll

Let $\{B(\Lambda_m)|m\in\Z/e\Z\}$ be the set of level one $\mathfrak{g}(A^{(1)}_{e-1})$-crystals, and consider the realization of $B(\Lambda_m)$ using $e$-restricted partitions. We prove a purely Young diagrammatic criterion for an element…

Representation Theory · Mathematics 2007-12-20 Susumu Ariki , Victor Kreiman , Shunsuke Tsuchioka
‹ Prev 1 4 5 6 7 8 10 Next ›