Results 41 to 50 of about 26,723 (134)
Combinatorics of triangular partitions [PDF]
Enumerative Combinatorics and Applications, 2022 The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining points $(r,0 ...
F. Bergeron, M. Mazin
semanticscholar +1 more source
Brick polytopes, lattices and Hopf algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Generalizing the connection between the classes of the sylvester congruence and the binary trees, we show that the classes of the congruence of the weak order on Sn defined as the transitive closure of the rewriting rule UacV1b1 ···VkbkW ≡k UcaV1b1 ...
Vincent Pilaud
doaj +1 more source
Yang-Baxter basis of Hecke algebra and Casselman's problem (extended abstract) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We generalize the definition of Yang-Baxter basis of type A Hecke algebra introduced by A.Lascoux, B.Leclerc and J.Y.Thibon (Letters in Math. Phys., 40 (1997), 75–90) to all the Lie types and prove their duality.
Maki Nakasuji, Hiroshi Naruse
doaj +1 more source
Counting connected graphs with large excess [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e.
Élie De Panafieu
doaj +1 more source
A q-analog of Euler's decomposition formula for the double zeta function [PDF]
, 2005 The double zeta function was first studied by Euler in response to a letter from Goldbach in 1742. One of Euler's results for this function is a decomposition formula, which expresses the product of two values of the Riemann zeta function as a finite sum
Bradley, David M.
core +5 more sources
Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We prove that the noncrossing partition lattices associated with the complex reflection groups G(d, d, n) for d, n ≥ 2 admit a decomposition into saturated chains that are symmetric about the middle ranks.
Henri Mühle
doaj +1 more source
Central Limit Theorems via Analytic Combinatorics in Several Variables [PDF]
Electronic Journal of Combinatorics, 2022 The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate generating ...
S. Melczer, Tiadora Ruza
semanticscholar +1 more source
Multivariable Christoffel-Darboux Kernels and Characteristic Polynomials of Random Hermitian Matrices [PDF]
, 2006 We study multivariable Christoffel-Darboux kernels, which may be viewed as reproducing kernels for antisymmetric orthogonal polynomials, and also as correlation functions for products of characteristic polynomials of random Hermitian matrices.
Rosengren, Hjalmar
core +5 more sources
Recipe theorem for the Tutte polynomial for matroids, renormalization group-like approach [PDF]
, 2013 Using a quantum field theory renormalization group-like differential equation, we give a new proof of the recipe theorem for the Tutte polynomial for matroids.
Duchamp, Gérard H. E. +3 more
core +3 more sources
Affine type A geometric crystal structure on the Grassmannian [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We construct a type A(1) n−1 affine geometric crystal structure on the Grassmannian Gr(k, n). The tropicalization of this structure recovers the combinatorics of crystal operators on semistandard Young tableaux of rectangular shape (with n − k rows ...
Gabriel Frieden
doaj +1 more source