Related papers: Generalized Chung-Feller Theorems for Lattice Path…
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…
In this paper, we first present a unified framework for the modelling of generalized lattice Boltzmann method (GLBM). We then conduct a comparison of the four popular analysis methods (Chapman-Enskog analysis, Maxwell iteration, direct…
A unified classification and analysis is presented of two dimensional Dirac operators of QCD-like theories in the continuum as well as in a naive lattice discretization. Thereby we consider the quenched theory in the strong coupling limit.…
In lattice quantum field theory studies, parameters defining the lattice theory must be tuned toward criticality to access continuum physics. Commonly used Markov chain Monte Carlo (MCMC) methods suffer from critical slowing down in this…
A representation is put forward for wave functions of quantum particles in periodic lattice potentials subjected to homogeneous time-periodic forcing, based on an expansion with respect to Bloch-like states which embody both the spatial and…
Sampling from high-dimensional and structured probability distributions is a fundamental challenge in computational physics, particularly in the context of lattice field theory (LFT), where generating field configurations efficiently is…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
The paper contains the generalization of usual lattice model of multicomponent systems. The generalization is related to account the following factors: 1. The short-range parts of interatomic repulsions. These repulsions are not identical…
We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…
We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…
In this paper we adapt parametric geometry of numbers developed by Wolfgang Schmidt and Leonard Summerer to a multiplicative setting, and derive a chain of inequalities for the corresponding exponents which splits the transference…
We propose a novel machine learning method for sampling from the high-dimensional probability distributions of Lattice Field Theories, which is based on a single neural ODE layer and incorporates the full symmetries of the problem. We test…
We show how the Hamiltonian lattice loop representation can be cast straightforwardly in the path integral formalism. The procedure is general for any gauge theory. Here we present in detail the simplest case: pure compact QED. We also…
In this paper it is shown that a generalized circulant matrix underlies every weakly Coupled Map Lattice (CML), independently of the form of the coupling term. Therefore, this matrix will appear always perturbative methods are used to get…
The paper contains an application of the generalized lattice model to multicomponent systems with internal degrees of freedom. The short-range inter-atomic repulsions and smooth long-range parts of the inter-atomic potentials are considered…
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…
The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$,…
The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…
For $n \geq 2$, consider $\mathbb{Z}^n$ as a lattice graph. We explore a generalized Chern-Simons equation on $\mathbb{Z}^n$. Employing the method of exhaustion, we prove that there exists a global solution that also qualifies as a…
We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…