Results 41 to 50 of about 143,594 (316)

On isomorphism classes of generalized Fibonacci cubes

European Journal of Combinatorics, 2016
The generalized Fibonacci cube $Q_d(f)$ is the subgraph of the $d$-cube $Q_d$ induced on the set of all strings of length $d$ that do not contain $f$ as a substring. It is proved that if $Q_d(f) \cong Q_d(f')$ then $|f|=|f'|$. The key tool to prove this result is a result of Guibas and Odlyzko about the autocorrelation polynomial associated to a binary
Jernej Azarija, Sandi Klavzar, Jaehun Lee, Jay Pantone, Yoomi Rho   +4 more
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

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

The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length [PDF]

, 2004
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable ...
Calvert, Wesley
core   +3 more sources

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

ON GROUPS WITH TWO ISOMORPHISM CLASSES OF DERIVED SUBGROUPS [PDF]

Glasgow Mathematical Journal, 2013
AbstractThe structure of groups which have at most two isomorphism classes of derived subgroups ($\mathfrak{D}$2-groups) is investigated. A complete description of $\mathfrak{D}$2-groups is obtained in the case where the derived subgroup is finite: the solution leads an interesting number theoretic problem. In addition, detailed information is obtained
LONGOBARDI, Patrizia, MAJ, Mercede, Derek J. S. Robinson, Howard Smith   +3 more
openaire   +3 more sources

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

Quantized reduction as a tensor product

, 2000
Symplectic reduction is reinterpreted as the composition of arrows in the category of integrable Poisson manifolds, whose arrows are isomorphism classes of dual pairs, with symplectic groupoids as units. Morita equivalence of Poisson manifolds amounts to
A Cannas, A Connes, A Connes, A Connes, A Coste, A Haefliger, A Ramsay, A Ramsay, A Wassermann, A Weinstein, A Weinstein, A Weinstein, A Weinstein, A Weinstein, C Faith, CC Moore, D Blecher, D Kazhdan, EC Lance, GW Mackey, I Moerdijk, I Raeburn, I Vaisman, J Feldman, J Mrcun, J Mrcun, J Renault, J Renault, J Schweizer, J-L Sauvageot, K Mikami, KCH Mackenzie, KCH Mackenzie, KCH Mackenzie, LG Brown, M Baillet, M Hilsum, MA Rieffel, MA Rieffel, MV Karasev, MV Karasev, MV Karasev, NP Landsman, NP Landsman, NP Landsman, P Dazord, P Gabriel, P Hahn, P Laan van der, P Libermann, P Muhly, P Xu, P Xu, P Xu, PS Muhly, R Abraham, RV Kadison, RV Kadison, S Lane Mac, S Zakrzewski, W Beer, WL Paschke   +61 more
core   +1 more source

Isomorphism classes of cycle permutation graphs

Discrete Mathematics, 1992
G. Chartrand and F. Harary introduced permutation graphs as a generalization of the well-known Petersen graph. The authors construct a cycle permutation graph as a covering graph over the dumbbell graph. They also give a new characterization of the case when two given cycle permutation graphs are isomorphic by a positive or a negative natural ...
KWAK, JH, LEE, J
openaire   +2 more sources

Homomorphic Preimages of Geometric Paths

Discussiones Mathematicae Graph Theory, 2018
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A geometric graph Ḡ is a simple graph G together with a straight line drawing of G in the plane with the vertices in
Cockburn Sally
doaj   +1 more source