Results 21 to 30 of about 6,774 (89)
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
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
Links in the complex of weakly separated collections [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Plabic graphs are combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by k-element sets of positive integers, and a collection of such k-element sets are the face labels of a plabic graph if that ...
Suho Oh, David Speyer
doaj +1 more source
A Formula for the Möbius Function of the Permutation Poset Based on a Topological Decomposition [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The poset P of all permutations ordered by pattern containment is a fundamental object of study in the field of permutation patterns. This poset has a very rich and complex topology and an understanding of its Möbius function has proved particularly ...
Jason P Smith
doaj +1 more source
Combinatorial descriptions of the crystal structure on certain PBW bases [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Lusztig's theory of PBW bases gives a way to realize the crystal B(∞) for any simple complex Lie algebra where the underlying set consists of Kostant partitions. In fact, there are many different such realizations, one for each reduced expression for the
Ben Salisbury +2 more
doaj +1 more source
Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We present a general diagrammatic approach to the construction of efficient algorithms for computingthe Fourier transform of a function on a finite group.
David Maslan +2 more
doaj +1 more source
Strange Expectations and Simultaneous Cores [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Let gcd(a, b) = 1. J. Olsson and D. Stanton proved that the maximum number of boxes in a simultaneous (a, b)-core is (a2 −1)(b2 −1) 24, and showed that this maximum is achieved by a unique core. P.
Marko Thiel, Nathan Williams
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
Elliptic rook and file numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 In this work, we construct elliptic analogues of the rook numbers and file numbers by attaching elliptic weights to the cells in a board. We show that our elliptic rook and file numbers satisfy elliptic extensions of corre- sponding factorization ...
Michael J. Schlosser, Meesue Yoo
doaj +1 more source