中文
相关论文

相关论文: A Pansiot-type subword complexity theorem for auto…

200 篇论文

We prove that for a free product $G$ with free factor system $\mathcal{G}$, any automorphism $\phi$ preserving $\mathcal{G}$, atoroidal (in a sense relative to $\mathcal{G}$) and none of whose power send two different conjugates of…

群论 · 数学 2020-08-28 François Dahmani , Ruoyu Li

We call a flag variety admissible if its automorphism group is the projective general linear group. (This holds in most cases.) Let $K$ be a field of characteristic $0$, containing all roots of unity. Let the $K$-variety $X$ be a form of an…

代数几何 · 数学 2019-12-30 Attila Guld

Let $G=F\ast_\varphi t$ be an HNN extension of a free group $F$ with two equal associated normal subgroups $H_1 = H_2$ of finite index. We prove that the word problem in $G$ is decidable in polynomial time. This result extends to the case…

群论 · 数学 2026-02-24 Hanwen Shen , Alexander Ushakov

Using an analogy with the rank theorem in differential geometry, it is shown that for a finite $n$-tuple $X$ in a tracial von Neumann algebra and any finite $m$-tuple $F$ of $*$-polynomials in $n$ noncommuting indeterminates,…

算子代数 · 数学 2016-02-16 Kenley Jung

Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses…

逻辑 · 数学 2022-05-06 Noson S. Yanofsky

In this paper, we provide a new characterization of uniformly recurrent words with finite defect based on a relation between the palindromic and factor complexity. Furthermore, we introduce a class of morphisms P_ret closed under…

组合数学 · 数学 2013-02-05 Lubomíra Balková , Edita Pelantová , Štěpán Starosta

For any subshift, define $F_X(n)$ to be the collection of distinct follower sets of words of length $n$ in $X$. Based on a similar result of the second and third authors, we conjecture that if there exists an $n$ for which $|F_X(n)| \leq…

动力系统 · 数学 2015-09-07 Thomas French , Nic Ormes , Ronnie Pavlov

Let F be an infinitely generated free group and R a fully invariant subgroup of F such that (a) R is contained in the commutator subgroup F' of F and (b) the quotient group F/R is residually torsion-free nilpotent. Then the automorphism…

群论 · 数学 2010-03-26 Vladimir Tolstykh

Let $\overline G$ be the wonderful compactification of a simple affine algebraic group $G$ defined over $\mathbb C$ such that its center is trivial and $G\not= {\rm PSL}(2,\mathbb{C})$. Take a maximal torus $T \subset G$, and denote by…

代数几何 · 数学 2015-07-01 Indranil Biswas , S. Senthamarai Kannan , D. S. Nagaraj

It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…

动力系统 · 数学 2014-01-09 Antoine Julien

For any algebraically closed field $K$ and any endomorphism $f$ of $\mathbb{P}^1(K)$ of degree at least 2, the automorphisms of $f$ are the M\"obius transformations that commute with $f$, and these form a finite subgroup of…

动力系统 · 数学 2022-04-29 Julia Cai , Benjamin Hutz , Leo Mayer , Max Weinreich

We introduce a notion of rectifiability modeled on Carnot groups. Precisely, we say that a subset E of a Carnot group M and N is a subgroup of M, we say E is N-rectifiable if it is the Lipschitz image of a positive measure subset of N.…

经典分析与常微分方程 · 数学 2007-05-23 Scott D. Pauls

Let X be a flexible variety of F be an isomorphism of closed one-dimensional subschemes of $X$. We develop criteria which guarantee that F extends to au automorphism of X.

代数几何 · 数学 2021-04-05 Shulim Kaliman , David Udumyan

In this paper, we investigate the existence of fixed-point-free automorphisms for finite-dimensional Lie algebras. By a result of Jacobson, a Lie algebra admitting a fixed-point-free automorphism is solvable. We prove that such a Lie…

环与代数 · 数学 2026-05-01 Dietrich Burde , Karel Dekimpe

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Libor Barto , Marcin Kozik

The automatic complexity of a finite word (string) is an analogue for finite automata of Sipser's distinguishing complexity (1983) and was introduced by Shallit and Wang (2001). For a finite alphabet $\Sigma$ of at least two elements, we…

形式语言与自动机理论 · 计算机科学 2025-10-10 Joey Chen , Bjørn Kjos-Hanssen , Ivan Koswara , Linus Richter , Frank Stephan

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

综合数学 · 数学 2007-05-23 Aleksandr Golubchik

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

群论 · 数学 2007-05-23 Mark Kambites , Pedro V. Silva , Benjamin Steinberg

Let \Gamma be a geometrically finite tree lattice. We prove a Khintchine-Sullivan type theorem for the Hausdorff measure of the points at infinity of the tree that are well approximated by the parabolic fixed points of G. Using Bruhat-Tits…

群论 · 数学 2007-05-23 Sa'ar Hersonsky , Frederic Paulin

If $G$ is a semisimple Lie group of real rank at least 2 and $\Gamma$ is an irreducible lattice in $G$, then every homomorphism from $\Gamma$ to the outer automorphism group of a finitely generated free group has finite image.

群论 · 数学 2011-04-14 Martin R. Bridson , Richard D. Wade