Related papers: SD-Regular Transducer Expressions for Aperiodic Tr…
We discuss various details of our derivation of the exact expression for the Adler D function in N=1 supersymmetric QCD (SQCD). This exact formula relates the D function to anomalous dimensions of the matter superfields. Our perturbative…
Speculative Decoding (SD) is a key technique for accelerating Large Language Model (LLM) inference, but it typically requires training a draft model on a large dataset. We approach this problem from a data-centric perspective, finding that…
Effective reinforcement learning (RL) for sepsis treatment depends on learning stable, clinically meaningful state representations from irregular ICU time series. While previous works have explored representation learning for this task, the…
A word-to-word function is continuous for a class of languages~$\mathcal{V}$ if its inverse maps $\mathcal{V}$_languages to~$\mathcal{V}$. This notion provides a basis for an algebraic study of transducers, and was integral to the…
Trajectory Representation Learning (TRL) is a powerful tool for spatial-temporal data analysis and management. TRL aims to convert complicated raw trajectories into low-dimensional representation vectors, which can be applied to various…
As is well known, the type 1 Lie superalgebra sl(r+1|s+1) admits a one parameter family of finite dimensional irreducible representations. We have carried out an analytic Bethe ansatz related to this family of representations. We present…
Consider a quasi-periodic Schr\"odinger operator $H_{\alpha,\theta}$ with analytic potential and irrational frequency $\alpha$. Given any rational approximating $\alpha$, let $S_+$ and $S_-$ denote the union, respectively, the intersection…
We report some further developments regarding the language theory of higher-dimensional automata (HDAs). Regular languages of HDAs are sets of finite interval partially ordered multisets (pomsets) with interfaces. We show a pumping lemma…
Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations…
We prove a useful identity valid for all $ADE$ minimal S-matrices, that clarifies the transformation of the relative thermodynamic Bethe Ansatz (TBA) from its standard form into the universal one proposed by Al.B.Zamolodchikov. By…
Set functions are functions (or signals) indexed by the powerset (set of all subsets) of a finite set N. They are fundamental and ubiquitous in many application domains and have been used, for example, to formally describe or quantify loss…
We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automata and transducers. They extend finite-state automata by…
We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite…
We examine a fractional Discrete Nonlinear Schrodinger dimer, where the usual first-order derivative of the time evolution is replaced by a non integer-order derivative. The dimer is nonlinear (Kerr) and PT -symmetric, and we examine the…
Directional transforms have recently raised a lot of interest thanks to their numerous applications in signal compression and analysis. In this letter, we introduce a generalization of the discrete Fourier transform, called steerable DFT…
Spectral form factor (SFF), one of the key quantity from random matrix theory, serves as an important tool to probe universality in disordered quantum systems and quantum chaos. In this work, we present exact closed-form expressions for the…
Probabilistic diffusion models have achieved state-of-the-art results for image synthesis, inpainting, and text-to-image tasks. However, they are still in the early stages of generating complex 3D shapes. This work proposes Diffusion-SDF, a…
We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automata and transducers. They extend finite-state automata by…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
An S-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic dynamical system is one where the directive sequence consists of…