Related papers: A Multi-Set Identity for Partitions
Through dualities on representations on tensor powers and symmetric powers respectively, the partition algebra and multiset partition algebra have been used to study long-standing questions in the representation theory of the symmetric…
We give a geometric characterization of the sets $E\subset \mathbb{R}$ that satisfy the following property: every quasisymmetric embedding $f: E \to \mathbb{R}^n$ extends to a quasisymmetric embedding $f:\mathbb{R}\to\mathbb{R}^N$ for some…
We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…
We obtain a generating function for the degree sequences and colors of rooted multipartite labeled series-reduced trees. As an application of this result, we determine the number of symbolic ultrametrics (introduced by B\"ocker and Dress)…
Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is…
A set of real $n$th roots that is pairwise linearly independent over the rationals must also be linearly independent. We show how this result may be extended to more general fields.
Euler's classic partition identity states that the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts. We develop a new generalization of this identity, which yields a previous…
In this paper we prove that every collection of measurable functions $f_\alpha$, $|\alpha|=m$ coincides a.e. with $m$th order derivatives of a function $g\in C^{m-1}$ whose derivatives of order $m-1$ may have any modulus of continuity…
We study perfect crystals for the standard modules of the affine Lie algebra $A_1^{(1)}$ at all levels using the theory of multi-grounded partitions. We prove a family of partition identities which are reminiscent of the Andrews-Gordon…
We give three proofs of the following result conjectured by Carriegos, De Castro-Garc\'{\i}a and Mu\~noz Casta\~neda in their work on enumeration of control systems: when $\binom{k+1}{2} \le n < \binom{k+2}{2}$, there are as many partitions…
In this paper we provide an asymptotic expansion for the number of independent sets in a general class of regular, bipartite graphs satisfying some vertex-expansion properties, extending results of Jenssen and Perkins on the hypercube and…
We prove a general result on completing objects similar to Latin rectangles in which the number of occurrences of each symbol is prescribed, each cell contains multiple symbols, and no cell contains repeated symbols. This generalizes…
We obtain an algorithm computing the Chern-Schwartz-MacPherson (CSM) classes of Schubert cells in a generalized flag manifold G/B. In analogy to how the ordinary divided difference operators act on Schubert classes, each CSM class of a…
Euler's classical identity states that the number of partitions of an integer into odd parts and distinct parts are equinumerous. Franklin gave a generalization by considering partitions with exactly $j$ different multiples of $r$, for a…
A {\it tiered graph} $G=(V,E)$ with $m $ tiers is a simple graph with $V\subseteq \brk{n}$, where $\brk{n}=\{1,2,\cdots,n\}$, and with a surjective map $t$ from $V$ to $\brk{m}$ such that if $v$ is a vertex adjacent to $v'$ in $G$ with…
Let $f(n)$ be the smallest number such that every collection of $n$ matchings, each of size at least $f(n)$, in a bipartite graph, has a full rainbow matching. Generalizing famous conjectures of Ryser, Brualdi and Stein, Aharoni and Berger…
We give a fully polynomial-time approximation scheme (FPTAS) to count the number of independent sets on almost every $\Delta$-regular bipartite graph if $\Delta\ge 53$. In the weighted case, for all sufficiently large integers $\Delta$ and…
In this paper we give new constructions of Ferrer diagram rank metric codes, which achieve the largest possible dimension. In particular, we prove several cases of a conjecture by T. Etzion and N. Silberstein. We also establish a sharp…
Centrosymmetric matrices of order $n$ over an arbitrary algebra $R$ form a subalgebra of the full $n\times n$ matrix algebra over $R$. It is called the centrosymmetric matrix algebra of order $n$ over $R$ and denoted by $S_n(R)$. We prove…
Let G be a linear group such that for every g in G there is a finite set R(g) with the property that for every x in G all sufficiently long commutators [g,x,x,...,x] belong to R(g). It is proved that G is finite-by-hypercentral.