Results 41 to 50 of about 6,774 (89)
A combinatorial approach to Macdonald q, t-symmetry via the Carlitz bijection [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We investigate the combinatorics of the symmetry relation H μ(x; q, t) = H μ∗ (x; t, q) on the transformed Macdonald polynomials, from the point of view of the combinatorial formula of Haglund, Haiman, and Loehr in terms of the inv and maj statistics on ...
Maria Monks Gillespie
doaj +1 more source
Dual Immaculate Quasisymmetric Functions Expand Positively into Young Quasisymmetric Schur Functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We describe a combinatorial formula for the coefficients when the dual immaculate quasisymmetric func- tions are decomposed into Young quasisymmetric Schur functions. We prove this using an analogue of Schensted insertion.
Edward Allen, Joshua Hallam, Sarah Mason
doaj +1 more source
The generalized Gelfand–Graev characters of GLn(Fq) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, gener- alized Gelfand–Graev characters have remained somewhat mysterious. Even in the case of the finite general linear groups, the combinatorics of their
Scott Andrews, Nathaniel Thiem
doaj +1 more source
Arctic curves of the octahedron equation [PDF]
, 2014 We study the octahedron relation (also known as the $A_{\infty}$ $T$-system), obeyed in particular by the partition function for dimer coverings of the Aztec Diamond graph.
Francesco +2 more
core +3 more sources
Recent developments in algebraic combinatorics
, 2004 A survey of three recent developments in algebraic combinatorics: (1) the Laurent phenomenon, (2) Gromov-Witten invariants and toric Schur functions, and (3) toric h-vectors and intersection cohomology. This paper is a continuation of "Recent progress in
Stanley, Richard P.
core +2 more sources
, 2014 Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs.
Krivelevich, Michael
core +1 more source
Parking functions, tree depth and factorizations of the full cycle into transpositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Consider the set Fn of factorizations of the full cycle (0 1 2 · · · n) ∈ S{0,1,...,n} into n transpositions. Write any such factorization (a1 b1) · · · (an bn) with all ai < bi to define its lower and upper sequences (a1, . . .
John Irving, Amarpreet Rattan
doaj +1 more source
The flag upper bound theorem for 3- and 5-manifolds [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We prove that among all flag 3-manifolds on n vertices, the join of two circles with [n 2] and [n 2] vertices respectively is the unique maximizer of the face numbers. This solves the first case of a conjecture due to Lutz and Nevo. Further, we establish
Hailun Zheng
doaj +1 more source
New Strongly Regular Graphs from Finite Geometries via Switching [PDF]
, 2019 We show that the strongly regular graph on non-isotropic points of one type of the polar spaces of type $U(n, 2)$, $O(n, 3)$, $O(n, 5)$, $O^+(n, 3)$, and $O^-(n, 3)$ are not determined by its parameters for $n \geq 6$.
Ihringer, Ferdinand, Munemasa, Akihiro
core +3 more sources
A lattice point counting generalisation of the Tutte polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion- contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a matroid, and in fact
Amanda Cameron, Alex Fink
doaj +1 more source