English
Related papers

Related papers: Standard Lyndon loop words: weighted orders

200 papers

In this paper we compare two finite words $u$ and $v$ by the lexicographical order of the infinite words $u^\omega$ and $v^\omega$. Informally, we say that we compare $u$ and $v$ by the infinite order. We show several properties of Lyndon…

Discrete Mathematics · Computer Science 2019-04-02 Francesco Dolce , Antonio Restivo , Christophe Reutenauer

Word embeddings are ubiquitous in NLP and information retrieval, but it is unclear what they represent when the word is polysemous. Here it is shown that multiple word senses reside in linear superposition within the word embedding and…

Computation and Language · Computer Science 2018-12-10 Sanjeev Arora , Yuanzhi Li , Yingyu Liang , Tengyu Ma , Andrej Risteski

We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level…

High Energy Physics - Theory · Physics 2017-08-23 Lee Smolin

We introduce Natural Qubit Algebra (NQA), a compact real operator calculus for qubit systems based on a $2\times2$ block alphabet $\{I,X,Z,W\}\subset\mathrm{Mat}(2,\mathbb{R})$ and tensor-word representations. The resulting multiplication…

Quantum Physics · Physics 2026-02-26 Grigory Koroteev

The general decomposition theory of exponential operators is briefly reviewed. A general scheme to construct independent determining equations for the relevant decomposition parameters is proposed using Lyndon words. Explicit formulas of…

Mathematical Physics · Physics 2009-12-04 Zengo Tsuboi , Masuo Suzuki

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

Discrete Mathematics · Computer Science 2011-08-19 Steven Widmer

We introduce a novel bridge between the familiar gauge field theory approaches used in many areas of modern physics such as quantum field theory and the SLOCC protocols familiar in quantum information. Although the mathematical methods are…

We extend the left-to-right Lyndon factorisation of a word to the left Lyndon tree construction of a Lyndon word. It yields an algorithm to sort the prefixes of a Lyndon word according to the infinite ordering defined by Dolce et al.…

Data Structures and Algorithms · Computer Science 2020-11-26 Golnaz Badkobeh , Maxime Crochemore

Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary first-order sentences. We show its relation to the idea of loop formulas with…

Artificial Intelligence · Computer Science 2023-07-21 Joohyung Lee , Yunsong Meng

This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the…

Logic in Computer Science · Computer Science 2017-01-11 Irini-Eleftheria Mens , Oded Maler

The world's languages exhibit certain so-called typological or implicational universals; for example, Subject-Object-Verb (SOV) languages typically use postpositions. Explaining the source of such biases is a key goal of linguistics. We…

Computation and Language · Computer Science 2024-06-11 Tatsuki Kuribayashi , Ryo Ueda , Ryo Yoshida , Yohei Oseki , Ted Briscoe , Timothy Baldwin

We develop a family of techniques to align word embeddings which are derived from different source datasets or created using different mechanisms (e.g., GloVe or word2vec). Our methods are simple and have a closed form to optimally rotate,…

Computation and Language · Computer Science 2020-11-19 Sunipa Dev , Safia Hassan , Jeff M. Phillips

Division algebras have demonstrated their utility in studying non-associative algebras and their connection to the Standard Model through complex Clifford algebras. This article focuses on exploring the connection between these complex…

High Energy Physics - Theory · Physics 2023-12-19 Armando Reynoso

We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map…

Group Theory · Mathematics 2019-04-05 Alexander Bors , Aner Shalev

The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\mathbb{P}^\ast$ then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove…

Combinatorics · Mathematics 2014-09-15 Jay Pantone , Vincent Vatter

Average word embeddings are a common baseline for more sophisticated sentence embedding techniques. However, they typically fall short of the performances of more complex models such as InferSent. Here, we generalize the concept of average…

Computation and Language · Computer Science 2018-09-13 Andreas Rücklé , Steffen Eger , Maxime Peyrard , Iryna Gurevych

We propose a new line of attack to create a finite quantum theory which includes general relativity and (perhaps) the standard model in its low energy limit. The theory would emerge from the categorical approach. A structure is observed on…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Louis Crane

The Einstein-Hilbert Lagrangian for gravity is non-renormalizable at loop level. However, it can be treated in the effective field theory framework which means that gravity as an effective theory can be renormalized when a proper expansion…

High Energy Physics - Theory · Physics 2018-08-23 Safi Rafie-Zinedine

We argue that a conformally invariant extension of general relativity coupled to the Standard Model is the fundamental theory that needs to be quantized. We show that it can be treated by loop quantum gravity techniques. Through a gauge…

General Relativity and Quantum Cosmology · Physics 2017-01-24 Miguel Campiglia , Rodolfo Gambini , Jorge Pullin

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian
‹ Prev 1 3 4 5 6 7 10 Next ›