Related papers: Automorphism Groups of Graphical Models and Lifted…
We reformulate the statement of the Feit-Thompson theorem in terms of diagrams in the category of finite groups, namely iterations of the Quillen lifting property with respect to particular morphisms.
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…
A near permutation of a set is a bijection between two cofinite subsets, modulo coincidence on smaller cofinite subsets. Near permutations of a set form its near symmetric group. In this monograph, we define near actions as homomorphisms…
Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge…
We consider the size and structure of the automorphism groups of a variety of empirical `real-world' networks and find that, in contrast to classical random graph models, many real-world networks are richly symmetric. We relate automorphism…
Selective inference methods are developed for group lasso estimators for use with a wide class of distributions and loss functions. The method includes the use of exponential family distributions, as well as quasi-likelihood modeling for…
In this paper, we consider the probability that a randomly chosen automorphism of a finite group fixes a randomly chosen element of a subgroup of that group. We obtain several new results as well as generalizations and improvements of some…
How can agents learn internal models that veridically represent interactions with the real world is a largely open question. As machine learning is moving towards representations containing not just observational but also interventional…
Self equivalences of classifying spaces of $p$-local compact groups are well understood by means of the algebraic structure that gives rise to them, but explicit descriptions are lacking. In this paper we use a construction of Robinson of…
We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.
We develop a theory of additive group actions on affine ind-schemes through a purely algebraic and topological framework. Affine ind-schemes are described via complete, second-countable, linearly topologized rings, and actions of the…
We construct p.m.p. group actions that are not local-global limits of sequences of finite graphs. Moreover, they do not weakly contain any sequence of finite labeled graphs. Our methods are based on the study of almost automorphisms of…
In this paper, we present a functorial method to define ramification groups, identifying them as inertia groups of an induced action on composite jet algebras. This framework lays the foundation for defining higher ramification groups for…
We consider the problem of state estimation in general state-space models using variational inference. For a generic variational family defined using the same backward decomposition as the actual joint smoothing distribution, we establish…
For any code loop $L$, we prove that the half-automorphism group of $L$ is the product of the automorphism group of $L$ by an elementary abelian $2-$group consisting of all half-automorphisms that acts as the identity on a fixed basis.…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
Flip graphs are graphs on combinatorial objects in which the adjacency relation reflects a local change in the underlying objects. In this thesis we introduce Yoke graphs, a family of flip graphs that generalizes previously studied families…
The concept of an adapted homology basis for a prime order conformal automorphism of a compact Riemann surface extends to arbitrary finite groups of conformal automorphisms. Here we compute some examples of adapted homology bases for some…
For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…