English
Related papers

Related papers: Jumbled Scattered Factors

200 papers

Given a finite word u, we define its palindromic length |u|_{pal} to be the least number n such that u=v_1v_2... v_n with each v_i a palindrome. We address the following open question: Does there exist an infinite non ultimately periodic…

Combinatorics · Mathematics 2012-10-25 Anna E. Frid , Svetlana Puzynina , Luca Zamboni

The frequency of the preferred order for a noun phrase formed by demonstrative, numeral, adjective and noun has received significant attention over the last two decades. We investigate the actual distribution of the 24 possible orders.…

Computation and Language · Computer Science 2026-01-23 Ramon Ferrer-i-Cancho

A finite word u is said to be bordered if u has a proper prefix which is also a suffix of u, and unbordered otherwise. Ehrenfeucht and Silberger proved that an infinite word is purely periodic if and only if it contains only finitely many…

Formal Languages and Automata Theory · Computer Science 2015-01-30 Emilie Charlier , Tero Harju , Svetlana Puzynina , Luca Zamboni

Generalized Word Length Pattern (GWLP) is an important and widely-used tool for comparing fractional factorial designs. We consider qualitative factors, and we code their levels using the roots of the unity. We write the GWLP of a fraction…

Statistics Theory · Mathematics 2015-09-22 Roberto Fontana , Fabio Rapallo , Maria-Piera Rogantin

If $u$ and $v$ are two words, the correlation of $u$ over $v$ is a binary word that encodes all possible overlaps between $u$ and $v$. This concept was introduced by Guibas and Odlyzko as a key element of their method for enumerating the…

Combinatorics · Mathematics 2023-09-14 Narad Rampersad , Max Wiebe

A Catalan word $w$ is said to be flattened if the subsequence of $w$ obtained by taking the first letter of each weakly increasing run is nondecreasing. Let $\mathcal{F}_n$ denote the set of flattened Catalan words of length $n$, which has…

Combinatorics · Mathematics 2025-02-18 Mark Shattuck

One of the ultimate goals for linguists is to find universal properties in human languages. Although words are generally considered as representing arbitrary mapping between linguistic forms and meanings, we propose a new universal law that…

Computation and Language · Computer Science 2020-05-06 Li-Min Wang , Sun-Ting Tsai , Shan-Jyun Wu , Meng-Xue Tsai , Daw-Wei Wang , Yi-Ching Su , Tzay-Ming Hong

In this paper we combine statistical analysis of large text databases and simple stochastic models to explain the appearance of scaling laws in the statistics of word frequencies. Besides the sublinear scaling of the vocabulary size with…

Physics and Society · Physics 2014-11-05 Martin Gerlach , Eduardo G. Altmann

Quantitative linguistics has provided us with a number of empirical laws that characterise the evolution of languages and competition amongst them. In terms of language usage, one of the most influential results is Zipf's law of word…

Physics and Society · Physics 2009-01-21 Alvaro Corral , Ramon Ferrer-i-Cancho , Gemma Boleda , Albert Diaz-Guilera , .

A challenging task for word embeddings is to capture the emergent meaning or polarity of a combination of individual words. For example, existing approaches in word embeddings will assign high probabilities to the words "Penguin" and "Fly"…

Computation and Language · Computer Science 2018-05-30 Qiuchi Li , Sagar Uprety , Benyou Wang , Dawei Song

The factor complexity ${\mathcal C}_{\mathbf u}$ of a sequence ${\mathbf u} = u_0u_1u_2 \cdots$ over a finite alphabet counts the number of factors of length $n$ occurring in $\mathbf u$, i.e., ${\mathcal C}_{\mathbf u}(n) = \#{\mathcal…

Combinatorics · Mathematics 2025-11-18 Lubomíra Dvořáková , Edita Pelantová

An alternative parametric description for discrete random variables, called muculants, is proposed. In contrast to cumulants, muculants are based on the Fourier series expansion, rather than on the Taylor series expansion, of the logarithm…

Probability · Mathematics 2017-11-15 Christian Knoll , Bernhard C. Geiger , Gernot Kubin

We define a family of natural decompositions of Sturmian words in Christoffel words, called *reversible Christoffel* (RC) factorizations. They arise from the observation that two Sturmian words with the same language have (almost always)…

Discrete Mathematics · Computer Science 2013-07-12 Michelangelo Bucci , Alessandro De Luca , Luca Q. Zamboni

In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…

Combinatorics · Mathematics 2022-03-02 Antoine Domenech , Pascal Ochem

Let $u \shuffle v$ denote the set of all shuffles of the words $u$ and $v$. It is shown that for each integer $n \geq 3$ there exists a square-free ternary word $u$ of length $n$ such that $u\shuffle u$ contains a square-free word. This…

Discrete Mathematics · Computer Science 2013-09-10 Tero Harju , Mike Müller

A word over an ordered alphabet is said to be clustering if identical letters appear adjacently in its Burrows-Wheeler transform. Such words are strictly related to (discrete) interval exchange transformations. We use an extended version of…

Formal Languages and Automata Theory · Computer Science 2025-04-28 Francesco Dolce , Christian B. Hughes

We propose a multivariate probability distribution that models a linear correlation between binary and continuous variables. The proposed distribution is a natural extension of the previously developed multivariate binary distribution. As…

Methodology · Statistics 2023-02-14 Takashi Arai

Factor analysis is a classical data reduction technique that seeks a potentially lower number of unobserved variables that can account for the correlations among the observed variables. This paper presents an extension of the factor…

Methodology · Statistics 2013-12-04 Tsung-I Lin , Pal H. Wu , Geoffrey J. McLachlan , Sharon X. Lee

Given two functions $\mathbf{a}\!:\! [n] \rightarrow [n]$ and $\mathbf{b}\!:\! [n] \rightarrow [n]$ chosen uniformly at random, any word $w=w_1w_2\dots w_k\in \{a,b\}^k$ induces a random function $\mathbf{w}\!:\! [n] \rightarrow [n]$ by…

Probability · Mathematics 2026-04-01 Guillaume Chapuy , Guillem Perarnau

Causal processes can give rise to distinctive distributions in the linguistic variables that they affect. Consequently, a secure understanding of a variable's distribution can hold a key to understanding the forces that have causally shaped…

Computation and Language · Computer Science 2021-01-01 Jayden L. Macklin-Cordes , Erich R. Round