English
Related papers

Related papers: The application of representation theory in direct…

200 papers

In this paper we shall be looking at several results relating Schur rings to sufficient conditions for a graph to be a graphical regular representation (GRR) of a finite group, and then applying these specifically in the case of certain…

Combinatorics · Mathematics 2024-01-09 Josef Lauri , Jonathan Ebejer

In a series of publications we developed "differential geometry" on discrete sets based on concepts of noncommutative geometry. In particular, it turned out that first order differential calculi (over the algebra of functions) on a discrete…

Mathematical Physics · Physics 2009-11-07 Aristophanes Dimakis , Folkert Muller-Hoissen

In his $1994$ survey, Kleinert defined formally and formulated the problem to obtain unit theorems for unit groups of orders in a semisimple algebra $A$. If $A$ is a group algebra $FG$, it boils down to classifying all finite groups $G$…

Group Theory · Mathematics 2025-10-22 Geoffrey Janssens

In this paper, we continue investigation of the directed and undirected irreducible divisor graph concepts $G(x)$ and $\Gamma (x)$ of $x\in D^{\ast} \backslash U(D)$, respectively, which were introduced in [7]. Consequently, we introduce…

Rings and Algebras · Mathematics 2024-04-09 A. Naser , R. E. Abdel-Khalek , R. M. Salem , A. M. Hassanein

The graphical notion of effective resistance has found wide-ranging applications in many areas of pure mathematics, applied mathematics and control theory. By the nature of its construction, effective resistance can only be computed in…

Optimization and Control · Mathematics 2013-10-23 George Forrest Young , Luca Scardovi , Naomi Ehrich Leonard

Let $G$ be a generalized dicyclic group with identity $1$. An inverse closed subset $S$ of $G\setminus\{1\}$ is called minimal if $\langle S\rangle=G$ and there exists some $s\in S$ such that $\langle S\setminus\{s,s^{-1}\} \rangle\neq G$.…

Combinatorics · Mathematics 2022-05-11 Xueyi Huang , Kinkar Chandra Das

A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on $n$ vertices with minimum out-degree and in-degree at least $n/2$ contains a directed Hamilton cycle. In this paper we extend this theorem to a random…

Combinatorics · Mathematics 2014-04-21 Dan Hefetz , Angelika Steger , Benny Sudakov

In this paper, we investigate the complexity of an infinite family of Cayley graphs $\mathcal{D}_{n}=Cay(\mathbb{D}_{n}, b^{\pm\beta_1},b^{\pm\beta_2},\ldots,b^{\pm\beta_s}, a b^{\gamma_1}, a b^{\gamma_2},\ldots, a b^{\gamma_t} )$ on the…

Combinatorics · Mathematics 2023-12-29 Bobo Hua , Alexander Mednykh , Ilya Mednykh , Lili Wang

A Cayley graph $\Ga=\Cay(G,S)$ is said to be normal if the right-regular representation of $G$ is normal in $\Aut\Ga$. In this paper, we investigate the normality problem of the connected 13-valent symmetric Cayley graphs $\Ga$ of finite…

Combinatorics · Mathematics 2024-12-25 Bengong Lou , Zheng Zuo , Bo Ling

Let $R$ be a commutative ring and let $U(R)$ be multiplicative group of unit elements of $R$. In 2012, Khashyarmanesh et al. defined generalized unit and unitary Cayley graph, $\Gamma(R, G, S)$, corresponding to a multiplicative subgroup…

Commutative Algebra · Mathematics 2022-07-19 Mahdi Reza Khorsandi , Seyed Reza Musawi

This article surveys the variety of ways in which a directed acyclic graph (DAG) can be used to represent a problem of probabilistic causality. For each of these we describe the relevant formal or informal semantics governing that…

Statistics Theory · Mathematics 2024-02-16 Philip Dawid

A finite group $G$ is a "non-DCI group" if there exist subsets $S_1$ and $S_2$ of $G$, such that the associated Cayley digraphs $C\overrightarrow{ay}(G;S_1)$ and $C\overrightarrow{ay}(G;S_2)$ are isomorphic, but no automorphism of $G$…

Combinatorics · Mathematics 2023-03-08 Dave Witte Morris , Joy Morris

Directed acyclic graphs (DAGs) can be characterised as directed graphs whose strongly connected components are isolated vertices. Using this restriction on the strong components, we discover that when $m = cn$, where $m$ is the number of…

Combinatorics · Mathematics 2020-04-21 Élie de Panafieu , Sergey Dovgal

This paper explores Iwasawa theory from a graph theoretic perspective, focusing on the algebraic and combinatorial properties of Cayley graphs. Using representation theory, we analyze Iwasawa-theoretic invariants within…

Number Theory · Mathematics 2024-12-04 Sohan Ghosh , Anwesh Ray

The unitary Cayley graph of $\mathbb{Z} /n \mathbb{Z}$, denoted $X_{\mathbb{Z} / n \mathbb{Z}}$, has vertices $0,1, \dots, n-1$ with $x$ adjacent to $y$ if $x-y$ is relatively prime to $n$. We present results on the tightness of the known…

Combinatorics · Mathematics 2018-06-29 Colin Defant , Sumun Iyer

The unitary Cayley graph of $\mathbb{Z}/n\mathbb{Z}$, denoted $X_n$, is the graph on $\{0,\dots,n-1\}$ where vertices $a$ and $b$ are adjacent if and only if $\gcd(a-b,n) = 1$. We answer a question of Defant and Iyer by constructing a…

Combinatorics · Mathematics 2018-12-27 Amanda Burcroff

A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.

Combinatorics · Mathematics 2007-05-23 Vladimir Nikiforov

We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…

Algebraic Topology · Mathematics 2024-04-02 Shaobo Di , Sergei O. Ivanov , Lev Mukoseev , Mengmeng Zhang

We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…

Group Theory · Mathematics 2016-10-31 Amrita Acharyya , Jon M. Corson , Bikash Das

If $X$ is a commutative ring with unity, then the unitary Cayley graph of $X$, denoted $G_X$, is defined to be the graph whose vertex set is $X$ and whose edge set is $\{\{a,b\}\colon a-b\in X^\times\}$. When $R$ is a Dedekind domain and…

Combinatorics · Mathematics 2017-03-28 Colin Defant
‹ Prev 1 4 5 6 7 8 10 Next ›