English
Related papers

Related papers: A Multi-Set Identity for Partitions

200 papers

This investigation is firstly focused into showing that two metric parameters represent the same object in graph theory. That is, we prove that the multiset resolving sets and the ID-colorings of graphs are the same thing. We also consider…

Discrete Mathematics · Computer Science 2026-04-08 Anni Hakanen , Ismael G. Yero

Franklin's identity generalizes Euler's identity and states that the number of partitions of $n$ with $j$ different parts divisible by $r$ equals the number of partitions of $n$ with $j$ repeated parts. In this article, we give a refinement…

Combinatorics · Mathematics 2022-04-04 Tewodros Amdeberhan , George E. Andrews , Cristina Ballantine

A {\em pointed partition} of $n$ is a pair $(\lambda, v)$ where $\lambda\vdash n$ and $v$ is a cell in its Ferrers diagram. We construct an involution on pointed partitions of $n$ exchanging "hook length" and "part length". This gives a…

Combinatorics · Mathematics 2022-03-22 Heesung Shin , Jiang Zeng

Cell type (e.g. pluripotent cell, fibroblast) is the end result of many complex processes that unfold due to evolutionary, developmental, and transformational stimuli. A cell's phenotype and the discrete, a priori states that define various…

Quantitative Methods · Quantitative Biology 2013-02-05 Bradly Alicea

Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative…

Combinatorics · Mathematics 2007-05-23 Milan kunz

In this paper, we give a new bijective proof of a multiset analogue of even-odd permutations identity. This multiset version is equivalent to the original coin arrangements lemma which is a key combinatorial lemma in the Sherman's Proof of…

Combinatorics · Mathematics 2022-06-06 Hossein Teimoori Faal

A split system on a multiset $\mathcal M$ is a set of bipartitions of $\mathcal M$. Such a split system $\mathfrak S$ is compatible if it can be represented by a tree in such a way that the vertices of the tree are labelled by the elements…

Combinatorics · Mathematics 2022-03-10 Vincent Moulton , Guillaume E. Scholz

In 2008, Lehner, Wettig, Guhr and Wei conjectured a power series identity and showed that it implied a determinantal formula for a Bessel-type integral over the unitary supergroup. The integral is the supersymmetric extension of Bessel-type…

Mathematical Physics · Physics 2019-03-27 Jimmy He

We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher…

Combinatorics · Mathematics 2016-01-20 Stephan Wagner

We define a map from the unipotent representations of a split semisimple group over a finite field to (essentially) the set of pairs of left cells representations of the Weyl group in the same two-sided cell. We use this map to parametrize…

Representation Theory · Mathematics 2022-09-09 G. Lusztig

Kazhdan and Lusztig have shown that the partition of the symmetric group of degree $n$ into left cells is given by the Robinson-Schensted correspondence. The aim of this paper is to provide a similar description of the left cells in type…

Representation Theory · Mathematics 2007-05-23 C. Bonnafe , L. Iancu

We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The…

Combinatorics · Mathematics 2025-09-26 Hopein Christofen Tang

The original Beck conjecture, now a theorem due to Andrews, states that the difference in the number of parts in all partitions into odd parts and the number of parts in all strict partitions is equal to the number of partitions whose set…

Combinatorics · Mathematics 2021-01-21 Cristina Ballantine , Amanda Welch

We study multigraphs whose edge-sets are the union of three perfect matchings, $M_1$, $M_2$, and $M_3$. Given such a graph $G$ and any $a_1,a_2,a_3\in \mathbb{N}$ with $a_1+a_2+a_3\leq n-2$, we show there exists a matching $M$ of $G$ with…

Combinatorics · Mathematics 2023-06-02 Michael Anastos , David Fabian , Alp Müyesser , Tibor Szabó

We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain…

Combinatorics · Mathematics 2022-01-19 Atul Dixit , Ankush Goswami

We construct a family of partition identities which contain the following identities: Rogers-Ramanujan-Gordon identities, Bressoud's even moduli generalization of them, and their counterparts for overpartitions due to Lovejoy et al. and…

Combinatorics · Mathematics 2014-09-19 Kağan Kurşungöz

There is a classical connection between the representation theory of the symmetric group and the general linear group called Schur-Weyl duality. Variations on this principle yield analogous connections between the symmetric group and other…

Representation Theory · Mathematics 2024-02-22 Alexander Wilson

Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the…

Combinatorics · Mathematics 2022-02-08 Cristina Ballantine , Hannah E. Burson , Amanda Folsom , Chi-Yun Hsu , Isabella Negrini , Boya Wen

We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…

Combinatorics · Mathematics 2021-01-06 Pietro Mercuri

We prove that for any $r\in \mathbb{N}$, there exists a constant $C_r$ such that the following is true. Let $\mathcal{F}=\{F_1,F_2,\dots\}$ be an infinite sequence of bipartite graphs such that $|V(F_i)|=i$ and $\Delta(F_i)\leq \Delta$ hold…

Combinatorics · Mathematics 2021-09-21 António Girão , Oliver Janzer
‹ Prev 1 2 3 10 Next ›