Related papers: A Multi-Set Identity for Partitions

Here, we establish a polynomial identity in three variables $a, b, c$, and with the degree of the polynomial given in terms of two integers $L, M$. By letting $L$ and $M$ tend to infinity, we get the 1993 Alladi-Gordon $q$-hypergeometric…

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

The paper shows that almost every $n$-vertex graph is such that the multiset of its induced subgraphs on $3 \log_2{n}$ vertices is sufficient to determine it up to isomorphism. Therefore, for checking the isomorphism of a pair of $n$-vertex…

The discrepancy BR for an $m \times n$ $0,1$-matrix from Brualdi and Sanderson \cite{Brualdi1998} counts the minimum number of $1$'s which need to be shifted in each row to the left to achieve its Ferrers matrix, i.e. each row consists of…

Let $\lambda$ be a partition, viewed as a Young diagram. We define the hook difference of a cell of $\lambda$ to be the difference of its leg and arm lengths. Define $h_{1,1}(\lambda)$ to be the number of cells of $\lambda$ with hook…

We provide geometric methods and algorithms to verify, construct and enumerate pairs of words (of specified length over a fixed $m$-letter alphabet) that form identities in the semigroup $\ut{n}$ of $n\times n$ upper triangular tropical…

In this paper, we address the Ehrenborg's conjecture which proposes that for any bipartite graph the number of spanning trees does not exceed the product of the degrees of the vertices divided by the product of the sizes of the graph…

Using the representation theory of Cherednik algebras at t=0 and a Galois covering of the Calogero-Moser space, we define the notions of left, right and two-sided Calogero-Moser cells for any finite complex reflection group. To each…

We prove that all Arens extensions of finite rank Riesz multimorphisms taking values in Archimedean Riesz spaces coincide and are Riesz multimorphisms. Partial results for arbitrary Riesz multimorphisms are obtained. We also prove that, for…

We determine an infinite family of linear identities for the number $A_4(n)$ of partition pairs of $n$ with $4$-cores by employing elementary $q$-series techniques and certain $3$-dissection formulas. We then discover an infinite family of…

For a graph $G = (V,E)$ and a subset $R \subseteq V$, we say that $R$ is \textit{multiset resolving} for $G$ if for every pair of vertices $v,w$, the \textit{multisets} $\{d(v,r): r \in R\}$ and $\{d(w,r):r \in R\}$ are distinct, where…

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

Kernels for structured data are commonly obtained by decomposing objects into their parts and adding up the similarities between all pairs of parts measured by a base kernel. Assignment kernels are based on an optimal bijection between the…

In a recent paper by L. Fel two new identities for the degree of syzygies are given. We present an algebraic proof of them, using only basic homological algebra tools. We also extend these results.

Let $i_t(G)$ denote the number of independent sets of size $t$ in a graph $G$. Levit and Mandrescu have conjectured that for all bipartite $G$ the sequence $(i_t(G))_{t \geq 0}$ (the {\em independent set sequence} of $G$) is unimodal. We…

Using ultrafilter techniques we show that in any partition of $\mathbb{N}$ into 2 cells there is one cell containing infinitely many exponential triples, i.e. triples of the kind $a,b,a^b$ (with $a,b>1$). Also, we will show that any…

George Andrews recently proved a new identity between the cardinalities of the set of Semi-Fibonacci partitions and the set of partitions into powers of two with all parts appearing an odd number of times. This paper extends the identity to…

Using the representation theory of Cherednik algebras at $t=0$ and a Galois covering of the Calogero-Moser space, we define the notions of left, right and two-sided Calogero-Moser cells for any finite complex reflection group. To each…

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…

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…