Related papers: Probing for the Trace Estimation of a Permuted Mat…
The standard approach for computing the trace of the inverse of a very large, sparse matrix $A$ is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in…
One proposal to compute parton distributions from first principles is the large momentum effective theory (LaMET), which requires the Fourier transform of matrix elements computed non-perturbatively. Lattice quantum chromodynamics (QCD)…
We explore the physical implications of applying principal component analysis (PCA) to translationally invariant classical systems defined on a $d$-dimensional hypercubic lattice. Using Rayleigh-Schr\"odinger perturbation theory, we…
We report on our exploratory study for the evaluation of the parton distribution functions from lattice QCD, based on a new method proposed in Ref.~arXiv:1305.1539. Using the example of the nucleon, we compare two different methods to…
Transform coding is routinely used for lossy compression of discrete sources with memory. The input signal is divided into N-dimensional vectors, which are transformed by means of a linear mapping. Then, transform coefficients are quantized…
If the structure of spacetime is discrete, then Lorentz symmetry should only be an approximation, valid at long length scales. At finite lattice spacings there will be small corrections to the Dirac evolution that could in principle be…
We discuss how lattice calculations can be a useful tool for the study of structure functions. Particular emphasis is given to the perturbative renormalization of the operators.
We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…
We investigate lossy compression (source coding) of data in the form of permutations. This problem has direct applications in the storage of ordinal data or rankings, and in the analysis of sorting algorithms. We analyze the rate-distortion…
Following a ground-breaking proposal by Ji~\cite{PhysRevLett.110.262002}, numerical simulations of Quantum Chromo Dynamics (QCD) on a Euclidean lattice have provided new, valuable information on the structure of hadrons. In this talk, we…
We survey permutation-based methods for approximate k-nearest neighbor search. In these methods, every data point is represented by a ranked list of pivots sorted by the distance to this point. Such ranked lists are called permutations. The…
We study aperiodic systems based on substitution rules by means of a transfer-matrix approach. In addition to the well-known trace map, we investigate the so-called `antitrace' map, which is the corresponding map for the difference of the…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
Understanding the periodic and structural properties of permutation maps over residue rings such as $\mathbb{Z}_{p^k}$ is a foundational challenge in algebraic dynamics and pseudorandom sequence analysis. Despite notable progress in…
The peculiar phase-ordering properties of a lattice of coupled chaotic maps studied recently (A. Lema\^\i tre & H. Chat\'e, {\em Phys. Rev. Lett.} {\bf 82}, 1140 (1999)) are revisited with the help of detailed investigations of interface…
We demonstrate mesoscopic transport through quantum states in quasi-1D lattices maintaining the combination of parity and time-reversal symmetries by controlling energy gain and loss. We investigate the phase diagram of the non-Hermitian…
We employ the generalized parton picture to analyze the reaction $\pi^- p \rightarrow D^- \Lambda_c^+$. Thereby it is assumed that the process amplitude factorizes into one for the perturbatively calculable subprocess $\bar{u}\ u\rightarrow…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
The parametric lattice-point counting problem is as follows: Given an integer matrix $A \in Z^{m \times n}$, compute an explicit formula parameterized by $b \in R^m$ that determines the number of integer points in the polyhedron $\{x \in…
This paper investigates a novel connection between reductions of companion matrices associated with a symmetric family of certain binomial ideals in the coordinate ring of affine n-space and permutation matrices. Specifically, for fixed…