相关论文: Informative Words and Discreteness
Empirical properties of generating systems for complex reflection groups and their braid groups have been observed by Orlik-Solomon and Brou\'e-Malle-Rouquier, using Shephard-Todd classification. We give a general existence result for…
Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually…
This document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…
We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…
We present a survey of results on word equations in simple groups, as well as their analogues and generalizations, which were obtained over the past decade using various methods, group-theoretic and coming from algebraic and arithmetic…
We define a word in two positive definite (complex Hermitian) matrices $A$ and $B$ as a finite product of real powers of $A$ and $B$. The question of which words have only positive eigenvalues is addressed. This question was raised some…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…
In this paper we investigate higher moments attached to the Chebotarev Density Theorem. Our focus is on the impact that peculiar Galois group structures have on the limiting distribution. Precisely we consider in this paper the case of…
We define and construct a new data structure, the tables, this structure generalizes the (finite) $k$-sets sets of Eilenberg \cite{Ei}, it is versatile (one can vary the letters, the words and the coefficients). We derive from this…
A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence. We construct a family of n^{1/3} permutations on n letters, such that…
We describe solutions of the equation $x^ny^m=a^nb^m$ in acylindrically hyperbolic groups (AH-groups), where $a,b$ are non-commensurable special loxodromic elements and $n,m$ are integers with sufficiently large common divisor. Using this…
We introduce a stochastic process and functional that should describe the semigroup generated by the stochastic Bessel operator. Recently Gorin and Shkolnikov showed that the largest eigenvalues for certain random matrix ensembles with soft…
We describe a family of words in Thompson's group F which present a challenge to the question of finding canonical minimal length representatives, and which show that F is not combable by geodesics. These words have the property that there…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite…
Different notions of amenability on hypergroups and their relations are studied. Developing Leptin's theorem for discrete hypergroups, we characterize the existence of a bounded approximate identity for hypergroup Fourier algebras. We study…
These notes were prepared for the MSRI hot topics workshop on superstrong approximation (2012). We give a brief overview of the developments in the theory, especially the fundamental expansion theorem. Applications to diophantine problems…
We investigate the properties of word lengths of elements from a three-reflection symmetric generating set of the dihedral group $D_n$. Specifically, we provide the upper bound $\lambda_1(D_n,S) \leq \lfloor\frac{n}{2}\rfloor + 1$ for a…
A family of information theoretic models of communication was introduced more than a decade ago to explain the origins of Zipf's law for word frequencies. The family is a based on a combination of two information theoretic principles:…