Related papers: Further Comments on "Residue-to-Binary Converters …
We investigate the random permutation matrices induced by the Chinese restaurant processes with $(\alpha,\theta)$-seating. When $\alpha=0,\theta>0$, the permutations are those following Ewens measures on symmetric groups, and have been…
We propose a novel method to increase shift invariance and prediction accuracy in convolutional neural networks. Specifically, we replace the first-layer combination "real-valued convolutions + max pooling" (RMax) by "complex-valued…
Some mathematical questions relating to Coset Conformal Field Theories (CFT) are considered in the framework of Algebraic Quantum Field Theory as developed previously by us. We consider the issue of fixed point resolution in the diagonal…
A theory is presented for a novel recursion method for O(N) ab initio tight-binding calculations. A long-standing problem of generalizing the recursion method to a non-orthogonal basis, which is a crucial step to make the recursion method…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
Random networks of single-walled carbon nanotubes (CNTs) usually contain both metallic (m-CNTs) and semiconducting (s-CNTs) nanotubes with an approximate ratio of 1:2, which leads to a trade-off between on-conductance and on/off ratio. We…
We give a new proof of the Alexander-Wermer Theorem that characterizes the oriented curves in C^n which bound positive holomorphic chains, in terms of the linking numbers of the curve with algebraic cycles in the complement. In fact, we…
In this article we discuss potential Markov partitions for three different Wang tile protosets. The first partition is for the order-24 aperiodic Wang tile protoset that was recently shown in the Ph.D. thesis of H. Jang to encode all…
In 1986, Swendsen and Wang proposed a replica Monte Carlo algorithm for spin glasses [Phys. Rev. Lett. 57 (1986) 2607]. Two important ingredients are present, (1) the use of a collection of systems (replicas) at different of temperatures,…
Residue Number System (RNS), which originates from the Chinese Remainder Theorem, offers a promising future in VLSI because of its carry-free operations in addition, subtraction and multiplication. This property of RNS is very helpful to…
The concept of comprehensive triangular decomposition (CTD) was first introduced by Chen et al. in their CASC'2007 paper and could be viewed as an analogue of comprehensive Grobner systems for parametric polynomial systems. The first…
The various formulations of scattering amplitudes presented in recent years have underlined a hidden unity among very different theories. The KLT and BCJ relations, together with the CHY formulation, connect the S-matrices of a wide range…
The CPT theorem states that a unitary and Lorentz-invariant theory must also be invariant under a discrete symmetry $\mathbf{CRT}$ which reverses charge, time, and one spatial direction. In this article, we study a $\mathbb{Z}_2 \times…
The Transformer architecture has shown significant success in many language processing and visual tasks. However, the method faces challenges in efficiently scaling to long sequences because the self-attention computation is quadratic with…
The CHY representation of scattering amplitudes is based on integrals over the moduli space of a punctured sphere. We replace the punctured sphere by a double-cover version. The resulting scattering equations depend on a parameter $\Lambda$…
In this paper, we are concerned with the inversion of circulant matrices and their quantized tensor-train (QTT) structure. In particular, we show that the inverse of a complex circulant matrix $A$, generated by the first column of the form…
In this paper, we give the first and second fundamental theorems of invariant theory for certain invariant rings whose generators are expressed by circulant determinants.
We give a self-contained proof of the preservation theorem for proper countable support iterations known as "tools-preservation," "Case A" or "first preservation theorem" in the literature. We do not assume that the forcings add reals.
The development of new algorithms for simulations in physics is as important as the development of new analytical methods. In this paper, we present a comparison of the recently developed microcanonical population annealing (MCPA) algorithm…
In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].