Related papers: A Correction Note: Attractive Nearest Neighbor Spi…
A new algorithm allows us to calculate many new tilting characters for $SL_3$, $SP_4$, $G_2$, $SL_4$ and potentially many other groups. These calculations show that the Lusztig-Williamson Billiards Conjecture needs to be corrected. In this…
Planar spin-transfer devices with dominating easy-plane anisotropy can be described by an effective one-dimensional equation for the in-plane angle. Such a description provides an intuitive qualitative understanding of the magnetic…
In the present paper, we discuss the class of Type III and Type IV codes from the perspectives of neighbors. Our investigation analogously extends the results originally presented by Dougherty [8] concerning the neighbor graph of binary…
We formulate a theory of invariants for the spin symmetric group in some suitable modules which involve the polynomial and exterior algebras. We solve the corresponding graded multiplicity problem in terms of specializations of the Schur…
Nearest neighbor imputation is popular for handling item nonresponse in survey sampling. In this article, we study the asymptotic properties of the nearest neighbor imputation estimator for general population parameters, including…
The Neumann--Zagier matrices of an ideal triangulation are integer matrices with symplectic properties whose entries encode the number of tetrahedra that wind around each edge of the triangulation. They can be used as input data for the…
The Swap-Insert Correction distance from a string $S$ of length $n$ to another string $L$ of length $m\geq n$ on the alphabet $[1..d]$ is the minimum number of insertions, and swaps of pairs of adjacent symbols, converting $S$ into $L$.…
We study coherent excitation hopping in a spin chain realized using highly excited individually addressable Rydberg atoms. The dynamics are fully described in terms of an XY spin Hamiltonian with a long range resonant dipole-dipole coupling…
We re-prove some results about integers whose Zeckendorf and Chung-Graham representations satisfy certain conditions. We use properties of the shift operator and use the software package {\tt Walnut}.
This paper presents an extension to train end-to-end Context-Aware Transformer Transducer ( CATT ) models by using a simple, yet efficient method of mining hard negative phrases from the latent space of the context encoder. During training,…
We study the interaction of gauge fields of arbitrary integer spins with the constant electromagnetic field. We reduce the problem of obtaining the gauge-invariant Lagrangian of integer spin fields in the external field to purely algebraic…
The intuitive sphere-packing argument is used to obtain analytically-tractable closed-form approximations for achievable information rates of coded modulation transmission systems, for which only analytically-intractable expressions are…
We study the Artin Approximation property with constraints in a different frame. As a consequence we give a nested Artin Strong Approximation property for algebraic power series rings over a field.
This paper addresses the issue of inversion in cases where (1) the observation system is modeled by a linear transformation and additive noise, (2) the problem is ill-posed and regularization is introduced in a Bayesian framework by an a…
A comparative analysis of a description of spin dynamics in the cylindrical and Frenet-Serret coordinate systems is carried out. An equivalence of these two systems is shown. A possibility of efficient use of the cylindrical coordinate…
We consider Proximal Newton methods with an inexact computation of update steps. To this end, we introduce two inexactness criteria which characterize sufficient accuracy of these update step and with the aid of these investigate global…
General spin-1/2 chains with symmetric nearest-neighbor interaction are studied. We rigorously prove that all spin models in this class, except for known integrable systems, are non-integrable in the sense that they possess no nontrivial…
We introduce the notion of a combinatorial inverse system in non-commutative variables. We present two important examples, some conjectures and results. These conjectures and results were suggested and supported by computer investigations.
Interpretability techniques in NLP have mainly focused on understanding individual predictions using attention visualization or gradient-based saliency maps over tokens. We propose using k nearest neighbor (kNN) representations to identify…
Author presents a study of certain category of the integrals, which might look quite difficult to compute, but in fact are easily computable, because they do not depend on the parameter in the integrand. As simple and elementary the…