Related papers: Shuffle theorems and sandpiles

We study how many copies of a graph $F$ that another graph $G$ with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\ge 2$, if $G$ is an $n$ vertex graph with $kn^{3/2}$ triangles…

We introduce and analyze the $S_k$ shuffle on $N$ cards, a natural generalization of the celebrated random adjacent transposition shuffle. In the $S_k$ shuffle, we choose uniformly at random a block of $k$ consecutive cards, and shuffle…

Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general…

For a finite connected graph $G$ and a non-empty subset $S$ of its vertices thought of sinks, the so-called critical group (or sandpile group) $C(G, S)$ has been studied for a long time. We present a class of graphs where such an extension…

Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…

Let {D_x} be a family of unbounded self-adjoint Fredholm operators representing an element of K^1(M). Consider the first two components of the Chern character of the family. It is known that these correspond to the spectral flow of the…

We revisit the globally coupled map lattice (GCML). We use a family of universal 'curves of balance' between two conflicting tendencies in the model- the randomness in each map and the coherence due to an averaging interaction - and we…

We describe a new algorithm, the $(k,\ell)$-pebble game with colors, and use it obtain a characterization of the family of $(k,\ell)$-sparse graphs and algorithmic solutions to a family of problems concerning tree decompositions of graphs.…

A family of discontinuous symplectic maps on the cylinder is considered. This family arises naturally in the study of nonsmooth Hamiltonian dynamics and in switched Hamiltonian systems. The transformation depends on two parameters and is a…

This paper studies the configuration spaces of linkages whose underlying graph is a single cycle. Assume that the edge lengths are such that there are no configurations in which all the edges lie along a line. The main results are that,…

Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…

We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…

We investigate the avalanche dynamics of the abelian sandpile model on arbitrarily large balls of the expanded cactus graph (the Cayley graph of the free product $\mathbb{Z}_3 * \mathbb{Z}_2$). We follow the approach of Dhar and Majumdar…

We develop unbiased strategies to probabilistic T-wave snowball sampling from graphs, where the interest of estimation may concern finite-order subgraphs such as triangles, cycles or stars. Our approaches encompass also the…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

The real multiple zeta values $\zeta(k_1,\ldots,k_r)$ are known to form a ${\bf Q}$-algebra; they satisfy a pair of well-known families of algebraic relations called the double shuffle relations. In order to study the algebraic properties…

The stability problem of a class of nonlinear switched systems defined on compact sets with state-dependent switching is considered. Instead of the Caratheodory solutions, the general Filippov solutions are studied. This encapsulates…

In this paper we give a graph theoretic combinatorial interpretation for the cluster variables that arise in most cluster algebras of finite type. In particular, we provide a family of graphs such that a weighted enumeration of their…

We study a family of maps from $S_n \to S_n$ we call fixed point homing shuffles. These maps generalize a few known problems such as Conway's Topswops, and a card shuffling process studied by Gweneth McKinley. We show that the iterates of…