Related papers: Fusions of the generalized Hamming scheme on a str…

We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

In this short note, we prove that there is a well behaved notion of normal hull for smooth algebraic group schemes over a field and that the commutator group $(G,H)$ is well defined for $H\subset G$ smooth, even when both of them are not…

Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2…

In a previous paper, we saw how to create formulae for the sum of the terms of a harmonic progression of order $k$, $HP_k(n)$, with integer parameters, $a$ and $b$. In this new paper we make those formulae more general by lifting the…

If B is C*-algebra of finite dimension n>3 then the finite dimensional irreducible representations of the compact quantum automorphism group of B, say G, have the same fusion rules as the ones of SO(3). As consequences, we get (1) a…

We introduce a parameterized family of invariants for $\ell$-uniform hypergraphs. To each $\mathbb{K}$-linear transformation $T:\mathbb{K}^{\ell}\to \mathbb{K}^r$ we associate a function $\mathrm{Sig}(-,T)$ that maps $\ell$-uniform…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

Motivated by problems arising in the complex analysis of perturbative quantum field theory, we investigate the homology of finite unions of certain non-degenerate quadratic affine hypersurfaces of complex dimension $n$ in general position.…

We develop a general theory of algebraic group superschemes, which are not necessarily affine. Our key result is a category equivalence between those group superschemes and Harish-Chandra pairs, which generalizes the result known for affine…

Given an arrangement of hyperplanes in $\P^n$, possibly with non-normal crossings, we give a vanishing lemma for the cohomology of the sheaf of $q$-forms with logarithmic poles along our arrangement. We give a basis for the ideal $\cal J$…

Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $\Gamma_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two…

The standard convex closed hull of a set is defined as the intersection of all images, under the action of a group of rigid motions, of a half-space containing the given set. In this paper we propose a generalisation of this classical…

It is well known that the mathematical structure underlying renormalization in perturbative quantum field theory is based on a Hopf algebra of Feynman diagrams. A precondition for this is locality of the field theory. Consequently, one…

In this paper, we hope to bring closer graph theory and consensus algorithms. Firstly, we give a brief introduction to graph theory by listing a concise definition. Then we analyze and visualize some commonly used graphs. Secondly, we…

For a fixed graph $H$ and for arbitrarily large host graphs $G$, the number of homomorphisms from $H$ to $G$ and the number of subgraphs isomorphic to $H$ contained in $G$ have been extensively studied in extremal graph theory and graph…

Altanisation (formation of the altan of a parent structure) originated in the chemical literature as a formal device for constructing generalised coronenes from smaller structures. The altan of graph $G$, denoted $\mathfrak{a}(G, H)$,…

We present a graph-regularized learning of Gaussian Mixture Models (GMMs) in distributed settings with heterogeneous and limited local data. The method exploits a provided similarity graph to guide parameter sharing among nodes, avoiding…

Let $G$ be a right-angled Artin group with defining graph $\Gamma$ and let $H$ be a finitely generated group quasi-isometric to $G(\Gamma)$. We show if $G$ satisfies (1) its outer automorphism group is finite; (2) $\Gamma$ does not have…

We extend the notion of a tame covering of a pair (X,D) where X is a regular scheme and D is a normal crossing divisor (cf. SGA1), to pairs (X,Y) where X is an arbitrary scheme and Y is a closed subset in X. We show that the abelianized…