Results 61 to 70 of about 19,730 (191)

A Lattice-Theoretic Approach to Multigranulation Approximation Space

open access: yesThe Scientific World Journal, 2014
In this paper, we mainly investigate the equivalence between multigranulation approximation space and single-granulation approximation space from the lattice-theoretic viewpoint.
Xiaoli He, Yanhong She
doaj   +1 more source

Projective module description of the q-monopole

open access: yes, 1998
The Dirac q-monopole connection is used to compute projector matrices of quantum Hopf line bundles for arbitrary winding number. The Chern-Connes pairing of cyclic cohomology and K-theory is computed for the winding number -1.
Hajac, P. M., Majid, S.
core   +2 more sources

Intergenerational Communication in the Workplace Among Teaching Staff at Universities

open access: yesHigher Education Quarterly, Volume 80, Issue 1, January 2026.
ABSTRACT In organisations characterised by generational diversity, information and knowledge exchange present both challenges and opportunities. Managing intergenerational relationships among teaching staff at higher education institutions necessitates, among other efforts, a critical review of communication processes.
Trinidad Mentado‐Labao   +3 more
wiley   +1 more source

Hilbert Algebras with Hilbert-Galois Connections II

open access: yesBulletin of the Section of Logic
Hilbert algebra with a Hilbert-Galois connection, or HilGC-algebra, is a triple \(\left(A,f,g\right)\) where \(A\) is a Hilbert algebra, and \(f\) and \(g\) are unary maps on \(A\) such that \(f(a)\leq b\) iff \(a\leq g(b)\), and \(g(a\rightarrow b)\leq ...
Sergio A. Celani, Daniela Montagie
doaj   +1 more source

Study of MV-algebras via derivations

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019
The main goal of this paper is to give some representations of MV-algebras in terms of derivations. In this paper, we investigate some properties of implicative and difference derivations and give their characterizations in MV-algebras.
Wang Jun Tao, She Yan Hong, Qian Ting
doaj   +1 more source

A Galois-Connection between Myers-Briggs' Type Indicators and Szondi's Personality Profiles [PDF]

open access: yes, 2014
We propose a computable Galois-connection between Myers-Briggs' Type Indicators (MBTIs), the most widely-used personality measure for non-psychiatric populations (based on C.G.
Kramer, Simon
core  

Isomonodromic differential equations and differential categories

open access: yes, 2013
We study isomonodromicity of systems of parameterized linear differential equations and related conjugacy properties of linear differential algebraic groups by means of differential categories.
Gorchinskiy, Sergey, Ovchinnikov, Alexey
core   +1 more source

Tight Galois Connections and Complete Distributivity [PDF]

open access: yesTransactions of the American Mathematical Society, 1960
and discusses its relations with the property of complete distributivity in complete lattices. A procedure for constructing Galois connections between complete lattices is presented. The Galois connections constructed by this procedure are called tight Galois connections, and are characterized as those which satisfy certain identities.
openaire   +2 more sources

Equivariant v1,0⃗$v_{1,\vec{0}}$‐self maps

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.
Abstract Let G$G$ be a cyclic p$p$‐group or generalized quaternion group, X∈π0SG$X\in \pi _0 S_G$ be a virtual G$G$‐set, and V$V$ be a fixed point free complex G$G$‐representation. Under conditions depending on the sizes of G$G$, X$X$, and V$V$, we construct a self map v:ΣVC(X)(p)→C(X)(p)$v\colon \Sigma ^V C(X)_{(p)}\rightarrow C(X)_{(p)}$ on the ...
William Balderrama   +2 more
wiley   +1 more source

Algorithm for Obtaining Complete Irreducible Polynomials over Given Galois Field for New Method of Digital Monitoring of Information Space

open access: yesComputers
Irreducible polynomials are widely used in modern cryptography; however, algorithms for finding such polynomials remain quite complex and require significant computational resources.
Dina Shaltykova   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy