Results 81 to 90 of about 13,276 (167)
Posets, Regular CW Complexes and Bruhat Order
A poset P is thin if all its intervals of length two have cardinality four. For other terminology see e.g., the author and \textit{M. Wachs} [Trans. Am. Math. Soc. 277, 323-341 (1983; Zbl 0514.05009)]. In this very interesting paper the author continues his efforts at the classification of those posets which are somehow (combinatorially) topological in
openaire +1 more source
Feigin–Odesskii brackets associated with Kodaira cycles and positroid varieties
Abstract We establish a link between open positroid varieties in the Grassmannians G(k,n)$G(k,n)$ and certain moduli spaces of complexes of vector bundles over Kodaira cycle Cn$C^n$, using the shifted Poisson structure on the latter moduli spaces and relating them to the standard Poisson structure on G(k,n)$G(k,n)$.
Zheng Hua, Alexander Polishchuk
wiley +1 more source
Geometric Bruhat order on (0,1)-matrices
The combinatorially and the geometrically defined partial orders on the set of permutations coincide. We extend this result to $(0,1)$-matrices with fixed row and column sums. Namely, the Bruhat order induced by the geometry of a Cherkis bow variety of type A coincides with one of the two combinatorially defined Bruhat orders on the same set.
Botta, Tommaso Maria +2 more
openaire +2 more sources
Moments of symmetric square L$L$‐functions on GL(3)${\rm GL}(3)$
Abstract We give an asymptotic formula with power saving error term for the twisted first moment of symmetric square L$L$‐functions on GL(3)${\rm GL}(3)$ in the level aspect. As applications, we obtain nonvanishing results as well as lower bounds of the expected order of magnitude for all even moments, supporting the random matrix model for a unitary ...
Valentin Blomer, Félicien Comtat
wiley +1 more source
On Degrees in the Hasse Diagram of the Strong Bruhat Order
For a permutation $\pi$ in the symmetric group $S_n$ let the {\it total degree} be its valency in the Hasse diagram of the strong Bruhat order on $S_n$, and let the {\it down degree} be the number of permutations which are covered by $\pi$ in the strong ...
Ron M. Adin +4 more
core +1 more source
On Invertibility of Large Binary Matrices
Many data processing applications involve binary matrices for storing digital information. At present, there are limited results in the literature about algorithms for inverting large binary matrices.
Ibrahim Mammadov +2 more
doaj +1 more source
A uniform model for Kirillov-Reshetikhin crystals. Extended abstract
We present a uniform construction of tensor products of one-column Kirillov-Reshetikhin (KR) crystals in all untwisted affine types, which uses a generalization of the Lakshmibai-Seshadri paths (in the theory of the Littelmann path model).
Lenart, Cristian +4 more
core
Higher bruhat orders and cyclic hyperplane arrangements
Bruhat (partial) orders form a class of important posets with interesting interpretations and relationships to a variety of structures of both combinatorial and/or topological nature, which have been reasonably well- studied as a consequence. Accordingly, it is important to discover proper generalizations which exhibit analogous connections to ...
openaire +1 more source
A catalanization map on the symmetric group [PDF]
Mahir Bilen Can +2 more
doaj +1 more source
Bruhat Order for Two Flags and a Line [PDF]
36 pages. Version 2 adds an Introduction stating results in terms of S_n; and corrects typos, including in statement of move (v).
openaire +3 more sources

