Related papers: Standard Lyndon loop words: weighted orders
This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal order problem in the Weyl algebra $W=\langle x,D|Dx-xD=1\rangle$. Any word $\omega\in W$ with $m$ $x$'s and $n$…
We show that the distributional nature of soft theorems requires the soft limit expansion to take priority over the regulator expansion of Feynman loop integrals. We start the study of soft graviton theorems at loop level from this…
In this paper, we study Clifford algebra construction from the perspective of adjunctions motivated by the general framework of Krashen and Lieblich. We introduce a category of weighted polynomial laws whose associated Clifford algebra…
Criterion of (Shilov) regularity for weighted algebras $L_1^w(G)$ on a locally compact abelian group $G$ is known by works of Beurling (1949) and Domar (1956). In the present paper this criterion is extended to translation invariant…
The weight distribution of error correction codes is a critical determinant of their error-correcting performance, making enumeration of utmost importance. In the case of polar codes, the minimum weight $\wm$ (which is equal to minimum…
In this paper, we explore applications of combinatorics on words across various domains, including data compression, error detection, cryptographic protocols, and pseudorandom number generation. The examination of the theoretical…
The weighted triangulation algebras associated to triangulation quivers and their socle deformations were recently introduced and studied in [15]-[20] and [2]. These algebras, based on surface triangulations and originated from the theory…
We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language -- which is the number of its (left) quotients, and…
We prove a rigidity theorem for the geometry of the unit ball in random subspaces of the scl norm in B_1^H of a free group. In a free group F of rank k, a random word w of length n (conditioned to lie in [F,F]) has scl(w)=log(2k-1)n/6log(n)…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov and Won that the Word Problem of the one-relator Baumslag…
This work lists and describes the main recent strategies for building fixed-length, dense and distributed representations for words, based on the distributional hypothesis. These representations are now commonly called word embeddings and,…
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
We give a standard introduction to loop quantum gravity, from the ADM variables to spin network states. We include a discussion on quantum geometry on a fixed graph and its relation to a discrete approximation of general relativity.
Grand Unified Theories often involve additional Abelian group factors apart from the standard model hypercharge, that generally lead to loop-induced mixing gauge kinetic terms. In this letter, we show that at the one-loop level this effect…
In order to understand the performance of a code under maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's…
We develop general formulae for the numbers of conjugacy classes and irreducible complex characters of finite p-groups of nilpotency class less than p. This allows us to unify and generalize a number of existing enumerative results, and to…
We study and propose schemes that map messages onto constant-weight codewords using variable-length prefixes. We provide polynomial-time computable formulas that estimate the average number of redundant bits incurred by our schemes. In…
This article reviews the status of several solutions to all the constraints of quantum gravity that have been proposed in terms of loops and extended loops. We discuss pitfalls of several of the results and in particular discuss the issues…
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…