相关论文: Root system chip-firing II: Central-firing
The paper purposes to contribute to the classification of pointed Hopf algebras by the method of Andruskiewitsch and Schneider. The structure of arithmetic root systems is enlightened such that their relation to ordinary root systems…
Iron pnictides are the only known family of unconventional high-temperature superconductors besides cuprates. Until recently, it was widely accepted that superconductivity is spin-fluctuation driven and intimately related to their…
Consider a supercritical Crump-Mode-Jagers process $(\mathcal{Z}_{t}^{\varphi})_{t \geq 0}$ counted with a random characteristic $\varphi$ that depends on an individual's life and their descendant process up to a fixed generation. Under…
Graphs which generalize the simple or affine Dynkin diagrams are introduced. Each diagram defines a bilinear form on a root system and thus a reflection group. We present some properties of these groups and of their natural "Coxeter…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
The transmission through a magnetic layer of correlated electrons sandwiched between non-interacting normal-metal leads is studied within model calculations. We consider the linear regime in the framework of the Meir-Wingreen formalism,…
Pole-swapping algorithms, which are generalizations of the QZ algorithm for the generalized eigenvalue problem, are studied. A new modular (and therefore more flexible) convergence theory that applies to all pole-swapping algorithms is…
Chip-firing and rotor-routing are two well-studied examples of abelian networks. We study the complexity of their respective reachability problems. We show that the rotor-routing reachability problem is decidable in polynomial time, and we…
Solving classification with graph methods has gained huge popularity in recent years. This is due to the fact that the data can be intuitively modeled with graphs to utilize high level features to aid in solving the classification problem.…
This paper completes the comprehensive study of the dimer model on infinite minimal graphs with Fock's weights [arXiv:1503.00289] initiated in [arXiv:2007.14699]: the latter article dealt with the elliptic case, i.e., models whose…
Linear processes are defined as a discrete-time convolution between a kernel and an infinite sequence of i.i.d. random variables. We modify this convolution by introducing decimation, that is, by stretching time accordingly. We then…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
The Katz-Sarnak philosophy states that statistics of zeros of $L$-function families near the central point as the conductors tend to infinity agree with those of eigenvalues of random matrix ensembles as the matrix size tends to infinity.…
We study the scaling of the decoherence factor of a qubit (spin-1/2) using the central spin model in which the central spin (qubit) is globally coupled to a transverse XY spin chain. The aim here is to study the non-equilibrium generation…
As a smaller grain, which is attached on larger one, is growing, it pushes also the larger one and other grains in its surrounding. In a simulation of similar system, repulsive force such as contact force based on linear spring-dashpot…
Motivated by the classical theory of spin structures, we develop a theory for lifting free C$^*$-dynamical systems, a.k.a. noncommutative principal bundles, along central extensions. This theory extends the bundle-theoretic notion of spin…
We study the effect of the correlated hopping term and the intersite Coulomb interaction term on principal features of the $d$-$wave$ superconducting (SC) state, in both the electron and hole doped regimes within the t-J-U model. In our…
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…
We consider the family of guarded and unguarded ordered logics, that constitute a recently rediscovered family of decidable fragments of first-order logic (FO), in which the order of quantification of variables coincides with the order in…
A cohomology theory of root systems emerges naturally in the context of Automorphic Lie Algebras, where it helps formulating some structure theory questions. In particular, one can find concrete models for an Automorphic Lie Algebra by…