Results 61 to 70 of about 6,774 (89)
The representation of the symmetric group on $m$-Tamari intervals (conference version) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 An $m$-ballot path of size $n$ is a path on the square grid consisting of north and east unit steps, starting at (0,0), ending at $(mn,n)$, and never going below the line $\{x=my\}$. The set of these paths can be equipped with a lattice structure, called
Mireille Bousquet-Mélou +2 more
doaj +1 more source
Packing spanning graphs from separable families
, 2016 Let $\mathcal G$ be a separable family of graphs. Then for all positive constants $\epsilon$ and $\Delta$ and for every sufficiently large integer $n$, every sequence $G_1,\dotsc,G_t\in\mathcal G$ of graphs of order $n$ and maximum degree at most $\Delta$
Ferber, Asaf +2 more
core +1 more source
The double scaling limit of the multi-orientable tensor model
, 2015 In this paper we study the double scaling limit of the multi-orientable tensor model. We prove that, contrary to the case of matrix models but similarly to the case of invariant tensor models, the double scaling series are convergent. We resum the double
Gurau, Razvan +2 more
core +1 more source
Strong Jumps and Lagrangians of Non-Uniform Hypergraphs [PDF]
, 2014 The hypergraph jump problem and the study of Lagrangians of uniform hypergraphs are two classical areas of study in the extremal graph theory. In this paper, we refine the concept of jumps to strong jumps and consider the analogous problems over non ...
Johnston, Travis, Lu, Linyuan
core
The solution of the quantum $A_1$ T-system for arbitrary boundary
, 2011 We solve the quantum version of the $A_1$ $T$-system by use of quantum networks. The system is interpreted as a particular set of mutations of a suitable (infinite-rank) quantum cluster algebra, and Laurent positivity follows from our solution.
A. Berenstein +22 more
core +1 more source
Enumeration of Matchings: Problems and Progress
, 1999 This document is built around a list of thirty-two problems in enumeration of matchings, the first twenty of which were presented in a lecture at MSRI in the fall of 1996. I begin with a capsule history of the topic of enumeration of matchings.
Propp, James
core +5 more sources
Increasing and Decreasing Sequences in Fillings of Moon Polyominoes
, 2008 We present an adaptation of jeu de taquin and promotion for arbitrary fillings of moon polyominoes. Using this construction we show various symmetry properties of such fillings taking into account the lengths of longest increasing and decreasing chains ...
Rubey, Martin
core +1 more source
Universality of the Distribution Functions of Random Matrix Theory. II
, 1999 This paper is a brief review of recent developments in random matrix theory. Two aspects are emphasized: the underlying role of integrable systems and the occurrence of the distribution functions of random matrix theory in diverse areas of mathematics ...
Tracy, Craig A., Widom, Harold
core +2 more sources
On distinct cross-ratios and related growth problems
, 2017 It is shown that for a finite set $A$ of four or more complex numbers, the cardinality of the set $C[A]$ of all cross-ratios generated by quadruples of pair-wise distinct elements of $A$ is $|C[A]|\gg |A|^{2+\frac{2}{11}}\log^{-\frac{6}{11}} |A|$ and ...
Rudnev, Misha
core
A note on the stability number of an orthogonality graph. [PDF]
Klerk, E. de, Pasechnik, D.V.
core +1 more source