Related papers: Combinatorics for general kinetically constrained …
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
We outline an approach to a theory of various generalizations of the elliptic Calogero-Moser (CM) and Ruijsenaars-Shneider (RS) systems based on a special inverse problem for linear operators with elliptic coefficients. Hamiltonian theory…
Synchronization is observed in many natural systems, with examples ranging from neuronal activation to walking pedestrians. The models proposed by Winfree and Kuramoto stand as the classic frameworks for investigating these phenomena. The…
In a recent work [A. Deger et al., Phys. Rev. Lett. 129, 160601 (2022)] we have shown that kinetic constraints can completely arrest many-body chaos in the dynamics of a classical, deterministic, translationally-invariant spin system with…
Cellular Automata (CA) are commonly investigated as a particular type of dynamical systems, defined by shift-invariant local rules. In this paper, we consider instead CA as algebraic systems, focusing on the combinatorial designs induced by…
This work introduces a family of univariate constrained mixtures of generalized normal distributions (CMGND) where the location, scale, and shape parameters can be constrained to be equal across any subset of mixture components. An…
This paper presents a class of one-dimensional cellular automata (CA) models on traffic flows, featuring nonlocal look-ahead interactions. We develop kinetic Monte Carlo (KMC) algorithms to simulate the dynamics. The standard KMC method can…
This essay advocates the view that any problem that has a meaningful empirical content, can be formulated in constructive, more definitely, finite terms. We consider combinatorial models of dynamical systems and approaches to statistical…
The goal of this paper is to demonstrate the general modeling and practical simulation of random equations with mixture model parameter random variables. Random equations, understood as stationary (non-dynamical) equations with parameters…
Using the fact that any linear representation of a group can be embedded into permutations, we propose a constructive description of quantum behavior that provides, in particular, a natural explanation of the appearance of complex numbers…
Assuming the spin-independence for confining force, we give a covariant quark representation of general composite meson systems with definite Lorentz transformation properties. For benefit of this representation we are able to deduce…
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…
In this paper we extend to a generic class of piecewise smooth dynamical systems a fundamental tool for the analysis of convergence of smooth dynamical systems: contraction theory. We focus on switched systems satisfying Caratheodory…
This study presents a unitary quantum cellular automaton (QCA) that, in the continuum limit, converges to the (1+1)-dimensional Generalized Dirac Equation (GDE). We outline the construction of the unitary, discrete-time evolution and derive…
We study, on a square lattice, an extension to fully coordinated percolation which we call iterated fully coordinated percolation. In fully coordinated percolation, sites become occupied if all four of its nearest neighbors are also…
We extend ring-polymer molecular dynamics (RPMD) to allow for the direct simulation of general, electronically non-adiabatic chemical processes. The kinetically constrained (KC) RPMD method uses the imaginary-time path-integral…
Probabilistic cellular automata (CA) provides a classic framework for studying non-equilibrium statistical physics on a lattices. A notable example is the Domany-Kinzel CA, which has been used to investigate the process of directed…
The Mixup method (Zhang et al. 2018), which uses linearly interpolated data, has emerged as an effective data augmentation tool to improve generalization performance and the robustness to adversarial examples. The motivation is to curtail…
Feynman's diagrammatic series is a common language for a formally exact theoretical description of systems of infinitely-many interacting quantum particles, as well as a foundation for precision computational techniques. Here we introduce a…
The whole enterprise of spin compositions can be recast as simple enumerative combinatoric problems. We show here that enumerative combinatorics (EC)\citep{book:Stanley-2011} is a natural setting for spin composition, and easily leads to…