Related papers: Dyck language and fermionic second quantization: I…
Valid hook configurations are combinatorial objects used to understand West's stack sorting map as well as cumulants in noncommutative probability theory. We show a bijection between reduced valid hook configurations on 312-avoiding…
We present a direct basis formalism for using nonorthogonal basis sets in the second quantization framework. As an alternative to the dual basis formalism, a direct basis retains the Hermiticity relation between the creation and…
We introduce a sequence modeling framework in which the latent state is a complex-valued wave function evolving on a finite-dimensional Hilbert space under a learned, time-dependent Hamiltonian. Unlike standard recurrent architectures that…
Studying the extent to which realism is compatible with quantum mechanics teaches us something about the quantum mechanical universe, regardless of the validity of such realistic assumptions. It has also recently been appreciated that these…
Motivated by independent results of Bizley and Duchon, we study rational Dyck paths and their subset of factor-free elements. On the one hand, we give a bijection between rational Dyck paths and regular Dyck paths with ascents colored by…
Two formalisms, both based on context-free grammars, have recently been proposed as a basis for a non-uniform random generation of combinatorial objects. The former, introduced by Denise et al, associates weights with letters, while the…
Motivated by a question and some enumerative conjectures of Richard Stanley, we explore the equivalence classes of words in the Weyl algebra, $\mathbf{k} \left< D,U \mid DU - UD = 1 \right>$. We show that each class is generated by the…
We describe a Riemannian space class where the second Dirac operator arises and prove that the operator is always equivalent to a standard Dirac one. The particle state in this gravitational field is degenerate to some extent and we…
An extension of the Weyl-Wigner-Moyal formulation of quantum mechanics suitable for a Dirac quantized constrained system is proposed. In this formulation, quantum observables are described by equivalent classes of Weyl symbols. The Weyl…
Fermionic Gaussian states have garnered considerable attention due to their intriguing properties, most notably Wick's theorem. Expanding upon the work of Balian and Brezin, who generalized properties of fermionic Gaussian operators and…
Even though most interfaces in the real world are discrete, no efficient way exists to train neural networks to make use of them, yet. We enhance an Interaction Network (a Reinforcement Learning architecture) with discrete interfaces and…
We give a domain-theoretic semantics to a statistical programming language, using the plain old category of dcpos, in contrast to some more sophisticated recent proposals. Remarkably, our monad of minimal valuations is commutative, which…
Recent advancements in speech-language models have yielded significant improvements in speech tokenization and synthesis. However, effectively mapping the complex, multidimensional attributes of speech into discrete tokens remains…
We investigate the spectral consequences of the uniquely determined Hermitian ordering of the Dirac Hamiltonian with spatially varying mass. In contrast to the nonrelativistic case, where continuous families of admissible prescriptions…
Synchronous languages are now a standard industry tool for critical embedded systems. Designers write high-level specifications by composing streams of values using block diagrams. These languages have been extended with Bayesian reasoning…
The first purpose of this article is to provide conditions for a bounded operator in $L^2(\R^n)$ to be the Weyl (resp. anti-Wick) quantization of a bounded continuous symbol on $\R^{2n}$. Then, explicit formulas for the Weyl (resp.…
We study deterministic tree-walking-storage automata, which are finite-state devices equipped with a tree-like storage. These automata are generalized stack automata, where the linear stack storage is replaced by a non-linear tree-like…
Although language models demonstrate remarkable proficiency on mathematical benchmarks, it remains unclear whether this reflects true mathematical reasoning or statistical pattern matching over learning formal syntax. Most existing…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
Feynman's formulation of quantum theory is remarkable in its combination of formal simplicity and computational power. However, as a formulation of the abstract structure of quantum theory, it is incomplete as it does not account for most…