中文
相关论文

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

200 篇论文

A group word $w$ is said to be strongly concise in a class $\mathcal{C}$ of profinite groups if, for every group $G$ in $\mathcal{C}$ such that $w$ takes less than $2^{\aleph_0}$ values in $G$, the verbal subgroup $w(G)$ is finite. Detomi,…

群论 · 数学 2020-05-27 Eloisa Detomi , Benjamin Klopsch , Pavel Shumyatsky

This paper has two parts, on Baumslag-Solitar groups and on general G-trees. In the first part we establish bounds for stable commutator length (scl) in Baumslag-Solitar groups. For a certain class of elements, we further show that scl is…

群论 · 数学 2020-06-04 Matt Clay , Max Forester , Joel Louwsma

We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…

表示论 · 数学 2015-06-17 Steven V Sam , Andrew Snowden

This paper reviews some results regarding symbolic dynamics, correspondence between languages of dynamical systems and combinatorics. Sturmian sequences provide a pattern for investigation of one-dimensional systems, in particular interval…

动力系统 · 数学 2017-12-01 A. Ya. Belov , G. V. Kondakov , I. Mitrofanov

We prove that a Morse-Smale gradient-like flow on a closed manifold has a "system of compatible invariant stable foliations" that is analogous to the object introduced by Palis and Smale in their proof of the structural stability of…

动力系统 · 数学 2020-07-09 Alberto Abbondandolo , Pietro Majer

Given an infinite word ${\bf w}$ on a finite alphabet, an immediate question arises:~can we understand the frequency of letters in ${\bf w}$\,? For words that are the fixed points of substitutions, the answer to this question is often `yes'…

组合数学 · 数学 2024-10-17 Michael Coons , Christopher Ramsey , Nicolae Strungaru

We introduce the task of out-of-order membership to a formal language L, where the letters of a word w are revealed one by one in an adversarial order. The length |w| is known in advance, but the content of w is streamed as pairs (i, w[i]),…

形式语言与自动机理论 · 计算机科学 2026-05-11 Antoine Amarilli , Sebastien Labbe , Charles Paperman

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…

群论 · 数学 2019-09-11 Michael Larsen , Aner Shalev , Pham Huu Tiep

We introduce a new class of large structured random matrices characterized by four fundamental properties which we discuss. We prove that this class is stable under matrix-valued and pointwise non-linear operations. We then formulate an…

概率论 · 数学 2025-06-09 Denis Bernard , Ludwig Hruza

A pseudo-primitive word with respect to an antimorphic involution \theta is a word which cannot be written as a catenation of occurrences of a strictly shorter word t and \theta(t). Properties of pseudo-primitive words are investigated in…

计算复杂性 · 计算机科学 2010-02-23 Lila Kari , Benoît Masson , Shinnosuke Seki

We define a new topological invariant of line arrangements in the complex projective plane. This invariant is a root of unity defined under some combinatorial restrictions for arrangements endowed with some special torsion character on the…

几何拓扑 · 数学 2018-05-04 Enrique Artal Bartolo , Vincent Florens , Benoît Guerville-BallÉ

We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo sampling. The algorithm samples from a stretched Boltzmann…

群论 · 数学 2013-12-23 M. Elder , A. Rechnitzer , E. J. Janse van Rensburg

We study singularity properties of word maps on semisimple algebraic groups and Lie algebras, generalizing the work of Aizenbud-Avni in the case of the commutator map. Given a word $w$ in a free Lie algebra $\mathcal{L}_{r}$, it induces a…

代数几何 · 数学 2020-08-07 Itay Glazer , Yotam I. Hendel

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…

群论 · 数学 2014-06-30 Robert Guralnick , Pavel Shumyatsky

Suppose that W is a finite, unitary, reflection group acting on the complex vector space V and X is a subspace of V. Define N to be the setwise stabilizer of X in W, Z to be the pointwise stabilizer, and C=N/Z. Then restriction defines a…

表示论 · 数学 2012-03-01 J. Matthew Douglass , Gerhard Roehrle

In this paper, we focus on the problem of existence and computing of small and large stable models. We show that for every fixed integer k, there is a linear-time algorithm to decide the problem LSM (large stable models problem): does a…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Miroslaw Truszczynski

For a fixed element $g\in SL(2,C)$ and a word $w=[x^n,y^m]$ we consider the automorphism group $Aut(S_{g})$ of the affine threefold $S_{g}=\{(x,y)\in SL(2,C)^2 \ | w(x,y)=g\}.$ We prove that Makar-Limanov invariant…

代数几何 · 数学 2026-01-06 Tatiana Bandman

Since the 1970's, physicists and mathematicians who study random matrices in the GUE or GOE models are aware of intriguing connections between integrals of such random matrices and enumeration of graphs on surfaces. We establish a new…

几何拓扑 · 数学 2020-07-30 Michael Magee , Doron Puder

We define the notion of stochastic stability, already present in the literature in the context of smooth dynamical systems, for invariant measures of cellular automata perturbed by a random noise, and the notion of strongly stochastically…

概率论 · 数学 2024-04-01 Hugo Marsan , Mathieu Sablik

Let $w$ be a group-word. Suppose that the set of all $w$-values in a profinite group $G$ is contained in a union of countably many subgroups. It is natural to ask in what way the structure of the verbal subgroup $w(G)$ depends on the…

群论 · 数学 2015-11-25 Cristina Acciarri , Pavel Shumyatsky