Related papers: Representing operational semantics with enriched L…
We consider a family of discrete Jacobi operators on the one-dimensional integer lattice with Laplacian and potential terms modulated by a primitive invertible two-letter substitution. We investigate the spectrum and the spectral type, the…
The modern algebra concepts are used to construct tables of algebraic spinors related to Clifford algebra multivectors with real and complex coefficients. The following data computed by Mathematica are presented in form of tables for…
We propose alternative determinant representations of certain form factors and scalar products of states in rational Gaudin models realized in terms of compact spins. We use alternative pseudo-vacuums to write overlaps in terms of partition…
We consider intertwining relations of the augmented $q$-Onsager algebra introduced by Ito and Terwilliger, and obtain generic (diagonal) boundary $K$-operators in terms of the Cartan element of $U_{q}(sl_2)$. These $K$-operators solve…
A new calculus of planar diagrams involving diagrammatics for biadjoint functors and degenerate affine Hecke algebras is introduced. The calculus leads to an additive monoidal category whose Grothendieck ring contains an integral form of…
This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…
We express a weighted generalization of the Delannoy numbers in terms of shifted Jacobi polynomials. A specialization of our formulas extends a relation between the central Delannoy numbers and Legendre polynomials, observed over 50 years…
We study nominal recursors from the literature on syntax with bindings and compare them with respect to expressiveness. The term "nominal" refers to the fact that these recursors operate on a syntax representation where the names of bound…
The antiperiodic transfer matrix associated to higher spin representations of the rational 6-vertex Yang-Baxter algebra is analyzed by generalizing the approach introduced recently in [1], for the cyclic representations, in [2], for the…
We develop a calculus based on graph enumeration for $S_n$-equivariant motivic invariants of graphically stratified moduli spaces. We apply our theory to the Deligne--Mumford moduli space $\overline{\mathcal{M}}_{g, n}$ and to the space of…
This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas…
This paper aims at connecting the various classes that provide an algebraic semantics for three different conservative expansions of Lukasiewicz logic, using algebraic and category-theoretical techniques. We connect such classes of algebras…
We present a symbolic algorithm for treating perturbative expansions of Hamiltonians with general two-body interactions. The method, formally equivalent to determinant Monte Carlo methods, merges well-known analytics with the recently…
We define and study translations between the maximal class of analytic display calculi for tense logics and labeled sequent calculi, thus solving an open problem about the translatability of proofs between the two formalisms. In particular,…
Motivated by Stanley's results in \cite{St02}, we generalize the rank of a partition $\lambda$ to the rank of a shifted partition $S(\lambda)$. We show that the number of bars required in a minimal bar tableau of $S(\lambda)$ is max$(o, e +…
We study the solvability complexity index (SCI) for unbounded selfadjoint operators on separable Hilbert spaces and perturbations thereof. In particular, we show that if the extended essential spectrum of a selfadjoint operator is convex,…
In 1990 Krivine introduced the notion of storage operators. They are $\lambda$-terms which simulate call-by-value in the call-by-name strategy. Krivine has shown that there is a very simple type in the AF2 type system for storage operators…
Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a…
We specify the operational semantics and bisimulation relations for the finite pi-calculus within a logic that contains the nabla quantifier for encoding generic judgments and definitions for encoding fixed points. Since we restrict to the…
Associated to every complex reflection group, we construct a lattice of quotients of its braid monoid-algebra, which we term nil-Hecke algebras, and which are obtained by killing all braid words that are "sufficiently long", as well as some…