Related papers: Shuffle theorems and sandpiles
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
We define the notion of a parahoric group scheme $\mathcal G$ over a smooth projective curve, and formulate four conjectures on the structure of the stack of $\mathcal G$-bundles, which generalize to this case well-known results on…
We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…
This paper models games where the strategies are nodes of a graph G (we denote them as G-games) and in presence of coalition structures. The cases of one-shot and repeated games are presented. In the latter situation, coalitions are assumed…
The number of ``carries'' when $n$ random integers are added forms a Markov chain [23]. We show that this Markov chain has the same transition matrix as the descent process when a deck of $n$ cards is repeatedly riffle shuffled. This gives…
In 2003, Haglund's {\sf bounce} statistic gave the first combinatorial interpretation of the $q,t$-Catalan numbers and the Hilbert series of diagonal harmonics. In this paper we propose a new combinatorial interpretation in terms of the…
In this paper we shall develop a theory of (extended) double shuffle relations of Euler sums which generalizes that of multiple zeta values (see Ihara, Kaneko and Zagier, \emph{Derivation and double shuffle relations for multiple zeta…
The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…
We consider Gallai's graph Modular Decomposition theory for network analytics. On the one hand, by arguing that this is a choice tool for understanding structural and functional similarities among nodes in a network. On the other, by…
We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…
To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…
We study noncommutative differential structures on the group of permutations $S_N$, defined by conjugacy classes. The 2-cycles class defines an exterior algebra $\Lambda_N$ which is a super analogue of the Fomin-Kirillov algebra $\CE_N$ for…
The celebrated Erd\H{o}s-Hajnal conjecture states that for every proper hereditary graph class $\mathcal{G}$ there exists a constant $\varepsilon = \varepsilon(\mathcal{G}) > 0$ such that every graph $G \in \mathcal{G}$ contains a clique or…
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
The class of index-mixed copulas is introduced and its properties are investigated. Index-mixed copulas are constructed from given base copulas and a random index vector, and show a rather remarkable degree of analytical tractability. The…
Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon's descent algebra and another using random walk on chambers of hyperplane arrangements. These coincide for types $A$,$B$,$C$, $H_3$, and rank two groups.…
We study flips of moduli schemes of stable torsion free sheaves as wall-crossing phenomena of moduli schemes of stable modules over certain finite dimensional algebra. They are described as stratified Grassmann bundles.