相关论文: Stable Invariants of Words from Random Matrices

The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…

Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word counts exhibits a rich asymptotic structure. We investigate all…

Return words are a classical tool for studying shift spaces with low factor complexity. In recent years, their projection inside groups have attracted some attention, for instance in the context of dendric shift spaces, of generation of…

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…

The monopole map defines an element in an equivariant stable cohomotopy group refining the Seiberg-Witten invariant. This first of two articles presents the details of the definition of the stable cohomotopy invariant and discusses its…

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…

We obtain sharp estimates on the growth rate of stable commutator length on random (geodesic) words, and on random walks, in hyperbolic groups and groups acting nondegenerately on hyperbolic spaces. In either case, we show that with high…

Statistical independence is a notion ubiquitous in various fields such as in statistics, probability, number theory and physics. We establish the stability of independence for any pair of random variables by their corresponding Brockwell…

The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…

We introduce the notion of stable representations, -- it is a new class of the representations of a certain class of groups which defined with positive definite functions which generalize the classical notion of the characters (or trace).…

Let G be a group acting on a tree with cyclic edge and vertex stabilizers. Then stable commutator length (scl) is rational in G. Furthermore, scl varies predictably and converges to rational limits in so-called "surgery" families. This is a…

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical…

One-dimensional persistent homology is arguably the most important and heavily used computational tool in topological data analysis. Additional information can be extracted from datasets by studying multi-dimensional persistence modules and…

Elements of the commutator subgroup of a free group can be presented as values of canonical forms, called Wicks forms. We show that, starting from sufficiently high genus g, there is a sequence of words w(g) which can be presented by f(g)…

We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…

Let $w=w(x_1,\ldots,x_r)$ be an outer commutator word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables. This applies in particular to words of the form…

If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…

For any group, there is a natural (pseudo-)norm on the vector space B1 of real (group) 1-boundaries, called the stable commutator length norm. This norm is closely related to, and can be thought of as a relative version of, the Gromov…

Consider a group word w in n letters. For a compact group G, w induces a map G^n \rightarrow G$ and thus a pushforward measure {\mu}_w on G from the Haar measure on G^n. We associate to each word w a 2-dimensional cell complex X(w) and…