Results 91 to 100 of about 994,076 (215)
Testing Cayley graph densities
Nous presentons une analyse assistee par ordinateur de proprietes combinatoires des graphes de Cayley de certains groupes de type fini : donnes un groupe et un ensemble fini de generateurs, nous etudions la densite du graphe de Cayley correspondant, c ...
G. Arzhantseva +3 more
semanticscholar +1 more source
Connectivity of addition Cayley graphs
For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form.
David J. Grynkiewicz +2 more
openaire +2 more sources
Integral Cayley Graphs and Groups [PDF]
We solve two open problems regarding the classification of certain classes of Cayley graphs with integer eigenvalues. We first classify all finite groups that have a "non-trivial" Cayley graph with integer eigenvalues, thus solving a problem proposed by Abdollahi and Jazaeri.
Azhvan Sheikh Ahmady +2 more
openaire +2 more sources
The Zarankiewicz problem on tripartite graphs
Abstract In 1975, Bollobás, Erdős, and Szemerédi asked for the smallest τ$\tau$ such that an n×n×n$n \times n \times n$ tripartite graph with minimum degree n+τ$n + \tau$ must contain Kt,t,t$K_{t, t, t}$, conjecturing that τ=O(n1/2)$\tau = \mathcal {O}(n^{1/2})$ for t=2$t = 2$.
Francesco Di Braccio +1 more
wiley +1 more source
Perfect state transfer in unitary Cayley graphs over local rings [PDF]
In this work, using eigenvalues and eigenvectors of unitary Cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing PST occurring in its unitary Cayley graph.
Yotsanan Meemark , Songpon Sriwongsa
doaj
AbstractBy a result of L. Lovász, the determination of the spectrum of any graph with transitive automorphism group easily reduces to that of some Cayley graph.We derive an expression for the spectrum of the Cayley graph X(G,H) in terms of irreducible characters of the group G: λti,1+…+λti,ni=∑g1,…,gt∈HXiΠs=1tgs for any natural number t, where ξi is an
openaire +1 more source
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the Foundational Arguments of Sufficient Dimension Reduction
Contemporary Sufficient Dimension Reduction, a versatile method for extracting material information from data, can serve as a preprocessor for classical modeling and inference, or as a standalone theory that leads directly to statistical inference. ABSTRACT Sufficient dimension reduction (SDR) refers to supervised methods of dimension reduction that ...
R. Dennis Cook
wiley +1 more source
Primitivity testing in free group algebras via duality
Abstract Let K$K$ be a field and F$F$ a free group. By a classical result of Cohn and Lewin, the free group algebra KF$K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a well‐defined rank. Given a finitely generated right ideal I⩽KF$I\leqslant K\left[F\right]$ and an element f∈I$f\
Matan Seidel +2 more
wiley +1 more source

