We define and study odd analogues of classical geometric and combinatorial objects associated to permutations, namely odd Schubert varieties, odd diagrams, and odd inversion sets. We show that there is a bijection between odd inversion sets of permutations and acyclic orientations of the Turán graph, that the dimension of the odd Schubert variety associated to a permutation is the odd length of the permutation, and give several necessary conditions for a subset of [ n ] × [ n ] to be the odd diagram of a permutation. We also study the sign-twisted generating function of the odd length over descent classes of the symmetric groups
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the ...
AbstractWe apply the Weil conjectures to the Hessenberg varieties to obtain information about the co...
An odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We ...
We define and study odd analogues of classical geometric and combinatorial objects associated to pe...
The odd diagram of a permutation is a subset of the classical diagram with additional parity conditi...
We define for any crystallographic root system a new statistic on the corresponding Weyl group which...
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is t...
International audienceWe give simple combinatorial proofs of some formulas for the number of factori...
We define and study odd and even analogues of the major index statistics for the classical Weyl gro...
An odd hole is an induced odd cycle of length at least 5. Scott and Seymour confirmed a conjecture o...
AbstractWe studyBalanced labellingsof diagrams representing the inversions in a permutation. These a...
We introduce q- and signed analogues of several constructions in and around the theory of symmetric ...
Funding: SDF was supported by a St Leonard’s International Doctoral Fees Scholarship and a School of...
We identify the ring of odd symmetric functions introduced by Ellis and Khovanov as the space of ske...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the ...
AbstractWe apply the Weil conjectures to the Hessenberg varieties to obtain information about the co...
An odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We ...
We define and study odd analogues of classical geometric and combinatorial objects associated to pe...
The odd diagram of a permutation is a subset of the classical diagram with additional parity conditi...
We define for any crystallographic root system a new statistic on the corresponding Weyl group which...
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is t...
International audienceWe give simple combinatorial proofs of some formulas for the number of factori...
We define and study odd and even analogues of the major index statistics for the classical Weyl gro...
An odd hole is an induced odd cycle of length at least 5. Scott and Seymour confirmed a conjecture o...
AbstractWe studyBalanced labellingsof diagrams representing the inversions in a permutation. These a...
We introduce q- and signed analogues of several constructions in and around the theory of symmetric ...
Funding: SDF was supported by a St Leonard’s International Doctoral Fees Scholarship and a School of...
We identify the ring of odd symmetric functions introduced by Ellis and Khovanov as the space of ske...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the ...
AbstractWe apply the Weil conjectures to the Hessenberg varieties to obtain information about the co...
An odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We ...