Related papers: (Sets of ) Complement Scattered Factors
Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Henceforth, we simply refer to them as words. Motivated by recent…
In this paper we study the asymptotic distribution of the moments of (non-normalized) traces $\Tr (w_1), \Tr(w_2), ..., \Tr(w_r)$, where $ w_1, w_2, >..., w_r$ are reduced words in unitaries in the group $\cU(N)$. We prove that as $N\to…
Current state-of-the-art nonparametric Bayesian text clustering methods model documents through multinomial distribution on bags of words. Although these methods can effectively utilize the word burstiness representation of documents and…
In the author's PhD thesis (2019) universal envelopes were introduced as a tool for studying the continuously obtainable information on discontinuous functions. To any function $f \colon X \to Y$ between $\operatorname{qcb}_0$-spaces one…
It is known that if a B\"uchi context-free language (BCFL) consists of scattered words, then there is an integer $n$, depending only on the language, such that the Hausdorff rank of each word in the language is bounded by $n$. Every BCFL is…
We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…
Construct recursively a long string of words w1. .. wn, such that at each step k, w k+1 is a new word with a fixed probability p $\in$ (0, 1), and repeats some preceding word with complementary probability 1 -- p. More precisely, given a…
In this work, we study the problems of counting and sampling Mazurkiewicz traces that a regular language touches. Fix an alphabet $\Sigma$ and an independence relation $\mathbb{I} \subseteq \Sigma \times \Sigma$. The input consists of a…
In combinatorics on words, the well-studied factor complexity function $\rho_{\infw{x}}$ of a sequence $\infw{x}$ over a finite alphabet counts, for every nonnegative integer $n$, the number of distinct length-$n$ factors of $\infw{x}$. In…
This article study the fractional Hamiltonian systems \begin{eqnarray}\label{00} {_{t}}D_{\infty}^{\alpha}({_{-\infty}}D_{t}^{\alpha}u) + \lambda L(t)u = \nabla W(t, u), \;\;t\in \mathbb{R}, \end{eqnarray} where $\alpha \in (1/2, 1)$,…
Let S be a finite set of words over an alphabet Sigma. The set S is said to be complete if every word w over the alphabet Sigma is a factor of some element of S*, i.e. w belongs to Fact(S*). Otherwise if S is not complete, we are interested…
Frobenius observed that the number of times an element of a finite group is obtained as a commutator is given by a specific combination of the irreducible characters of the group. More generally, for any word w the number of times an…
Cluster-weighted factor analyzers (CWFA) are a versatile class of mixture models designed to estimate the joint distribution of a random vector that includes a response variable along with a set of explanatory variables. They are…
We study chance constrained optimization problems $\min_x f(x)$ s.t. $P(\left\{ \theta: g(x,\theta)\le 0 \right\})\ge 1-\epsilon$ where $\epsilon\in (0,1)$ is the violation probability, when the distribution $P$ is not known to the decision…
Word embeddings allow natural language processing systems to share statistical information across related words. These embeddings are typically based on distributional statistics, making it difficult for them to generalize to rare or unseen…
A finite word $w$ is called \textit{closed} if it has length at most 1 or it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences in $w$. An infinite word $u$ is called…
The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…
For any $d \geq 1$, random $\mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $\alpha \in [0,1]$, an alphabet $\mathcal{A}$, and a scale $n \in \mathbb{N}$, one obtains a distribution…
Let $W$ be an infinite word over finite alphabet $A$. We get combinatorial criteria of existence of interval exchange transformations that generate the word W.
The concept of NP-completeness has been proposed for half a century, and it is conjectured that there are no subexponential-time algorithms for NP-hard problems, which is known as the Exponential Time Hypothesis (ETH). As a pivotal…