Results 61 to 70 of about 26,723 (134)
Graphs where every k-subset of vertices is an identifying set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Combinatorics
Sylvain Gravier +3 more
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
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
Counting occurrences of some subword patterns [PDF]
, 2003 We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns.
Burstein, A., Mansour, T.
core +5 more sources
Constructing combinatorial operads from monoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar combinatorial objects:
Samuele Giraudo
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
Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics
Advances in Combinatorics, 2021 The existence of cycles with a given length is classical topic in graph theory with a plethora of open problems. Examples related to the main result of this paper include a conjecture of Burr and Erdős from 1976 asked whether for every integer $m$ and a ...
K. S. Lyngsie, Martin Merker
semanticscholar +1 more source
The representation of the symmetric group on $m$-Tamari intervals (conference version) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 An $m$-ballot path of size $n$ is a path on the square grid consisting of north and east unit steps, starting at (0,0), ending at $(mn,n)$, and never going below the line $\{x=my\}$. The set of these paths can be equipped with a lattice structure, called
Mireille Bousquet-Mélou +2 more
doaj +1 more source
A bijective proof of Macdonald's reduced word formula [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We describe a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. The proof extends to a principal specialization of the identity due to Fomin and Stanley.
Sara Billey +2 more
doaj +1 more source
Schur polynomials and matrix positivity preservers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A classical result by Schoenberg (1942) identifies all real-valued functions that preserve positive semidefi- niteness (psd) when applied entrywise to matrices of arbitrary dimension.
Alexander Belton +3 more
doaj +1 more source