English
Related papers

Related papers: Towards the Automorphism Conjecture I: Combinatori…

200 papers

The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…

Dynamical Systems · Mathematics 2015-09-30 Van Cyr , Bryna Kra

We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…

Quantum Physics · Physics 2019-07-01 Heinz-Jürgen Schmidt

In this paper we study the existence of at least one non-inner automorphism of order p in a finite normally constrained p-group when p is an odd prime.

Group Theory · Mathematics 2016-10-10 Norberto Gavioli , Leire Legarreta , Marco Ruscitti

We study finite p-groups G of coclass upto 4 for which the group Aut_z(G) of all central automorphisms of G is of minimal possible order. As a consequence, we obtain very short and elementary proofs of main results of Sharma and Gumber [7].

Group Theory · Mathematics 2015-03-17 Deepak Gumber , Hemant Kalra

We construct automorphisms of $\C^n$ which map certain discrete sequences one onto another with prescribed finite jet at each point, thus solving a general Mittag-Leffler interpolation problem for automorphisms. Under certain circumstances,…

Complex Variables · Mathematics 2016-09-06 Gregery T. Buzzard , Franc Forstneric

We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally…

Dynamical Systems · Mathematics 2019-02-20 Volodymyr Nekrashevych

When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…

Combinatorics · Mathematics 2016-08-30 Klavdija Kutnar , Dragan Marusic

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

Combinatorics · Mathematics 2013-08-15 Samuel Connolly , Zachary Gabor , Anant Godbole , Bill Kay

We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…

Group Theory · Mathematics 2014-03-20 Dale Rolfsen

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

Geometric Topology · Mathematics 2015-07-07 Jason Behrstock , Cornelia Drutu

It is shown that certain diffeomorphism or homeomorphism groups with no restriction on support of an open manifold with finite number of ends are bounded. It follows that these groups are uniformly perfect. In order to characterize the…

Differential Geometry · Mathematics 2011-04-20 Tomasz Rybicki

We combine classical methods of combinatorial group theory with the theory of small cancellations over relatively hyperbolic groups to construct finitely generated torsion-free groups that have only finitely many classes of conjugate…

Group Theory · Mathematics 2009-07-07 Ashot Minasyan

For any finitely generated group $G$, two complexity functions $\alpha_G$ and $\beta_G$ are defined to measure the maximal possible gap between the norm of an automorphism (respectively outer automorphism) of $G$ and the norm of its…

Group Theory · Mathematics 2015-02-06 Manuel Ladra , Pedro V. Silva , Enric Ventura

We show that the (topological) full group of a minimal pseudogroup over the Cantor set satisfies various rigidity phenomena of topological dynamical and combinatorial nature. Our main result applies to its possible homomorphisms into other…

Group Theory · Mathematics 2018-12-12 Nicolás Matte Bon

We describe constraints that need to be satisfied ``near the top'' of the portraits of the elements in Grigorchuk group. These constraints, if satisfied by the portraits of all sections of some binary tree automorphism, guarantee that this…

Group Theory · Mathematics 2007-05-23 Goulnara Arzhantseva , Zoran Sunic

It is known that automorphisms of quasi-circular domains fixing the origin are polynomial mappings. By introducing the so-called resonance order and quasi-resonance order, we provide a uniform upper bound for the degree of such polynomial…

Complex Variables · Mathematics 2015-01-28 Feng Rong

We investigate a stronger formulation of Webb's conjecture on the contractibilty of the orbit space of the p-subgroup complexes in terms of finite topological spaces. The original conjecture, which was first proved by Symonds and, more…

Group Theory · Mathematics 2018-05-25 Kevin Ivan Piterman

We study finite subgroups of outer automorphisms of free products. We give upper bounds for the orders of these finite subgroups as well as bounds for the orders of individual torsion outer automorphisms under some (necessary) conditions…

Group Theory · Mathematics 2025-06-23 Ioannis Papavasileiou , Dionysios Syrigos

We consider the {\it infinite Johnson graph} $J_{\infty}$ whose vertex set consists of all subsets $X\subset {\mathbb N}$ satisfying $|X|=|{\mathbb N}\setminus X|=\infty$ and whose edges are pairs of such subsets $X,Y$ satisfying…

Combinatorics · Mathematics 2010-12-27 Mark Pankov