Related papers: On a generalization of Kelly's combinatorial lemma
Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial…
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
A generalization of the Bethe ansatz equations is studied, where a scalar two-particle S-matrix has several zeroes and poles in the complex plane, as opposed to the ordinary single pole/zero case. For the repulsive case (no complex roots),…
We first present a filtration on the ring L of Laurent polynomials such that the direct sum decomposition of its associated graded ring gr L agrees with the direct sum decomposition of gr L, as a module over the complex general linear Lie…
Slicing a module into semisimple ones is useful to study modules. Loewy structures provide a means of doing so. To establish the Loewy structures of projective modules over a finite dimensional symmetric algebra over a field $F$, the…
The Mullineux involution is an important map on $p$-regular partitions that originates from the modular representation theory of $\mathcal{S}_n$. In this paper we study the Mullineux transpose map and the generalized column regularization…
Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…
We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…
We give a direct proof of the combinatorial formula for interpolation Macdonald polynomials by introducing certain polynomials, which we call generic Macdonald polynomials, which depend on $d$ additional parameters and specialize to all…
Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemer\'edi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his…
In this work we will investigate a certain generalization of the so called S-lemma in higher degrees. The importance of this generalization is, that it is closely related to Hilbert's 1888 theorem about tenary quartics. In fact, if such a…
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
According to the classification scheme of the generalized random matrix ensembles, we present various kinds of concrete examples of the generalized ensemble, and derive their joint density functions in an unified way by one simple formula…
Let $R$ be a finite commutative ring with identity and $U(R)$ be its group of units. In 2005, El-Kassar and Chehade presented a ring structure for $U(R)$ and as a consequence they generalized this group of units to the generalized group of…
We introduce a notion of a (V,T)-module over a vertex algebra V for an arbitrary positive integer T, which is a generalization of a twisted V-module. Under some conditions on V, we construct an associative algebra A^{T}_{m}(V) for…
We prove a common extension of Bang's and Kadets' lemmas for contact pairs, in the spirit of the Colourful Carath\'eodory Theorem. We also formulate a generalized version of the affine plank problem and prove it under special assumptions.…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…
We address the component-based regularisation of a multivariate Generalized Linear Mixed Model (GLMM). A set of random responses Y is modelled by a GLMM, using a set X of explanatory variables, a set T of additional covariates, and random…
A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…