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

In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…

Statistical Topology emerged since topological aspects continue to gain importance in many areas of physics. It is most desirable to study topological invariants and their statistics in schematic models that facilitate the identification of…

Using the description of multiline queues as functions on words, we introduce the notion of a spectral weight of a word by defining a new weighting on multiline queues. We show that the spectral weight of a word is invariant under a natural…

A commutative ring $R$ is stable if every non-zero ideal $I$ of $R$ is projective over its ring of endomorphisms. Motivated by a paper of Bass in the 1960s, stable rings have received wide attention in the literature ever since then. Much…

The main theorem describes the behaviour of the stable cohomotopy invariant defined in the first article (joint with M. Furuta) in this series of two under the operation of taking connected sums of four-manifolds: The invariant of a…

We consider the role of the Kervaire--Milnor invariant in the classification of closed, connected, spin 4-manifolds, typically denoted by $M$, up to stabilisation by connected sums with copies of $S^2 \times S^2$. This stable classification…

We give a simple axiomatic definition of a rational-valued invariant s(W,V,e) of triples (W,V,e), where W is a (smooth, oriented, closed) 6-manifold and V is a 3-submanifold of W, and where e is a second rational cohomology class of the…

We study the numerical stability of the Sherman-Morrison-Woodbury (SMW) identity. Let $B = A + UV^T$ and assume $U$ and $V$ both have full-column rank. We explore error bounds for the SMW identity when we are only able to compute…

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$…

Word complexity is defined in a number of different ways. Psycholinguistic, morphological and lexical proxies are often used. Human ratings are also used. The problem here is that these proxies do not measure complexity directly, and human…

In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…

The Linguistic Matrix Theory programme introduced by Kartsaklis, Ramgoolam and Sadrzadeh is an approach to the statistics of matrices that are generated in type-driven distributional semantics, based on permutation invariant polynomial…

Spectral invariants are quantitative measurements in symplectic topology coming from Floer homology theory. We study their dependence on the choice of coefficients in the context of Hamiltonian Floer homology. We discover phenomena in this…

Word embeddings are computed by a class of techniques within natural language processing (NLP), that create continuous vector representations of words in a language from a large text corpus. The stochastic nature of the training process of…

We consider solutions of the word equation $X_1^2 \dotsm X_n^2 = (X_1 \dotsm X_n)^2$ such that the squares $X_i^2$ are minimal squares found in optimal squareful infinite words. We apply a method developed by the second author for studying…

Given a group word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. In the present paper we consider profinite groups admitting a word $w$ such that the…

For a unital ring $S$, an $S$-linear quasigroup is a unital $S$-module, with automorphisms $\rho$ and $\lambda$ giving a (nonassociative) multiplication $x\cdot y=x^\rho+y^\lambda$. If $S$ is the field of complex numbers, then ordinary…

Fix a probability $p\in(0,1)$. Let $s_i$ denote the transposition in the symmetric group $\mathfrak{S}_n$ that swaps $i$ and $i+1$. Given a word $\mathsf{w}$ over the alphabet $\{s_1,\ldots,s_{n-1}\}$, we can generate a random subword by…

We compute analytically the joint probability density of eigenvalues and the level spacing statistics for an ensemble of random matrices with interesting features. It is invariant under the standard symmetry groups (orthogonal and unitary)…

Given a group-word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. The word $w$ is concise if $w(G)$ is finite for all groups $G$ in which $G_w$ is finite.…