In this article, we describe an explicit bijection between the set of $(m,n)$-words as defined by Pilaud and Poliakova and the set of of two-toned tilings of a strip of length $m+n$.
This is an informal and mostly expository note describing some asymptotic behavior and qualitative properties of the q-binomial coefficients. The results are mostly not new, but the overall story we present does not seem to be well known -- and the diagrams are all new.
Alexandre Bazin, Laurent Beaudou, Giacomo Kahn
et al.
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications. In this paper we prove that this number grows at least like 1.4977^n and at most like 1.5012^n.
Plabic graphs are combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by k-element sets of positive integers, and a collection of such k-element sets are the face labels of a plabic graph if that collection forms a maximal weakly separated collection. There are moves that one can apply to plabic graphs, and thus to maximal weakly separated collections, analogous to mutations of seeds in cluster algebras. In this short note, we show if two maximal weakly separated collections can be mutated from one to another, then one can do so while freezing the face labels they have in common. In particular, this provides a new, and we think simpler, proof of Postnikov's result that any two reduced plabic graphs with the same decorated permutations can be mutated to each other.
We show that the density μ of the Smith normal form (SNF) of a random integer matrix exists and equals a product of densities μps of SNF over Z/psZ with p a prime and s some positive integer. Our approach is to connect the SNF of a matrix with the greatest common divisors (gcds) of certain polynomials of matrix entries, and develop the theory of multi-gcd distribution of polynomial values at a random integer vector. We also derive a formula for μps and determine the density μ for several interesting types of sets.
Emmanuel Fricain, Andreas Hartmann, William T. Ross
AbstractIn this paper we discuss the range of a co-analytic Toeplitz operator. These range spaces are closely related to de Branges–Rovnyak spaces (in some cases they are equal as sets). In order to understand its structure, we explore when the range space decomposes into the range of an associated analytic Toeplitz operator and an identifiable orthogonal complement. For certain cases, we compute this orthogonal complement in terms of the kernel of a certain Toeplitz operator on the Hardy space, where we focus on when this kernel is a model space (backward shift invariant subspace). In the spirit of Ahern–Clark, we also discuss the non-tangential boundary behavior in these range spaces. These results give us further insight into the description of the range of a co-analytic Toeplitz operator as well as its orthogonal decomposition. Our Ahern–Clark type results, which are stated in a general abstract setting, will also have applications to related sub-Hardy Hilbert spaces of analytic functions such as the de Branges–Rovnyak spaces and the harmonically weighted Dirichlet spaces.
We prove a common generalization of the maximal independent arborescence packing theorem of Cs. Király and two of our earlier works about packing branchings in infinite digraphs.
We obtain a nonrecursive combinatorial formula for the Kazhdan-Lusztig polynomials which holds in complete generality and which is simpler and more explicit than any existing one, and which cannot be linearly simplified. Our proof uses a new basis of the peak subalgebra of the algebra of quasisymmetric functions.
There are numerous combinatorial objects associated to a Grassmannian permutation $w_λ$ that index cells of the totally nonnegative Grassmannian. We study some of these objects (rook placements, acyclic orientations, various restricted fillings) and their q-analogues in the case of permutations $\mathcal{w}$ that are not necessarily Grassmannian.
We discuss arrangements of equal minors in totally positive matrices. More precisely, we would like to investigate the structure of possible equalities and inequalities between the minors. We show that arrangements of equals minors of largest value are in bijection with <i>sorted sets</i>, which earlier appeared in the context of <i>alcoved polytopes</i> and Gröbner bases. Maximal arrangements of this form correspond to simplices of the alcoved triangulation of the hypersimplex; and the number of such arrangements equals the <i>Eulerian number</i>. On the other hand, we conjecture and prove in many cases that arrangements of equal minors of smallest value are exactly the <i>weakly separated sets</i>. Weakly separated sets, originally introduced by Leclerc and Zelevinsky, are closely related to the \textitpositive Grassmannian and the associated <i>cluster algebra</i>.