中文
相关论文

相关论文: Fixed Sets of Automorphisms of Countable, Arithmet…

200 篇论文

We prove several results concerning automorphism groups of quasismooth complex weighted projective hypersurfaces; these generalize and strengthen existing results for hypersurfaces in ordinary projective space. First, we prove in most cases…

代数几何 · 数学 2024-06-11 Louis Esser

Using the technique of quasi difference sets we characterize geometry and automorphisms of configurations which can be presented as a join of some others, in particular - which can be presented as series of cyclically inscribed copies of…

组合数学 · 数学 2012-03-19 Krzysztof Petelczyc , Krzysztof Prażmowski

In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the…

形式语言与自动机理论 · 计算机科学 2017-05-24 Jie-Meng Zhang , Jin Chen , Yingjun Guo , Zhixiong Wen

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

逻辑 · 数学 2021-01-01 Dakota Thor Ihli

We give an accessible and modern description of the automorphisms of a finite abelian group $G$. Included is an explicit formula for the cardinality of $Aut(G)$.

群论 · 数学 2007-05-23 Christopher J. Hillar , Darren Rhea

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

逻辑 · 数学 2007-05-23 Alexander Berenstein , C. Ward Henson

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

逻辑 · 数学 2017-04-17 Joel David Hamkins , Makoto Kikuchi

We work with a finite relational vocabulary with at least one relation symbol with arity at least 2. Fix any integer $m > 1$. For almost all finite structures (labelled or unlabelled) such that at least $m$ elements are moved by some…

逻辑 · 数学 2013-11-19 Vera Koponen

We describe the structure of the algebraic group of automorphisms of all simple finite dimensional Lie superalgebras. Using this and \'etale cohomology considerations, we list all different isomorphism classes of the corresponding twisted…

环与代数 · 数学 2007-05-23 Dimitar Grantcharov , Arturo Pianzola

Consider a smooth connected algebraic group $G$ acting on a normal projective variety $X$ with an open dense orbit. We show that Aut($X$) is a linear algebraic group if so is $G$; for an arbitrary $G$, the group of components of Aut($X$) is…

代数几何 · 数学 2019-11-21 Michel Brion

We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…

动力系统 · 数学 2023-09-13 Robbert Fokkink , Dan Rust , Ville Salo

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

历史与综述 · 数学 2024-07-18 Sergey Kurapov , Maxim Davidovsky

We describe the group of continuous automorphisms of all simple infinite-dimensional linearly compact Lie superalgebras and use it in order to classify F-forms of these superalgebras over any field F of characteristic zero.

量子代数 · 数学 2015-06-26 Nicoletta Cantarini , Victor G. Kac

We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…

组合数学 · 数学 2024-12-04 Elżbieta Krawczyk

The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.

形式语言与自动机理论 · 计算机科学 2015-09-02 Eric Rowland , Jeffrey Shallit

A survey article that presents some recent algebraic and model-theoretic results on the automorphism groups of relatively free groups of infinite rank. The topics include topological aspects, generating sets, descripition of automorpisms…

群论 · 数学 2008-07-29 Vladimir Tolstykh

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

组合数学 · 数学 2010-09-06 Jan Hubicka

We consider automorphism groups of some countably categorical structures and their precompact expansions. We prove that automorphism groups of omega-stable omega-categorical structures have metrizable universal minimal flows. We also study…

逻辑 · 数学 2014-12-23 Aleksander Ivanov

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

逻辑 · 数学 2025-12-03 Jake Masters

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…

综合数学 · 数学 2009-09-29 Linfan Mao , Yanpei Liu , Feng Tian