English
Related papers

Related papers: Quantized rational chip-firing

200 papers

We show a collection of scripts, called $G$-strongly positive scripts, which is used to recognize critical configurations of a chip firing game (CFG) on a multi-digraph with a global sink. To decrease the time of the process of recognition…

Combinatorics · Mathematics 2014-12-04 Tran Thi Thu Huong

In this work we study kinklike structures, which are localized solutions that appear in models described by real scalar fields. The model to be considered is characterized by two real scalar fields and includes a function of one of the two…

High Energy Physics - Theory · Physics 2020-05-07 D. Bazeia , M. A. Liao , M. A. Marques

A graph $G = (V,E)$ is called equistable if there exist a positive integer $t$ and a weight function $w : V \to \mathbb{N}$ such that $S \subseteq V$ is a maximal stable set of $G$ if and only if $w(S) = t$. Such a function $w$ is called an…

Data Structures and Algorithms · Computer Science 2015-03-04 Eun Jung Kim , Martin Milanic , Oliver Schaudt

We propose a theory of characterizing quantum circuits with qubit functional configurations. Any quantum circuit can be decomposed into alternating sequences of 1-qubit unitary gates and CNOT gates. Each CNOT sequence prepares the current…

Quantum Physics · Physics 2022-05-13 Zixuan Hu , Sabre Kais

Let $\mathcal{C}$ be a positive integer cone and $k\in \mathcal{C}$. A $\mathcal{C}$-semigroup $S$ is $k$-positioned if for every $h\in \mathcal{C}\setminus S$ we have that $k-h$ belongs to $S$. In this work, we focus on this family of…

Combinatorics · Mathematics 2026-01-28 Carmelo Cisto , Raquel Tapia-Ramos

In this paper we study three classes of models widely used in physics, computer science and social science: the Chip Firing Game, the Abelian Sandpile Model and the Chip Firing Game on a mutating graph. We study the set of configurations…

Combinatorics · Mathematics 2007-05-23 Clemence Magnien

Periodic drives are a common tool to control physical systems, but have a limited applicability because time-dependent drives generically lead to heating. How to prevent the heating is a fundamental question with important practical…

Disordered Systems and Neural Networks · Physics 2018-10-24 Atanu Rajak , Roberta Citro , Emanuele G. Dalla Torre

We study the connection between Rational Conformal Field Theory (RCFT), $N=2$ massive supersymmetric field theory, and solvable Interaction Round the Face (IRF) lattice models. Specifically, one identifies the fusion rings with the chiral…

High Energy Physics - Theory · Physics 2018-11-05 Doron Gepner

The computation of rank ordering plays a fundamental role in cognitive tasks and offers a basic building block for computing arbitrary digital functions. Spiking neural networks have been demonstrated to be capable of identifying the…

Adaptation and Self-Organizing Systems · Physics 2020-12-02 Fabio Schittler Neves , Marc Timme

Given a critical quantum spin chain with a microscopic Lie-group symmetry, corresponding e.g. to $U(1)$ or $SU(2)$ spin isotropy, we numerically investigate the emergence of Kac-Moody symmetry at low energies and long distances. In that…

Strongly Correlated Electrons · Physics 2022-09-21 Ruoshui Wang , Yijian Zou , Guifre Vidal

Our main result here is that the specialization at $t=1/q$ of the $Q_{km,kn}$ operators studied in [4] may be given a very simple plethystic form. This discovery yields elementary and direct derivations of several identities relating these…

Combinatorics · Mathematics 2015-01-06 A. M. Garsia , E. Leven , N. Wallach , G. Xin

The M$_k$ models for 1D lattice fermions are characterised by ${\cal N}=2$ supersymmetry and by an order-$k$ clustering property. This paper highlights connections with quantum field theories (QFTs) in various regimes. At criticality the…

Statistical Mechanics · Physics 2017-07-19 T. Fokkema , K. Schoutens

We consider the stationary state of a quantum walk on the finite path, where the sink and source are set at the left and right boundaries. The quantum coin is uniformly placed at every vertex of the path graph. At every time step, a new…

Quantum Physics · Physics 2022-03-11 Yoshihiro Anahara , Norio Konno , Hisashi Morioka , Etsuo Segawa

In the stochastic sandpile model on a graph, particles interact pairwise as follows: if two particles occupy the same vertex, they must each take an independent random walk step with some probability $0<p<1$ of not moving. These…

Probability · Mathematics 2022-04-27 Andrew Melchionna

It is shown uniquely that quantized spaces are realised on four-dimensional compact manifolds. In the case of O(1,5) quantized space this are four independent parameters of O(5) unit vector; in the case of O(2,4) these are parameters of one…

High Energy Physics - Theory · Physics 2007-05-23 A. N. Leznov

We construct geometric models for classifying spaces of linear algebraic groups in G-equivariant motivic homotopy theory, where G is a tame group scheme. As a consequence, we show that the equivariant motivic spectrum representing the…

K-Theory and Homology · Mathematics 2020-09-16 Marc Hoyois

We propose a general framework to build certified proofs of distributed self-stabilizing algorithms with the proof assistant Coq. We first define in Coq the locally shared memory model with composite atomicity, the most commonly used model…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-06-22 Karine Altisen , Pierre Corbineau , Stephane Devismes

We study the dynamics of lattice models of quantum spins one-half, driven by a coherent drive and subject to dissipation. Generically the meanfield limit of these models manifests multistable parameter regions of coexisting steady states…

Quantum Physics · Physics 2020-02-06 Haggai Landa , Marco Schiró , Grégoire Misguich

The classical parking functions, counted by the Cayley number (n+1)^(n-1), carry a natural permutation representation of the symmetric group S_n in which the number of orbits is the n'th Catalan number. In this paper, we will generalize…

Combinatorics · Mathematics 2014-03-10 Drew Armstrong , Nicholas A. Loehr , Gregory S. Warrington

We introduce a natural variant of the parallel chip-firing game, called the diffusion game. Chips are initially assigned to vertices of a graph. At every step, all vertices simultaneously send one chip to each neighbour with fewer chips. As…

Discrete Mathematics · Computer Science 2023-06-22 C. Duffy , T. F. Lidbetter , M. E. Messinger , R. J. Nowakowski