相关论文: Automorphism Properties of Adinkras

The inner automorphisms of a group G can be characterized within the category of groups without reference to group elements: they are precisely those automorphisms of G that can be extended, in a functorial manner, to all groups H given…

We give examples of endperiodic automorphisms.

We prove that the displacement group of the dihedral quandle with n elements is isomorphic to the group generated by rotations of the n/2-gon when n is even and the n-gon when n is odd. We additionally show that any quandle with at least…

We propose a learning paradigm for numerical approximation of differential invariants of planar curves. Deep neural-networks' (DNNs) universal approximation properties are utilized to estimate geometric measures. The proposed framework is…

We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…

We compute the automorphism groups of finite and cofinite ind-grassmannians, as well as of the ind-variety of maximal flags indexed by Z_{>0}. We pay special attention to differences with the case of ordinary flag varieties.

We study a new class of infinite dimensional Lie algebras, which has important applications to the theory of integrable equations. The construction of these algebras is very similar to the one for automorphic functions and this motivates…

We study finite groups that occur as combinatorial automorphism groups or geometric symmetry groups of convex polytopes. When $\Gamma$ is a subgroup of the combinatorial automorphism group of a convex $d$-polytope, $d\geq 3$, then there…

Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…

An invariant theoretic characterization of subdiscriminants of matrices is given. The structure as a module over the special orthogonal group of the minimal degree non-zero homogeneous component of the vanishing ideal of the variety of real…

In this paper we describe graded automorphisms and antiautomorphisms of finite order on matrix algebras endowed with a group gradings by a finite abelian group over an arbitrary algebraically closed field of charcteristic different from 2.

Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…

This work is devoted to the study of the symmetries of (quasi)periodic architectured materials. For this purpose, the weaker symmetry criterion of indistinguishability is used. It relies on a statistical description of the mesostructure and…

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…

Automatic detecting anomalous regions in images of objects or textures without priors of the anomalies is challenging, especially when the anomalies appear in very small areas of the images, making difficult-to-detect visual variations,…

Let $I(X,R)$ be the incidence algebra of the preordered set $X$ over the ring $R$. In the case of a finite connected partially ordered set $X$, we prove that the subgroup of inner multiplicative automorphisms is a direct factor of the group…

Detecting structure in data is the first step to arrive at meaningful representations for systems. This is particularly challenging for dislocation networks evolving as a consequence of plastic deformation of crystalline systems. Our study…

We prove that, except in certain low-complexity cases, the automorphism group of the graph of pants decompositions of a nonorientable surface is isomorphic to the mapping class group of that surface.

We propose AD3, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs based on the alternating directions method of multipliers. Like dual decomposition algorithms, AD3 uses worker nodes to iteratively solve…

In this article, we are concerned with various aspects of arcs on surfaces. In the first part, we deal with topological aspects of arcs and their complements. We use this understanding, in the second part, to construct interesting actions…