相关论文: Balanced words in higher dimensions
We present an uncertainty relation for the representation of signals in two different general (possibly redundant or incomplete) signal sets. This uncertainty relation is relevant for the analysis of signals containing two distinct features…
We exhibit combinatorial results on Christoffel words and binary balanced words that are motivated by their geometric interpretation as approximations of digital segments. We give a closed formula for counting the exact number of balanced…
We consider weighted negatively reinforced urn schemes with finitely many colours. An urn scheme is called negatively reinforced, if the selection probability for a colour is proportional to the weight $w$ of the colour proportion, where…
Generalizing previous results, we introduce and study a new statistic on words, that we call rectangle capacity. For two fixed positive integers $r$ and $s$, this statistic counts the number of occurrences of a rectangle of size $r\times s$…
Despite the recent popularity of word embedding methods, there is only a small body of work exploring the limitations of these representations. In this paper, we consider one aspect of embedding spaces, namely their stability. We show that…
Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second. We show that the…
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…
We consider the following problem. Let us fix a finite alphabet A; for any given d-uple of letter frequencies, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u…
A social choice correspondence satisfies balancedness if, for every pair of alternatives, x and y, and every pair of individuals, i and j, whenever a profile has x adjacent to but just above y for individual i while individual j has y…
Let $S$ be a set of $r$ red points and $b=r+2d$ blue points in general position in the plane, with $d\geq 0$. A line $\ell$ determined by them is said to be balanced if in each open half-plane bounded by $\ell$ the difference between the…
A random balanced sample (RBS) is a multivariate distribution with n components X_1,...,X_n, each uniformly distributed on [-1, 1], such that the sum of these components is precisely 0. The corresponding vectors X lie in an…
We consider harmonic functions in the unit ball of $\mathbb{R}^{n+1}$ that are unbounded near the boundary but can be estimated from above by some (rapidly increasing) radial weight $w$. Our main result gives some conditions on $w$ that…
Which statistical features distinguish a meaningful text (possibly written in an unknown system) from a meaningless set of symbols? Here we answer this question by comparing features of the first half of a text to its second half. This…
A language $L$ is said to be dense if every word in the universe is an infix of some word in $L$. This notion has been generalized from the infix operation to arbitrary word operations $\varrho$ in place of the infix operation…
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~$L$ that assign to each word~$w$ a real number~$L(w)$. In the case of infinite words, the value of a run is…
A graph $G = (V, E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that, for any two distinct vertices $x, y \in V$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. Two letters $x$ and $y$ are said to…
We study random words in a weighted regular language that achieve the maximal free energy using thermodynamics formalism. In particular, typical words in the language are algorithmically generated which have applications in computer…
The paper deals with balances and imbalances in Arnoux-Rauzy words. We provide sufficient conditions for $C$-balancedness, but our results indicate that even a characterization of 2-balanced Arnoux-Rauzy words on a 3-letter alphabet is not…
Word sense disambiguation (WSD) is a well researched problem in computational linguistics. Different research works have approached this problem in different ways. Some state of the art results that have been achieved for this problem are…
We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.