Related papers: A pleasant exercise
In this paper, we provide combinatorial proofs for certain partition identities which arise naturally in the context of Langlands' beyond endoscopy proposal. These partition identities motivate an explicit plethysm expansion of…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
The hypergraph container lemma is a powerful tool in probabilistic combinatorics that has found many applications since it was first proved a decade ago. Roughly speaking, it asserts that the family of independent sets of every uniform…
We state and prove a Lemma in 1 variable Calculus, that justifies some arguments previously used to ilustrate non-uniqueness of some generalized physical quantities.
This paper performs the following steps toward the proof of GLC in the de Rham setting: (i) We deduce GLC for G=GL_n; (ii) We prove that the Langlands functor L_G constructed in [GLC1], when restricted to the cuspidal category, is…
The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…
We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…
We present a unified framework of combinatorial descriptions, and the analogous asymptotic growth of the coefficients of two general families of functions related to integer partitions. In particular, we resolve several conjectures and…
Our results can be viewed as applications of algebraic combinatorics in random matrix theory. These applications are motivated by the predictive power of random matrix theory for the statistical behavior of the celebrated Riemann…
We generalize a beautiful method of Blasius and Ramakrishnan, that in order to exhibit particular instances of the Langlands functorial correspondence, it is enough to show that the correspondence holds in the semistable case, provided the…
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called partitions with designated summands. These are constructed by taking unrestricted integer partitions and designating exactly one of each occurrence…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
We demonstrate three properties conjectured to hold for a certain function by Levin (2025) in a study of the blimpy graphical shape of the number of bit strings with a given score under an interesting scoring system. The properties include…
Let G be an unramified reductive group over a non archimedian local field F. The so-called "Langlands Fundamental Lemma" is a family of conjectural identities between orbital integrals for G(F) and orbital integrals for endoscopic groups of…
We propose a call-by-value lambda calculus extended with a new construct inspired by abductive inference and motivated by the programming idioms of machine learning. Although syntactically simple the abductive construct has a complex and…
Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…
These notes give a statement of the "fundamental lemma," which is a conjectural identity between p-adic integrals that arises as part of the Langlands program.