Related papers: Local recognition of reflection graphs on Coxeter …

Let $C(T)$ be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either $B_n$ or $D_n$. Let $C_Y(T)$ be a natural quotient of $C(T)$, and if $C(T)$ is simply-laced (which means all the relations…

For an arbitrary non-archimedean local field we classify reductive group schemes over the corresponding Fargues-Fontaine curve by group schemes over the category of isocrystals. We then classify torsors under such reductive group schemes by…

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…

A traditional wavelet is a special case of a vector in a separable Hilbert space that generates a basis under the action of a system of unitary operators defined in terms of translation and dilation operations. A Coxeter/fractal-surface…

We provide a complete description of the presentations of the interval groups related to quasi-Coxeter elements in finite Coxeter groups. In the simply laced cases, we show that each interval group is the quotient of the Artin group…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…

Despite the significance of the notion of parabolic closures in Coxeter groups of finite ranks, the parabolic closure is not guaranteed to exist as a parabolic subgroup in a general case. In this paper, first we give a concrete example to…

Complex reflection groups comprise a generalization of Weyl groups of semisimple Lie algebras, and even more generally of finite Coxeter groups. They have been heavily studied since their introduction and complete classification in the…

Graph clustering is a fundamental problem in unsupervised learning, with numerous applications in computer science and in analysing real-world data. In many real-world applications, we find that the clusters have a significant high-level…

In this paper we classify reflection subgroups of Euclidean Coxeter groups.

In this paper we study CAT(0) groups and their splittings as graphs of groups. For one-ended CAT(0) groups with isolated flats we prove a theorem characterizing exactly when the visual boundary is locally connected. This characterization…

Unique affine extensions $H^{\aff}_2$, $H^{\aff}_3$ and $H^{\aff}_4$ are determined for the noncrystallographic Coxeter groups $H_2$, $H_3$ and $H_4$. They are used for the construction of new mathematical models for quasicrystal fragments…

If a complex $X$ is a subcomplex of a diagrammatically reducible 2-complex $Y$ that has locally indicable fundamental group, then $X$ has locally indicable fundamental group. This is a consequence of the Corson-Trace characterization of…

Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous…

We give the monodromy representations of local systems of twisted homology groups associated with Lauricella's system $F_D(a,b,c)$ of hypergeometric differential equations under mild conditions on parameters. Our representation is effective…

It is well-known that a simple $G$-arc-transitive graph can be represented as a coset graph for the group $G$. This representation is extended to a construction of $G$-arc-transitive coset graphs $\Cos(G,H,J)$ with finite valency and finite…

In this paper we investigate locally compact semitopological graph inverse semigroups. Our main result is the following: if a directed graph $E$ is strongly connected and contains a finite amount of vertices then a locally compact…

Graphs which generalize the simple or affine Dynkin diagrams are introduced. Each diagram defines a bilinear form on a root system and thus a reflection group. We present some properties of these groups and of their natural "Coxeter…

The challenge in few-shot learning is that available data is not enough to capture the underlying distribution. To mitigate this, two emerging directions are (a) using local image representations, essentially multiplying the amount of data…