Related papers: Generalized Hockey Stick Theorem
We prove a conjecture of Casselman and Shahidi stating that the unique irreducible generic subquotient of a standard module is necessarily a subrepresentation for a large class of connected quasi-split reductive groups, in particular for…
A new and easy way of deriving Gauss's Generalized Hypergeometric Theorem is presented by using the Bilateral Binomial Theorem.
A possible method to solve the sign problem is developed by modifying the original theory. Considering several modifications of the partition function, the observable in the original theory is reconstructed from the identity connecting the…
Uniform interpolation is a strengthening of interpolation that holds for certain propositional logics. The starting point of this chapter is a theorem of A. Pitts, which shows that uniform interpolation holds for intuitionistic…
We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…
We give a simple proof of the Emch closing theorem by introducing a new invariant measure on the circle. Special cases of that measures are well-known and have been used in the literature to prove Poncelet's and Zigzag theorems. Some…
We prove two general decomposition theorems for fixed-point invariants: one for the Lefschetz number and one for the Reidemeister trace. These theorems imply the familiar additivity results for these invariants. Moreover, the proofs of…
We give combinatorial proofs of two multivariate Cayley--Hamilton type theorems. The first one is due to Phillips (Amer. J. Math., 1919) involving $2k$ matrices, of which $k$ commute pairwise. The second one regards the mixed discriminant,…
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…
We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…
A tuple $(G_1,\dots,G_n)$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $\chi: [n]\to[n]$ there exists a Hamilton cycle whose $i$-th edge comes from $G_{\chi(i)}$. Bowtell, Morris, Pehova and…
Given an arbitrary ordered pair of coprime integers (a,b) we obtain a pair of identities of the Rogers--Ramanujan type. These identities have the same product side as the (first) Andrews--Gordon identity for modulus 2ab\pm 1, but an…
We give combinatorial proofs of $q$-Stirling identities using restricted growth words. This includes a poset theoretic proof of Carlitz's identity, a new proof of the $q$-Frobenius identity of Garsia and Remmel and of Ehrenborg's Hankel…
We describe recent advances in the study of random analogues of combinatorial theorems.
We study combinatorial principles known as stick and club. Several variants of these principles and cardinal invariants connected to them are also considered. We introduce a new kind of side-by-side product of partial orders which we call…
We prove a new theorem on additive Levy processes and show that this theorem implies several proved theorems and a hard conjectured theorem.
In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of…
A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…
We discuss the recently developed method of refined absorption and how it is used to provide a new proof of the Existence Conjecture for combinatorial designs. This method can also be applied to resolve open problems in extremal and…
We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.