相关论文: Root system chip-firing II: Central-firing
The paper is concerned with cohomology of the small quantum group at a root of unity, and of its upper triangular subalgebra, with coefficients in a tilting module. We relate it to a certain t-structure on the derived category of…
We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…
Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is…
As a natural sequel to the study of A-motivic cohomology initiated in "On the integral part of A-motivic cohomology", we develop a notion of regulator for rigid analytically trivial Anderson A-motives. In accordance with the conjectural…
In our previous works on infinite horizontal Ising strips of width $m$ alternating with layers of strings of Ising chains of length $n$, we found the surprising result that the specific heats are not much different for different values of…
The parallel chip-firing game is a periodic automaton on graphs in which vertices "fire" chips to their neighbors. In 1989, Bitar conjectured that the period of a parallel chip-firing game with n vertices is at most n. Though this…
We prove the centrality of $\mathrm{K}_2 (\mathsf{F}_4, \,R)$ for an arbitrary commutative ring $R$. This completes the proof of the centrality of $\mathrm K_2(\Phi,\, R)$ for any root system $\Phi$ of rank $\geq 3$. Our proof uses only…
We give conceptual proofs of certain basic properties of the arrangement of shifted root hyperplanes associated to a root system and a Weyl group invariant real valued parameter function on the root system. The method is based on the role…
Given a graph where every node has certain attributes associated with it and some nodes have labels associated with them, Collective Classification (CC) is the task of assigning labels to every unlabeled node using information from the node…
We present a self-contained introduction to the theory of chip-firing games on metric graphs, as well as the more recent theory of tropical Prym varieties. We briefly discuss the connection between these notions and their algebraic…
For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…
The recently proposed center-focused post-processing procedure [Phys. Rev. Research 2, 033476 (2020)] of cellular dynamical mean-field theory suggests that central sites of large impurity clusters are closer to the exact solution of the…
Digraph-defined external difference families were recently introduced as a natural generalization of several well-studied combinatorial objects motivated by cryptography (e.g. external difference families (EDFs) and circular external…
The intrinsic pinning in high-temperature superconductor with long range antiferromagnetic order of rare-earth ions confined to the isolating planes is described. The interaction of antiferromagnetic and superconducting subsystems in the…
We analyze the nodal points in multi-orbital Fe-based superconductors from a topological perspective. We consider the $s^{+-}$ gap structure with accidental nodes, and the $d$-wave gap with nodes along the symmetry directions. In both…
Ultracold fermions in a one-dimensional, spin-dependent, optical lattice are described by a non-standard Hubbard model with next-nearest-neighbour correlated hopping. Periodic driving of the lattice allows wide tuning of the system…
This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically…
We propose a generalization of the graphical chip-firing model allowing for the redistribution dynamics to be governed by any invertible integer matrix while maintaining the long term critical, superstable, and energy minimizing behavior of…
In this paper, we exhibit two matrix representations of the rational roots of generalized Fibonacci polynomials (GFPs) under convolution product, in terms of determinants and permanents, respectively. The underlying root formulas for GFPs…