Zobrazeno 1 - 10
of 1 773
pro vyhledávání: '"Razafimahatratra A"'
Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class association schemes
Externí odkaz:
http://arxiv.org/abs/2411.08803
Let $p$ be a prime and $q = p^k$. A subset $\mathcal{F} \subset \operatorname{\Gamma L}_{2}(q)$ is intersecting if any two semilinear transformations in $\mathcal{F}$ agree on some non-zero vector in $\mathbb{F}_q^2$. We show that any intersecting se
Externí odkaz:
http://arxiv.org/abs/2402.17687
The \emph{intersection density} of a finite transitive group $G\leq \operatorname{Sym}(\Omega)$ is the rational number $\rho(G)$ given by the ratio between the maximum size of a subset of $G$ in which any two permutations agree on some elements of $\
Externí odkaz:
http://arxiv.org/abs/2309.09906
Given the symmetric group $G = \operatorname{Sym}(n)$ and a multiplicity-free subgroup $H\leq G$, the orbitals of the action of $G$ on $G/H$ by left multiplication induce a commutative association scheme. The irreducible constituents of the permutati
Externí odkaz:
http://arxiv.org/abs/2307.02844
Given a group $G$ and a subgroup $H \leq G$, a set $\mathcal{F}\subset G$ is called $H$\emph{-intersecting} if for any $g,g' \in \mathcal{F}$, there exists $xH \in G/H$ such that $gxH=g'xH$. The \emph{intersection density} of the action of $G$ on $G/
Externí odkaz:
http://arxiv.org/abs/2306.07851
Autor:
Fallat, Shaun, Joshi, Neha, Maleki, Roghayeh, Meagher, Karen, Mojallal, Seyed Ahmad, Nasserasr, Shahla, Shirazi, Mahsa N., Razafimahatratra, Andriaherimanana Sarobidy, Stevens, Brett
Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at minimal cost. Originally this game was conceived as a one player game, but later a two-player version was devised in-conjuncti
Externí odkaz:
http://arxiv.org/abs/2306.01138
Given a graph $X$ with a Hamilton cycle $C$, the {\em compression factor $\kappa(X,C)$ of $C$} is the order of the largest cyclic subgroup of $\operatorname{Aut}(C)\cap\operatorname{Aut}(X)$, and the {\em Hamilton compression $\kappa(X)$ of $X$ } is
Externí odkaz:
http://arxiv.org/abs/2305.09465
Autor:
Fernández, Blas, Maleki, Roghayeh, Miklavič, Štefko, Razafimahatratra, Andriaherimanana Sarobidy
Let $\Gamma=(V,E)$ be a graph of order $n$. A {\em closed distance magic labeling} of $\Gamma$ is a bijection $\ell : V \to \{1,2, \ldots, n\}$ for which there exists a positive integer $r$ such that $\sum_{x \in N[u]} \ell(x) = r$ for all vertices $
Externí odkaz:
http://arxiv.org/abs/2212.12441
A subset $\mathcal{F}$ of a finite transitive group $G\leq \operatorname{Sym}(\Omega)$ is \emph{intersecting} if any two elements of $\mathcal{F}$ agree on an element of $\Omega$. The \emph{intersection density} of $G$ is the number $$\rho(G) = \max\
Externí odkaz:
http://arxiv.org/abs/2207.07762
Autor:
Polhemus, Dan A.
Publikováno v:
Journal of the New York Entomological Society, 1994 Apr 01. 102(2), 274-275.
Externí odkaz:
https://www.jstor.org/stable/25010083
