Results 171 to 180 of about 6,246 (257)
The N‐prime graph and the Subgroup Isomorphism Problem
Abstract We introduce a directed graph related to a group G$G$, which we call the N‐prime graph ΓN(G)$\Gamma _{\rm {N}}(G)$ of G$G$ and is a refinement of the classical Gruenberg–Kegel graph. The vertices of ΓN(G)$\Gamma _{\rm {N}}(G)$ are the primes p$p$ such that G$G$ has an element of order p$p$, and, for distinct vertices p$p$ and q$q$, the arc q→p$
Emanuele Pacifici +2 more
wiley +1 more source
Understanding Graph Isomorphism Network for rs-fMRI Functional Connectivity Analysis. [PDF]
Kim BH, Ye JC.
europepmc +1 more source
On the Quot scheme QuotSl(E)$\mathrm{Quot}^{l}_{\mathrm{S}}(\mathcal {E})$
Abstract We study the geometry of the Quot scheme QuotSl(E)$\operatorname{Quot}^{l}_{\mathrm{S}}(\mathcal {E})$ of length l$l$ coherent sheaf quotients of a locally free sheaf E$\mathcal {E}$ on a smooth projective surface S$\mathrm{S}$. In particular, we investigate the nature of its singularities, its intersection theory, and the cohomology of ...
Samuel Stark
wiley +1 more source
GRAPH SPECTRA AND ISOMORPHISM TESTING
The graph isomorphism problem has been heavily researched in the last decade. Recently, approaches from topology and group theory have resulted polynomial time isomorphism tests for graphs of bounded genus and graphs of bounded valence. In this thesis we
MOUNT, DAVID MARK
core
Generalized free wreath products and their operator algebras
Abstract We develop a new approach on free wreath products, generalizing the constructions of Bichon and of Fima‐Pittau. We show stability properties for certain approximation properties such as exactness, Haagerup property, hyperlinearity, and K‐amenability. We study qualitative properties of the associated von Neumann algebra: factoriality, primeness,
Pierre Fima, Arthur Troupel
wiley +1 more source
Distributed Graph Isomorphism using Quantum Walks
Graph isomorphism being an NP problem, most of the systems that solves the graph isomorphism are constrained with some classes of the graph, and do not work for all types of graphs in polynomial time.
, Jayaprabha Yadav, Prof. Mrs. Aparna Junnarkar
core +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
Independence and strong independence complexes of finite groups
Abstract Let G$G$ be a finite group. In [10], two different concepts of independence (namely, independence and strong independence) are introduced for the subsets of G$G$, yielding to the definition of two simplicial complexes whose vertices are the elements of G$G$. The strong independence complex Σ∼(G)$\tilde{\Sigma }(G)$ turns out to be a subcomplex
Andrea Lucchini, Mima Stanojkovski
wiley +1 more source
Computational Complexity and Graph Isomorphism [PDF]
The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic, that is, structurally the same. The complexity of graph isomorphism is an open problem and it is one of the few problems in NP which is ...
Laulumaa, Joonas
core
Motivic mirror symmetry and χ$\chi$‐independence for Higgs bundles in arbitrary characteristic
Abstract We prove that the (twisted orbifold) motives of the moduli spaces of SLn$\mathrm{SL}_n$ and PGLn$\mathrm{PGL}_n$‐Higgs bundles of coprime rank and degree on a smooth projective curve over an algebraically closed field in which the rank is invertible are isomorphic in Voevodsky's triangulated category of motives.
Victoria Hoskins, Simon Pepin Lehalleur
wiley +1 more source

