Related papers: From Bruhat intervals to intersection lattices and…

A $k$-permutation family on $n$ vertices is a set system consisting of the intervals of $k$ permutations of the integers $1$ through $n$. The discrepancy of a set system is the minimum over all red-blue vertex colorings of the maximum…

In this paper we generalize our investigation of the unitarity of non-compact WZNW models connected to Hermitian symmetric spaces to the N=1 world-sheet supersymmetric extension of these models. We will prove that these models have a…

For a complex reductive Lie group G with Lie algebra g, Cartan subalgebra h and Weyl group W, we describe the category of perverse sheaves on h/W smooth w.r.t the natural stratification. The answer is given in terms of mixed Bruhat sheaves,…

We prove that if $\sigma \in S_m$ is a pattern of $w \in S_n$, then we can express the Schubert polynomial $\mathfrak{S}_w$ as a monomial times $\mathfrak{S}_\sigma$ (in reindexed variables) plus a polynomial with nonnegative coefficients.…

In our previous work, we provided an algebraic proof of the Zinger's comparison formula between genus one Gromov-Witten invariants and reduced invariants when the target space is a complete intersection of dimension two or three in a…

We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook…

We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which…

We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…

Following Braverman-Finkelberg-Feigin-Rybnikov (arXiv:1008.3655), we study the convolution algebra of a handsaw quiver variety, a.k.a. a parabolic Laumon space, and a finite W-algebra of type A. This is a finite analog of the AGT conjecture…

We solve Chui's conjecture on the simplest fractions (i.e., sums of Cauchy kernels with unit coefficients) in weighted (Hilbert) Bergman spaces. Namely, for a wide class of weights, we prove that for every $N$, the simplest fractions with…

Let $\mathfrak g$ be a simple Lie algebra with Cartan subalgebra $\mathfrak h$ and Weyl group $W$. We build up a graded map $(\mathcal H\otimes \bigwedge\mathfrak h\otimes \mathfrak h)^W\to (\bigwedge \mathfrak g\otimes \mathfrak…

Postnikov constructed a decomposition of a totally nonnegative Grassmannian into positroid cells. We provide combinatorial formulas that allow one to decide which cell a given point belongs to and to determine affine coordinates of the…

The elements in the hyperoctahedral group $\mathfrak{B}_n$ can be treated as signed permutations with the natural order $\cdots<-2<-1<0<1<2<\cdots$, or as colored permutations with the $r$-order $-1<_r-2<_r\cdots<_r0<_r1<_r2<_r\cdots$. For…

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

V.F. Molchanov considered the Hilbert series for the space of invariant skew-symmetric tensors and dual tensors with polynomial coefficients under the action of a real reflection group, and speculated that it had a certain product formula…

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…

For an arrangement of $n$ pseudolines in the real projective plane let us denote by $t_i$ the number of vertices incident to $i$ lines. We obtain a linear on $t_i$ inequality similar to the Hirzebruch one, but with an elementary proof. We…

We develop a new approach to approximate families of sets, complementing the existing `$\Delta$-system method' and `junta approximations method'. The approach, which we refer to as `spread approximations method', is based on the notion of…

Let ${\mathscr L}=(X,\preceq)$ be a lattice. For ${\cal P}\subseteq X$ we say that ${\cal P}$ is $t$-{\it intersecting} if ${\sf rank}(x\wedge y)\ge t$ for all $x,y\in{\cal P}$. The seminal theorem of Erd\H{o}s, Ko and Rado describes the…

Scott proved in 1997 that for any tree $T$, every graph with bounded clique number which does not contain any subdivision of $T$ as an induced subgraph has bounded chromatic number. Scott also conjectured that the same should hold if $T$ is…