Related papers: Standard Lyndon loop words: weighted orders
We derive all-order expressions for perturbations of the Einstein-Hilbert action and the Einstein equation with the general $n$-th order terms. To this end, we employ Cheung and Remmen's perturbation conventions both in tensor density and…
The notion of inverse Lyndon word is related to the classical notion of Lyndon word. More precisely, inverse Lyndon words are all and only the nonempty prefixes of the powers of the anti-Lyndon words, where an anti-Lyndon word with respect…
We present a novel lambda calculus that casts the categorical approach to the study of quantum protocols into the rich and well established tradition of type theory. Our construction extends the linear typed lambda calculus with a linear…
We study the ring theoretical structures of mixable shuffle algebras and their associated free commutative Rota-Baxter algebras. For this study we utilize the connection of the mixable shuffle algebras with the overlapping shuffle algebra…
We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We…
We show explicitly a generalised Lie algebra embedded in the positive and negative parts of the Drinfeld-Jimbo quantum groups of type A_n. Such a generalised Lie algebra satisfy axioms closely related to the ones found by S.L. Woronowicz.…
Loop quantum gravity in its Hamiltonian form relies on a connection formulation of the gravitational phase space with three key properties: 1.) a compact gauge group, 2.) real variables, and 3.) canonical Poisson brackets. In conjunction,…
We develop the theory of generalized bi-Hamiltonian reduction. Applying this theory to a suitable loop algebra we recover a generalized Drinfeld-Sokolov reduction. This gives a way to construct new examples of algebraic Frobenius manifolds.
By fundamental results of Sch\"utzenberger, McNaughton and Papert from the 1970s, the classes of first-order definable and aperiodic languages coincide. Here, we extend this equivalence to a quantitative setting. For this, weighted automata…
A \emph{loop} $(B,\cdot)$ is a set $B$ together with a binary operation $\cdot$ such that (i) for each $a\in B$, the left and right translation mappings $L_{a}:B\to B: x \mapsto a\cdot x$ and $R_{a}:B\to B: x \mapsto x\cdot a$ are…
On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…
This article presents an "in-a-nutshell" yet self-contained introductory review on loop quantum gravity (LQG) -- a background-independent, nonperturbative approach to a consistent quantum theory of gravity. Instead of rigorous and…
We propose a geometric framework for learning meta-embeddings of words from different embedding sources. Our framework transforms the embeddings into a common latent space, where, for example, simple averaging of different embeddings (of a…
We give a ranker-based description using finite-index congruences for the variety $\boldsymbol{\mathrm{DAb}}$ of finite monoids whose regular $\mathcal{D}$-classes form Abelian groups. This combinatorial description yields a normal form for…
Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…
Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties. Furthermore, Alur and Madhusudan introduced automata and…
Based on Lyndon words, a new Sudoku-like puzzle is presented and some relative theoretical questions are proposed.
In this paper, we study and characterise certain blocking sets in generalised polygons. This will allow us to derive new results about the minimum weight and minimum weight code words in the code generated by the rows of the incidence…
Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of {\em…
We consider weighted structures, which extend ordinary relational structures by assigning weights, i.e. elements from a particular group or ring, to tuples present in the structure. We introduce an extension of first-order logic that allows…