English
Related papers

Related papers: Two operators on sandpile configurations, the sand…

200 papers

We classify recurrent states of the Abelian sandpile model (ASM) on the complete split graph. There are two distinct cases to be considered that depend upon the location of the sink vertex in the complete split graph. This characterisation…

Combinatorics · Mathematics 2021-02-10 Mark Dukes

We study combinatorial aspects of the sandpile model on wheel and fan graphs, seeking bijective characterisations of the model's recurrent configurations on these families. For wheel graphs, we exhibit a bijection between these recurrent…

Combinatorics · Mathematics 2023-03-30 Thomas Selig

Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…

Logic in Computer Science · Computer Science 2023-06-07 Zeinab Galal

We prove several results concerning a polynomial that arises from the sandpile model on directed graphs; these results are previously only known for undirected graphs. Implicit in the sandpile model is the choice of a sink vertex, and it is…

Combinatorics · Mathematics 2018-02-13 Swee Hong Chan

The lacking polynomial is a graph polynomial introduced by Chan, Marckert, and Selig in 2013 that is closely related to the Tutte polynomial of a graph. It arose by way of a generalization of the Abelian sandpile model and is essentially…

Combinatorics · Mathematics 2024-11-06 Amal Alofi , Mark Dukes

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

Combinatorics · Mathematics 2018-10-08 Mark Dukes , Thomas Selig , Jason P. Smith , Einar Steingrimsson

We give a complete characterization of polynomials in two complex variables that are cyclic with respect to the coordinate shifts acting on Dirichlet-type spaces in the bidisk, which include the Hardy space and the Dirichlet space of the…

Functional Analysis · Mathematics 2016-10-10 Catherine Bénéteau , Greg Knese , Łukasz Kosiński , Constanze Liaw , Daniel Seco , Alan Sola

Using techniques introduced by H. Thomas and N. Williams in "Cyclic Symmetry of the Scaled Simplex," we prove that modular sweep maps are bijective. We construct the inverse of the modular sweep map by passing through an intermediary set of…

Combinatorics · Mathematics 2018-02-28 Hugh Thomas , Nathan Williams

We establish a bijective correspondence between Smirnov words with balanced letter multiplicities and Hamiltonian paths in complete $m$-partite graphs $K_{n,n,\ldots,n}$. This bijection allows us to derive closed inclusion-exclusion…

Combinatorics · Mathematics 2025-10-31 El-Mehdi Mehiri

We classify recurrent configurations of the sandpile model on the complete bipartite graph K_{m,n} in which one designated vertex is a sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes…

Combinatorics · Mathematics 2013-01-22 Mark Dukes , Yvan Le Borgne

We consider a model of stable edge sets (``matchings'') in a bipartite graph $G=(V,E)$ in which the preferences for vertices of one side (``firms'') are given via choice functions subject to standard axioms of consistency, substitutability…

Combinatorics · Mathematics 2025-01-28 Alexander V. Karzanov

Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…

Combinatorics · Mathematics 2025-06-30 Changxin Ding

This paper establishes connections between EW-tableaux and parallelogram polyominoes by using recent research regarding the sandpile model on the complete bipartite graph. This paper presents and proves a direct bijection between…

Combinatorics · Mathematics 2020-08-03 Amal Alofi , Mark Dukes

Operators are induced on fermion and zeon algebras by the action of adjacency matrices and combinatorial Laplacians on the vector spaces spanned by the graph's vertices. Properties of the algebras automatically give information about the…

Combinatorics · Mathematics 2021-03-31 G. Stacey Staples

This paper studies sorted recurrent configurations of the Abelian sandpile model on the complete split graph. We introduce two natural toppling processes, CTI and ITC toppling, on the recurrent configurations and use these to define two…

Combinatorics · Mathematics 2025-12-23 Henri Derycke , Mark Dukes , Yvan Le Borgne

The main contribution of this paper is a formula for the number of acyclic orientations of a complete bipartite, $K_{n_1,n_2},$ revealing that it is equal to the poly-Bernoulli number $B_{n_1}^{(-n_2)}$ introduced in 1997 by Kaneko. We also…

Combinatorics · Mathematics 2022-11-09 Peter J. Cameron , C. A. Glass , Kamilla Rekvényi , R. U. Schumacher

We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…

Combinatorics · Mathematics 2021-08-31 Samuel Herman , Eirini Poimenidou

We study cocycle properties of vertex operators and present an operator representation of cocycle operators, which are attached to vertex operators to ensure the duality of amplitudes. It is shown that this analysis makes it possible to…

High Energy Physics - Theory · Physics 2008-11-26 Tsutomu Horiguchi , Makoto Sakamoto , Masayoshi Tabuse

Let $X$ be a complex topological vector space with dim$(X)>1$ and $\mathcal{B}(X)$ the space of all continuous linear operators on $X$. In this paper, we extend the concept of supercyclicity of a single operators and strongly continuous…

Functional Analysis · Mathematics 2018-10-18 Mohamed Amouch , Otmane Benchiheb

We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…

Computational Geometry · Computer Science 2024-01-25 Philip Todd
‹ Prev 1 2 3 10 Next ›