Homeomorphism between semi- spaces
K. K. Dube, R. K. Sengar (1980)
Matematički Vesnik
Similarity:
K. K. Dube, R. K. Sengar (1980)
Matematički Vesnik
Similarity:
S. P. Arya, M. P. Bhamini (1982)
Matematički Vesnik
Similarity:
M. Jelić (1982)
Matematički Vesnik
Similarity:
D. Andrijević (1984)
Matematički Vesnik
Similarity:
Richard Valent (1973)
Colloquium Mathematicae
Similarity:
Deepa Sinha, Pravin Garg (2011)
Discussiones Mathematicae Graph Theory
Similarity:
A signed graph (or sigraph in short) is an ordered pair , where is a graph G = (V,E), called the underlying graph of S and σ:E → +, - is a function from the edge set E of into the set +,-, called the signature of S. The ×-line sigraph of S denoted by is a sigraph defined on the line graph of the graph by assigning to each edge ef of , the product of signs of the adjacent edges e and f in S. In this paper, first we define semi-total line sigraph and semi-total point sigraph...
Vladimír Slezák (2001)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
In this paper the context of independent sets is assigned to the complete lattice (P(M),⊆) of all subsets of a non-empty set M. Some properties of this context, especially the irreducibility and the span, are investigated.
Emile Le Page, Marc Peigne (1994)
Publications mathématiques et informatique de Rennes
Similarity:
Kamila Kliś-Garlicka (2016)
Czechoslovak Mathematical Journal
Similarity:
The notion of a bilattice was introduced by Shulman. A bilattice is a subspace analogue for a lattice. In this work the definition of hyperreflexivity for bilattices is given and studied. We give some general results concerning this notion. To a given lattice we can construct the bilattice . Similarly, having a bilattice we may consider the lattice . In this paper we study the relationship between hyperreflexivity of subspace lattices and of their associated bilattices. Some examples...
Chaosheng Zhu (2015)
Annales Polonici Mathematici
Similarity:
This paper is concerned with the study of the large time behavior and especially the regularity of the global attractor for the semi-discrete in time Crank-Nicolson scheme to discretize the Benjamin-Bona-Mahony equation on ℝ¹. Firstly, we prove that this semi-discrete equation provides a discrete infinite-dimensional dynamical system in H¹(ℝ¹). Then we prove that this system possesses a global attractor in H¹(ℝ¹). In addition, we show that the global attractor is regular, i.e., ...
Leonid F. Barannyk (2010)
Colloquium Mathematicae
Similarity:
Let G be a finite group, K a field of characteristic p > 0, and the twisted group algebra of G over K with a 2-cocycle λ ∈ Z²(G,K*). We give necessary and sufficient conditions for to be of semi-wild representation type in the sense of Drozd. We also introduce the concept of projective K-representation type for a finite group (tame, semi-wild, purely semi-wild) and we exhibit finite groups of each type.
Mahdi Hormozi, Kijti Rodtes (2013)
Colloquium Mathematicae
Similarity:
We discuss the existence of an orthogonal basis consisting of decomposable vectors for all symmetry classes of tensors associated with semi-dihedral groups . In particular, a necessary and sufficient condition for the existence of such a basis associated with and degree two characters is given.
Michael Pinsker (2007)
Fundamenta Mathematicae
Similarity:
The clone lattice Cl(X) over an infinite set X is a complete algebraic lattice with compact elements. We show that every algebraic lattice with at most compact elements is a complete sublattice of Cl(X).