Related papers: Some Equations Involving the Gamma Function

Let $G$ be a group and $Z(G)$ be its center. We associate a commuting graph ${\Gamma}(G)$, whose vertex set is $G\setminus Z(G)$ and two distinct vertices are adjacent if they commute. We say that ${\Gamma}(G)$ is strong $k$ star free if…

A matching in a hypergraph $H$ is a set of pairwise disjoint hyperedges. The matching number $\alpha'(H)$ of $H$ is the size of a maximum matching in $H$. A subset $D$ of vertices of $H$ is a dominating set of $H$ if for every $v\in…

In this paper we show how some known weak forms of the Zilber--Pink conjecture can be strengthened by combining them with the Mordell--Lang conjecture or its variants. We illustrate this idea by proving some theorems on atypical…

Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points…

Given a conjugacy class $\mathcal{C}$ in a group $G$ we define a new graph, $\Gamma(\mathcal{C})$, whose vertices are elements of $\mathcal{C}$; two vertices $g,h\in \mathcal{C}$ are connected in $\Gamma(\mathcal{C})$ if $[g,h]=1$ and…

Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph $G$, a subset $S\subseteq V(G)$ that can observe all vertices of $G$…

Let $\varphi:\mathbb{R}\rightarrow \mathbb{R}$ be a continuously differentiable function on an interval $J\subset\mathbb{R}$ and let $\boldsymbol{\alpha}=(\alpha_1,\alpha_2)$ be a point with algebraically conjugate coordinates such that the…

In this paper, we present formulas for the edge zeta function and the second weighted zeta function with respect to the group matrix of a finite abelian group $\Gamma $. Furthermore, we give another proof of Dedekind Theorem for the group…

The study of graphs associated with of various algebraic structures is an emerging topic in algebraic graph theory. Recently, the concept of nonzero component graph of a finite dimensional vector space $\Gamma(\mathbb{V})$ was put forward…

Let G be a planar graph such that the volume function of G satisfies V(2n)< CV(n) for some constant C > 0. Then for every vertex v of G and integer n, there is a domain \Omega such that B(v,n) \subset \Omega, \Omega \subset B(v, 6n) and the…

We will show that for $\alpha>0$ there is $n_0$ such that if $G$ is a graph on $n\geq n_0$ vertices such that $\alpha n< \delta(G)< (n-1)/2$, then for every $n_1+n_2+\cdots +n_l= \delta(G)$, $G$ contains a disjoint union of…

In the symmetric group Sym(n) with n at least 5 let H be a conjugacy class of elements of order 2 and let \Gamma be the Cayley graph whose vertex set is the group G generated by H (so G is Sym(n) or Alt(n)) and whose edge set is determined…

Let G:=SO(n,1)^\circ and \Gamma be a geometrically finite Zariski dense subgroup with critical exponent delta bigger than (n-1)/2. Under a spectral gap hypothesis on L^2(\Gamma \ G), which is always satisfied for delta>(n-1)/2 for n=2,3 and…

Let G=PSL(2, F) where F= R or C, and consider the space Z=(\Gamma_1 x \Gamma_2)\ (G x G) where \Gamma_1<G is a co-compact lattice and \Gamma_2<G is a finitely generated discrete Zariski dense subgroup. The work of Benoist-Quint gives a…

Let $R$ be a ring with involution $*$ and $Z^*(R)$ denotes the set of all non-zero zero-divisors of $R$. We associate a simple (undirected) graph $\Gamma'(R)$ with vertex set $Z^*(R)$ and two distinct vertices $x$ and $y$ are adjacent in…

A Deza graph with parameters $(v,k,b,a)$ is a $k$-regular graph on $v$ vertices in which the number of common neighbors of two distinct vertices takes two values $a$ or $b$ ($a\leq b$) and both cases exist. In the previous papers Deza…

Let $X$ be a variety defined over an algebraically closed field $k$ of characteristic $0$, let $N\in\mathbb{N}$, let $g:X\dashrightarrow X$ be a dominant rational self-map, and let $A:\mathbb{A}^N\to \mathbb{A}^N$ be a linear transformation…

Let $G=(V(G),E(G))$ be a simple connected and undirected graph with vertex set $V(G)$ and edge set $E(G)$. A set $S \subseteq V(G)$ is a $dominating$ $set$ if for each $v \in V(G)$ either $v \in S$ or $v$ is adjacent to some $w \in S$. That…

We study a new set of duality relations between weighted, combinatoric invariants of a graph $G$. The dualities arise from a non-linear transform $\mathfrak{B}$, acting on the weight function $p$. We define $\mathfrak{B}$ on a space of…

Let G=SL(n,R) with n>5. We construct examples of lattices Gamma of G, subgroup A of the diagonal group and points x in G/Gamma such that the closure of the orbit Ax is not homogeneous but does not factors through the action of a…