Results 31 to 40 of about 142,721 (259)
Isomorphism Classes of Concrete Graph Coverings
SIAM Journal on Discrete Mathematics, 1998 \textit{M. Hofmeister} introduced the notion of a concrete (resp., concrete regular) covering of a graph \(G\) and gave formulas for enumerating the isomorphism classes of concrete (resp., concrete regular) coverings of \(G\) with respect to a group of automorphisms of a given base graph; see Ars Comb.
Feng, RQ, Kwak, JH, Kim, J, Lee, J
openaire +2 more sources
Angewandte Chemie, EarlyView.Titanium silicalite‐1 (TS‐1), used in industrial selective oxidation processes, depends on specific, yet still unresolved Ti sites, dispersed within the framework of an MFI‐zeolite. Applying high field (28.2 T) 47/49Ti NMR and 17O NMR spectroscopy for an array of TS‐1 catalysts enables the development of an NMR crystallography protocol and the ...
Christoph J. Kaul +14 more
wiley +2 more sources
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability [PDF]
QuantumMančinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al.
Prem Nigam Kar +3 more
doaj +1 more source
On the number of isomorphism classes of transversals [PDF]
Proceedings - Mathematical Sciences, 2013 In this paper we prove that there does not exist a subgroup $H$ of a finite group $G$ such that the number of isomorphism classes of normalized right transversals of $H$ in $G$ is four.
Kakkar, Vipul, Shukla, R. P.
openaire +3 more sources
Étude des $(n+1)$-tissus de courbes en dimension $n$
Comptes Rendus. Mathématique, 2023 For $(n+1)$-webs by curves in an ambiant $n$-dimensional manifold, we first define a generalization of the well known Blaschke curvature of the dimension two, which vanishes iff the web has the maximum possible rank which is one.
Dufour, Jean-Paul, Lehmann, Daniel
doaj +1 more source
Isomorphism test for digraphs with weighted edges [PDF]
, 2018 Colour refinement is at the heart of all the most efficient graph isomorphism software packages. In this paper we present a method for extending the applicability of refinement algorithms to directed graphs with weighted edges.
Piperno, Adolfo
core +2 more sources
Isomorphism Classes of Uniform Groups
Rocky Mountain Journal of Mathematics, 2002 This paper concerns finite rank torsion-free Abelian groups which are extensions of a rigid completely decomposable group by a homocyclic \(p\)-group. The main results are a classification up to near isomorphism, and a count of the number of isomorphism classes in a given near isomorphism class.
openaire +2 more sources
On wild extensions of a p-adic field
, 2016 In this paper we consider the problem of classifying the isomorphism classes of extensions of degree pk of a p-adic field, restricting to the case of extensions without intermediate fields. We establish a correspondence between the isomorphism classes of
Del Corso, I., Dvornicich, R., Monge, M.
core +1 more source
Genericity of chaos for colored graphs
Topological Algebra and its Applications, 2021 To each colored graph one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift.
Lijó Ramón Barral, Nozawa Hiraku
doaj +1 more source
Geometry of Deligne cohomology
, 1996 It is well known that degree two Deligne cohomology groups can be identified with groups of isomorphism classes of holomorphic line bundles with connections. There is also a geometric description of degree three Deligne cohomology, due to J-L.
Gajer, Pawel
core +2 more sources