UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS

2005 ◽  
Vol 15 (04) ◽  
pp. 717-724 ◽  
Author(s):  
JASON P. BELL
Keyword(s):  
Automata Theory ◽  
Finite Alphabet ◽  
Asymptotic Estimates

A set of words over a finite alphabet is called an unavoidable set if every word of sufficiently long length must contain some word from this set as a subword. Motivated by a theorem from automata theory, we introduce the notion of an almost unavoidable set and prove certain asymptotic estimates for the size of almost unavoidable sets of uniform length.

On Asymptotic Estimates in Switching and Automata Theory

1966 ◽  
Vol 13 (1) ◽  
pp. 151-157 ◽  
Author(s):  
Michael A. Harrison
Keyword(s):  
Automata Theory ◽  
Asymptotic Estimates

scholarly journals Strings with Maximally Many Distinct Subsequences and Substrings

10.37236/1761 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Abraham Flaxman ◽  
Aram W. Harrow ◽  
Gregory B. Sorkin
Keyword(s):  
Generating Function ◽  
Probabilistic Method ◽  
Finite Alphabet ◽  
Asymptotic Estimates ◽  
Extremal Combinatorics ◽  
De Bruijn

A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-$n$ string over a finite alphabet $\Sigma$; this value grows exponentially, but slower than $2^n$. We use the probabilistic method to determine the maximizing string, which is a cyclically repeating string. The number of distinct subsequences is exactly enumerated by a generating function, from which we also derive asymptotic estimates. For the alphabet $\Sigma=\{1,2\}$, $\,(1,2,1,2,\dots)$ has the maximum number of distinct subsequences, namely ${\rm Fib}(n+3)-1 \sim \left((1+\sqrt5)/2\right)^{n+3} \! / \sqrt{5}$. We also consider the same problem with substrings in lieu of subsequences. Here, we show that an appropriately truncated de Bruijn word attains the maximum. For both problems, we compare the performance of random strings with that of the optimal ones.

scholarly journals WORDS GUARANTEEING MINIMUM IMAGE

2004 ◽  
Vol 15 (02) ◽  
pp. 259-276 ◽  
Author(s):  
S. W. MARGOLIS ◽  
J.-E. PIN ◽  
M. V. VOLKOV
Keyword(s):  
Positive Integer ◽  
Free Monoid ◽  
Automata Theory ◽  
The Other ◽  
Explicit Description ◽  
Finite Alphabet ◽  
Recursive Construction ◽  
Minimum Cardinality ◽  
Alternative Construction ◽  
Element Set

Given a positive integer n and a finite alphabet Σ, a word w over Σ is said to guarantee minimum image if, for every homomorphism φ from the free monoid Σ* over Σ into the monoid of all transformations of an n-element set, the range of the transformation wφ has the minimum cardinality among the ranges of all transformations of the form vφ where v runs over Σ*. Although the existence of words guaranteeing minimum image is pretty obvious, the problem of their explicit description is very far from being trivial. Sauer and Stone in 1991 gave a recursive construction for such a word w but the length of their word was doubly exponential (as a function of n). We first show that some known results of automata theory immediately lead to an alternative construction that yields a simpler word that guarantees minimum image: it has exponential length, more precisely, its length is O(|Σ|⅙(n3-n)). Then with some more effort, we find a word guaranteeing minimum image similar to that of Sauer and Stone but of length O(|Σ|½(n2-n)). On the other hand, we prove that the length of any word guaranteeing minimum image cannot be less than |Σ|n-1.

scholarly journals On a family of weighted convolution algebras

1990 ◽  
Vol 13 (3) ◽  
pp. 517-525 ◽  
Author(s):  
Hans G. Feichtinger ◽  
A. Turan Gürkanli
Keyword(s):  
Fourier Transforms ◽  
Locally Compact Abelian Group ◽  
Asymptotic Estimates ◽  
Locally Compact ◽  
Invariance Properties ◽  
Beurling Algebra ◽  
Convolution Algebras ◽  
Approximate Identities ◽  
Beurling Algebras ◽  
Banach Ideals

Continuing a line of research initiated by Larsen, Liu and Wang [12], Martin and Yap [13], Gürkanli [15], and influenced by Reiter's presentation of Beurling and Segal algebras in Reiter [2,10] this paper presents the study of a family of Banach ideals of Beurling algebrasLw1(G),Ga locally compact Abelian group. These spaces are defined by weightedLp-conditions of their Fourier transforms. In the first section invariance properties and asymptotic estimates for the translation and modulation operators are given. Using these it is possible to characterize inclusions in section 3 and to show that two spaces of this type coincide if and only if their parameters are equal. In section 4 the existence of approximate identities in these algebras is established, from which, among other consequences, the bijection between the closed ideals of these algebras and those of the corresponding Beurling algebra is derived.

