A genus for N-dimensional knots and links.
A geometric approach to the almost convexity and growth of some nilpotent groups.
A geometric approach to universal quasigroup identities
In the present paper we construct the accompanying identity of a given quasigroup identity . After that we deduce the main result: is isotopically invariant (i.e., for every guasigroup it holds that if is satisfied in then is satisfied in every quasigroup isotopic to ) if and only if it is equivalent to (i.e., for every quasigroup it holds that in either are both satisfied or both not).
A Geometric Characterization of Moufang Hexagons.
A Geometric Construction of Janko's Group J... .
A geometric theory of hypergraph colouring.
A geometric version of the Kerov-Kirillov-Reshetikhin construction. (Une version géométrique de la construction de Kerov-Kirilov-Reshetikhin.)
A Gessel--Viennot-type method for cycle systems in a directed graph.
A graph and its complement with specified properties. I: Connectivity.
A graph and its complement with specified properties. III: Girth and circumference.
A graph associated to proper non-small ideals of a commutative ring
In this paper, a new kind of graph on a commutative ring is introduced and investigated. Small intersection graph of a ring , denoted by , is a graph with all non-small proper ideals of as vertices and two distinct vertices and are adjacent if and only if is not small in . In this article, some interrelation between the graph theoretic properties of this graph and some algebraic properties of rings are studied. We investigated the basic properties of the small intersection graph as diameter,...
A graph-based estimator of the number of clusters
Assessing the number of clusters of a statistical population is one of the essential issues of unsupervised learning. Given n independent observations X1,...,Xn drawn from an unknown multivariate probability density f, we propose a new approach to estimate the number of connected components, or clusters, of the t-level set . The basic idea is to form a rough skeleton of the set using any preliminary estimator of f, and to count the number of connected components of the resulting graph. Under...
A graphic generalization of arithmetic.
A graphical way to solve the Boolean matrix equations and
A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture.
A graph-theoretical representation of PL-manifolds - A survey on crystallizations.
A Group of Automorphisms of the Rooted Dyadic Tree and Associated Gelfand Pairs
A Hajós type result on factoring finite abelian groups by subsets. II
It is proved that if a finite abelian group is factored into a direct product of lacunary cyclic subsets, then at least one of the factors must be periodic. This result generalizes Hajós's factorization theorem.
A Hamiltonian cycle and a -factor in the fourth power of a graph
A Hamiltonian property of connected sets in the alternative set theory.