Related papers: Automorphism Groups of Graphical Models and Lifted…

We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal distributions in a mathematically substantiated way, and to…

Let (S, B) be the log pair associated with a projective completion of a smooth quasi-projective surface V . Under the assumption that the boundary B is irreducible, we obtain an algorithm to factorize any automorphism of V into a sequence…

Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…

Let $\psi$ be a permutation of a finite set $X$. We define $\lambda(\psi)$ to be the largest fraction of elements of $X$ lying on a single cycle of $\psi$. For a finite group $G$, we define $\lambda(G)$ to be the maximum among the values…

While lifting map has significantly enhanced the expressivity of graph neural networks, extending this paradigm to hypergraphs remains fragmented. To address this, we introduce the categorical Weisfeiler-Lehman framework, which formalizes…

In this paper we study random representations of fundamental groups of surfaces into special unitary groups. The random model we use is based on a symplectic form on moduli space due to Atiyah, Bott, and Goldman. Let $\Sigma_{g}$ denote a…

We introduce the notion of a graded group action on a graded algebra or, which is the same, a group action by graded pseudoautomorphisms. An algebra with such an action is a natural generalization of an algebra with a super- or a…

In this article we raise some new questions about positive definite functions on free groups, and explain how these are related to more well-known questions. The article is intended as a survey of known results that also offers some new…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

We develop the orbit method in a quantitative form, along the lines of microlocal analysis, and apply it to the analytic theory of automorphic forms. Our main global application is an asymptotic formula for averages of Gan--Gross--Prasad…

We compute the group of automorphisms of an arbitrary ind-variety of (possibly isotropic) generalized flags. Such an ind-variety is a homogeneous ind-space for one of the ind-groups $SL(\infty)$, $O(\infty)$ or $Sp(\infty)$. We show that…

It is difficult to use subsampling with variational inference in hierarchical models since the number of local latent variables scales with the dataset. Thus, inference in hierarchical models remains a challenge at large scale. It is…

The paper discuss the limit point concept of a subset in a group via ideal of the power set ring. This idea along with anti-ideal give the topological structure in a group. Homomorphic images of both ideal and anti-ideal are played the…

We introduce the notion of rigidity for automorphic representations of groups over global function fields. We construct the Langlands parameters of rigid automorphic representations explicitly as local systems over open curves. We expect…

Let X be a smooth projective hyperelliptic curve over an algeraically closed field k of prime characteristic p. The aim of this note is to find necessary and sufficient conditions on the automorphism group of the curve X to be lifted to…

In this paper, we study group equations with occurrences of automorphisms. We describe equational domains in this class of equations. Moreover, we solve a number of open problem posed in universal algebraic geometry.

The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…

A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…

Let R a be countable ergodic equivalence relation of type II_1 on a standard probability space (X,m). The group Out(R) of outer automorphisms of R consists of all invertible Borel measure preserving maps of the space which map R-classes to…

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…