Results 11 to 20 of about 26,723 (134)
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
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
Seven open problems in applied combinatorics [PDF]
Journal of Combinatorics, 2023 We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut ...
Sinan G. Aksoy +12 more
semanticscholar +1 more source
A two-sided analogue of the Coxeter complex [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 For any Coxeter system (W, S) of rank n, we introduce an abstract boolean complex (simplicial poset) of dimension 2n − 1 which contains the Coxeter complex as a relative subcomplex.
T. Kyle Petersen
doaj +1 more source
Combinatorics of Exceptional Sequences in Type A [PDF]
Electronic Journal of Combinatorics, 2015 Exceptional sequences are certain sequences of quiver representations. We introduce a class of objects called strand diagrams and use these to classify exceptional sequences of representations of a quiver whose underlying graph is a type $\mathbb{A}_n ...
Alexander Garver +3 more
semanticscholar +1 more source
Compatibility fans realizing graphical nested complexes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Graph associahedra are polytopes realizing the nested complex N(G) on connected subgraphs of a graph G.While all known explicit constructions produce polytopes with the same normal fan, the great variety of fan realizationsof classical associahedra and ...
Thibault Manneville, Vincent Pilaud
doaj +1 more source
The Combinatorics Behind the Leading Kazhdan-Lusztig Coefficients of Braid Matroids [PDF]
Electronic Journal of Combinatorics, 2023 Ferroni and Larson gave a combinatorial interpretation of the braid Kazhdan-Lusztig polynomials in terms of series-parallel matroids. As a consequence, they confirmed an explicit formula for the leading Kazhdan-Lusztig coefficients of braid matroids with
Alice L. L. Gao +3 more
semanticscholar +1 more source
Asymptotics of lattice walks via analytic combinatorics in several variables [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We consider the enumeration of walks on the two-dimensional non-negative integer lattice with steps defined by a finite set S ⊆ {±1, 0}2 . Up to isomorphism there are 79 unique two-dimensional models to consider, and previous work in this area has used ...
Stephen Melczer, Mark C. Wilson
doaj +1 more source
Longest Increasing Subsequences of Random Colored Permutations [PDF]
Electronic Journal of Combinatorics, 1999 We compute the limit distribution for the (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by Baik, Deift,
A. Borodin
semanticscholar +1 more source