Related papers: Quantized rational chip-firing

Two classes of avalanche-finite matrices and their critical groups (integer cokernels) are studied from the viewpoint of chip-firing/sandpile dynamics, namely, the Cartan matrices of finite root systems and the McKay-Cartan matrices for…

We consider a family of random locations, called intrinsic location functionals, of periodic stationary processes. This family includes but is not limited to the location of the path supremum and first/last hitting times. We first show that…

We consider the effects of plane-wave states scattering off finite graphs, as an approach to implementing single-qubit unitary operations within the continuous-time quantum walk framework of universal quantum computation. Four semi-infinite…

This paper proves the existence of global rational structures on spaces of cusp forms of general reductive groups. We identify cases where the constructed rational structures are optimal, which includes the case of GL($n$). As an…

Hereditary chip-firing models generalize the Abelian sandpile model and the cluster firing model to an exponential family of games induced by covers of the vertex set. This generalization retains some desirable properties, e.g.…

We review some recent results concerning integrable quantum field theories in 1+1 space-time dimensions which contain unstable particles in their spectrum. Recalling first the main features of analytic scattering theories associated to…

In the classical stochastic resetting problem, a particle, moving according to some stochastic dynamics, undergoes random interruptions that bring it to a selected domain, and then, the process recommences. Hitherto, the resetting mechanism…

Let $k,p,q$ be three positive integers. A graph $G$ with order $n$ is said to be $k$-placeable if there are $k$ edge disjoint copies of $G$ in the complete graph on $n$ vertices. A $(p,\,q)$-graph is a graph of order $p$ with $q$ edges.…

This paper proposes a Satisfiability Modulo Theory based formulation for floorplanning in VLSI circuits. The proposed approach allows a number of fixed blocks to be placed within a layout region without overlapping and at the same time…

Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…

The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…

We propose a characterization of $k$-Naples parking functions in terms of subsequences with the structure of a complete $k$-Naples parking function. We define complete parking preferences by requiring that for all $j=2,\dots,n$, the number…

The study of domination in graphs has led to a variety of domination problems studied in the literature. Most of these follow the following general framework: Given a graph $G$ and an integer $k$, decide if there is a set $S$ of $k$…

Logarithmic Conformal Field Theories (LCFT) play a key role, for instance, in the description of critical geometrical problems (percolation, self avoiding walks, etc.), or of critical points in several classes of disordered systems…

We present a semiclassical trace formula for the canonical partition function of arbitrary one-dimensional systems. The approximation is obtained via the stationary exponent method applied to the phase-space integration of the density…

The burning number $b(G)$ of a graph $G$ is the minimum number of rounds required to burn all vertices when, at each discrete step, existing fires spread to neighboring vertices and one new fire may be ignited at an unburned vertex. This…

We propose a new scalable platform for quantum computing (QC) -- an array of optically trapped symmetric-top molecules (STMs) of the alkaline earth monomethoxide (MOCH$_3$) family. Individual STMs form qubits, and the system is readily…

We define a version of stable maps into the classifying stack $B\mathrm{GL}_N$, and develop a corresponding notion of $K$-theoretic Gromov-Witten invariants. In this setting, the evaluation morphisms are not of finite type; the definition…

We address the problem of partitioning a vertex-weighted connected graph into $k$ connected subgraphs that have similar weights, for a fixed integer $k\geq 2$. This problem, known as the \emph{balanced connected $k$-partition problem}…

Let $k$ be a field, $G$ be a finite group, $k(x(g):g\in G)$ be the rational function field with the variables $x(g)$ where $g\in G$. The group $G$ acts on $k(x(g):g\in G)$ by $k$-automorphisms where $h\cdot x(g)=x(hg)$ for all $h,g\in G$.…