Related papers: Groups, graphs, and hypergraphs: average sizes of …

Current graph neural networks (GNNs) lack generalizability with respect to scales (graph sizes, graph diameters, edge weights, etc..) when solving many graph analysis problems. Taking the perspective of synthesizing graph theory programs,…

Suppose that $x$, $y$ are elements of a finite group $G$ lying in conjugacy classes of coprime sizes. We prove that $\langle x^G \rangle \cap \langle y^G \rangle$ is an abelian normal subgroup of $G$ and, as a consequence, that if $x$ and…

We develop a theory of graph algebras over general fields. This is modeled after the theory developed by Freedman, Lov\'asz and Schrijver in [22] for connection matrices, in the study of graph homomorphism functions over real edge weight…

Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…

Let $\Gamma$ be a simple finite graph with vertex set $V(\Gamma)$ and edge set $E(\Gamma)$. Let $\mathcal{R}$ be an equivalence relation on $V(\Gamma)$. The $\mathcal{R}$-super $\Gamma$ graph $\Gamma^{\mathcal{R}}$ is a simple graph with…

Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…

For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that…

We explore connections between the generalized multiplicities of square-free monomial ideals and the combinatorial structure of the underlying hypergraphs using methods of commutative algebra and polyhedral geometry. For instance, we show…

In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

Fixing an arithmetic lattice $\Gamma$ in an algebraic group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ with $[\Gamma : \Gamma \cap \Delta] [\Delta: \Gamma \cap \Delta] =…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

We provide uniform convergence rates for kernel averages on $[0,1]$ under equally-spaced fixed design points of the form $x_{t,T}=t/T,\ t\in\{1,\dotsc, T\},\ T\in\mathbb{N}$. The rates of weak and strong uniform consistency are derived…

It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…

We study widths of conjugacy classes in anisotropic higher rank $S$-arithmetic groups of orthogonal type. Assuming the GRH, we prove that many such groups have bounded conjugacy width. For example, this holds if the degree is greater or…

A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general…

Let $G$ be the symmetric group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…