Results 11 to 20 of about 3,118,294 (254)
The Reidemeister graph is a complete knot invariant [PDF]
We describe two locally finite graphs naturally associated to each knot type K, called Reidemeister graphs. We determine several local and global properties of these graphs and prove that in one case the graph-isomorphism type is a complete knot invariant up to mirroring. Lastly, we introduce another object, relating the Reidemeister and Gordian graphs,
Barbensi, Agnese, Celoria, Daniele
openaire +6 more sources
A Compact and Complete AFMT Invariant with Application to Face Recognition [PDF]
In this paper, we present a complete set of hybrid similarity invariants under the Analytical Fourier-Mellin Transform (AFMT) framework, and apply it to invariant face recognition. Because the magnitude and phase spectra are not processed separately,
Yu, Hongchuan, Bennamoun, Mohammed
core +11 more sources
Complete graph invariant and algorithm of its computation
The relevance of the discussed issue is caused by the fact, that in graph theory, since the mid of the last century, all attempts to find the form of complete invariant and to develop the effective algorithm for it computation have been failed.
Andrey Pogrebnoy
doaj +3 more sources
The relevance of the research is caused by the unsolved problem of searching for the complete graph invariant and polynomial algorithm for its computing.
V. K. Pogrebnoy, A. V. Pogrebnoy
doaj +3 more sources
A Study on the Structure of Ideal-Based Non-Zero Divisor Graphs Associated with Zn [version 1; peer review: 2 approved] [PDF]
Background The study of algebraic structures through graph-theoretic representations provides a powerful visual and combinatorial framework for analyzing ring-theoretic properties. The ideal-based non-zero divisor graph ∅ I ( Z n ) , constructed from the
Ali Abd Aubad, Sameer Kadem
doaj +2 more sources
On a Class of Orthogonal-Invariant Quantum Spin Systems on the Complete Graph [PDF]
AbstractWe study a two-parameter family of quantum spin systems on the complete graph, which is the most general model invariant under the complex orthogonal group. In spin $S=\frac {1}{2}$ it is equivalent to the XXZ model, and in spin $S=1$ to the bilinear-biquadratic Heisenberg model.
openaire +3 more sources
Algorithms for computing normally hyperbolic invariant manifolds [PDF]
An effcient algorithm is developed for the numerical computation of normally hyperbolic invariant manifolds, based on the graph transform and Newton's method.
Vegter, G., +10 more
core +2 more sources
The invariant rings of the Sylow groups of GU(3,q2), GU(4,q2), Sp(4,q) and O+(4,q) in the natural characteristic [PDF]
Let G be a Sylow p -subgroup of the unitary groups GU(3,q2)GU(3,q2), GU(4,q2)GU(4,q2), the symplectic group Sp(4,q)Sp(4,q) and, for q odd, the orthogonal group O+(4,q)O+(4,q).
Fleischmann, Peter +2 more
core +1 more source
Rotationally invariant texture based features [PDF]
Content-based retrieval is ultimately dependent on the features used for the annotation of data and its efficiency is dependent on the invariance and robust properties of these features.
Hill, PR, Canagarajah, CN, Bull, DR
core +1 more source
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source