scholarly journals Integrable and Chaotic Systems Associated with Fractal Groups

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 237
Author(s):  
Rostislav Grigorchuk ◽  
Supun Samarakoon
Keyword(s):  
Operator Algebras ◽  
Probabilistic Approach ◽  
Schur Complement ◽  
Automata Theory ◽  
Random Schrödinger Operators ◽  
Rational Maps ◽  
Holomorphic Dynamics ◽  
Von Neumann ◽  
Intermediate Growth ◽  
Quasi Crystals

Fractal groups (also called self-similar groups) is the class of groups discovered by the first author in the 1980s with the purpose of solving some famous problems in mathematics, including the question of raising to von Neumann about non-elementary amenability (in the association with studies around the Banach-Tarski Paradox) and John Milnor’s question on the existence of groups of intermediate growth between polynomial and exponential. Fractal groups arise in various fields of mathematics, including the theory of random walks, holomorphic dynamics, automata theory, operator algebras, etc. They have relations to the theory of chaos, quasi-crystals, fractals, and random Schrödinger operators. One important development is the relation of fractal groups to multi-dimensional dynamics, the theory of joint spectrum of pencil of operators, and the spectral theory of Laplace operator on graphs. This paper gives a quick access to these topics, provides calculation and analysis of multi-dimensional rational maps arising via the Schur complement in some important examples, including the first group of intermediate growth and its overgroup, contains a discussion of the dichotomy “integrable-chaotic” in the considered model, and suggests a possible probabilistic approach to studying the discussed problems.

scholarly journals Low-complexity sparse-aware multiuser detection for large-scale MIMO systems

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Rong Ran ◽  
Hayoung Oh
Keyword(s):  
Large Scale ◽  
Mimo Systems ◽  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Finite Alphabet ◽  
Multiuser Detectors ◽  
Input Multiple Output ◽  
Error Detector ◽  
Significant Performance

AbstractSparse-aware (SA) detectors have attracted a lot attention due to its significant performance and low-complexity, in particular for large-scale multiple-input multiple-output (MIMO) systems. Similar to the conventional multiuser detectors, the nonlinear or compressive sensing based SA detectors provide the better performance but are not appropriate for the overdetermined multiuser MIMO systems in sense of power and time consumption. The linear SA detector provides a more elegant tradeoff between performance and complexity compared to the nonlinear ones. However, the major limitation of the linear SA detector is that, as the zero-forcing or minimum mean square error detector, it was derived by relaxing the finite-alphabet constraints, and therefore its performance is still sub-optimal. In this paper, we propose a novel SA detector, named single-dimensional search-based SA (SDSB-SA) detector, for overdetermined uplink MIMO systems. The proposed SDSB-SA detector adheres to the finite-alphabet constraints so that it outperforms the conventional linear SA detector, in particular, in high SNR regime. Meanwhile, the proposed detector follows a single-dimensional search manner, so it has a very low computational complexity which is feasible for light-ware Internet of Thing devices for ultra-reliable low-latency communication. Numerical results show that the the proposed SDSB-SA detector provides a relatively better tradeoff between the performance and complexity compared with several existing detectors.

scholarly journals Algebraic singularities of scattering amplitudes from tropical geometry

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
James Drummond ◽  
Jack Foster ◽  
Ömer Gürdoğan ◽  
Chrysostomos Kalousios
Keyword(s):  
Scattering Amplitudes ◽  
Natural Language ◽  
Tropical Geometry ◽  
Cluster Algebras ◽  
Finite Alphabet ◽  
Square Root ◽  
Finite Sets ◽  
Yang Mills ◽  
Square Roots ◽  
Algebraic Singularities

Abstract We address the appearance of algebraic singularities in the symbol alphabet of scattering amplitudes in the context of planar $$ \mathcal{N} $$ N = 4 super Yang-Mills theory. We argue that connections between cluster algebras and tropical geometry provide a natural language for postulating a finite alphabet for scattering amplitudes beyond six and seven points where the corresponding Grassmannian cluster algebras are finite. As well as generating natural finite sets of letters, the tropical fans we discuss provide letters containing square roots. Remarkably, the minimal fan we consider provides all the square root letters recently discovered in an explicit two-loop eight-point NMHV calculation.

Sign in / Sign up

Export Citation Format

Share Document