相关论文: Tables of graphs of binary and ternary sequences d…
For a split graph $S$, the combinatorics of 2-switches on $S$ is faithfully encoded by the factor graph $\Phi(S)$, a multigraph whose induced cycles have length at most $4$. In this paper we address the following question: for which $n \in…
Although algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified through ternary operations. In this context, we introduce structures that contain two constants and a…
We conjecture a geometrical form of the Paley-Wiener theorem for the Dunkl transform and prove three instances thereof, one of which involves a limit transition from Opdam's results for the graded Hecke algebra. Furthermore, the connection…
In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…
The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…
We study the behaviour of iterations of the difference operator delta on streams over {0,1}. In particular, we show that a stream sigma is eventually periodic if and only if the sequence of differences sigma, delta(sigma),…
The renormalization group evolution of $\Delta B=2$ transition operators is studied at leading order in heavy quark effective theory and at next-to-leading order in QCD. We calculate new contributions that were not taken into account in…
For a group $G,$ the generating graph of $G,$ denoted by $\Gamma(G).$ We define $Q_n=\langle x,y: x^{2n}=y^4=1, x^n=y^2,y^{-1}xy=x^{-1}\rangle,$ the dicyclic group of order $4n.$ This paper primarily delves into exploring the graph…
The aim of this paper is to study the $q$-Schr\"{o}dinger operator $$ L= q(x)-\Delta_q, $$ where $q(x)$ is a given function of $x$ defined over $\mathbb{R}_{q}^{+}=\{q^n,\quad n\in\mathbb Z\}$ and $\Delta_q$ is the $q$-Laplace operator $$…
We construct two new classes of topological dynamical systems; one is a factor of a one-sided shift of finite type while the second is a factor of the two-sided shift. The data is a finite graph which presents the shift of finite type, a…
In the present paper we compute the Jacobian group of $\Delta$-graph $\Delta(n; k, l, m).$ The notion of $\Delta$-graph continues the list of families of $I$-, $Y$- and $H$-graphs well-known in the graph theory. In particular, graph…
We propose a graph-oriented attention-based explainability method for tabular data. Tasks involving tabular data have been solved mostly using traditional tree-based machine learning models which have the challenges of feature selection and…
V.I. Arnold has recently defined the complexity of finite sequences of zeroes and ones in terms of periods and preperiods of attractors of a dynamic system of the operator of finite differentiation. Arnold has set up a hypothesis that the…
The Djokovi\'{c}-Winkler relation $\Theta$ is a binary relation defined on the edge set of a given graph that is based on the distances of certain vertices and which plays a prominent role in graph theory. In this paper, we explore the…
Let $\mathbb F_q$ be the finite field with $q$ elements and, for each positive integer $n$, let $A_q(n)$ be the number of non isomorphic functional graphs arising from $\mathbb F_q$-linear maps $T:\mathbb F_{q}^n\to \mathbb F_{q}^n$. In…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…
Let $k_r(n,\delta)$ be the minimum number of $r$-cliques in graphs with $n$ vertices and minimum degree $\delta$. We evaluate $k_r(n,\delta)$ for $\delta \leq 4n/5$ and some other cases. Moreover, we give a construction, which we conjecture…
Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…
Fix $t\in [1,\infty]$. Let $S$ be an atomic commutative semigroup and, for all $x\in S$, let $\mathscr{L}_t(S):=\{\|f\|_t:f\in Z(x)\}$ be the "$t$-length set" of $x$ (using the standard $l_p$-space definition of $\|\cdot\|_t$). The…