Results 71 to 80 of about 1,175,834 (208)

Conics Through Inequivalent 5-Arcs in PG(2, 32)

open access: yesمجلة بغداد للعلوم
A k-arcs is usually defined to be a set of k points in the projective plane such that some lines meets K in two points. A conic is an irreducible plane quadric curve with six terms.
Zainab Abbas Khalaf   +1 more
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

FuzzyMind: A Web Platform for End‐to‐End Fuzzy Cognitive Map Modeling

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 14, July 2026.
ABSTRACT Fuzzy cognitive maps (FCMs) are widely used for modeling complex causal systems under uncertainty. However, the FCM development lifecycle, encompassing data preprocessing, model construction, weight optimization, and scenario analysis, is typically fragmented across heterogeneous tools.
Theodoros Tziolas, Elpiniki Papageorgiou
wiley   +1 more source

Galois Connections: Mathematics, Art, and Archives [PDF]

open access: yesElectronic Workshops in Computing, 2015
Evariste Galois (1811--1832) has been increasingly recognised as an important mathematician who despite his short life developed mathematical ideas that today have applications in computer science (such as Galois connections) and elsewhere. Some of Galois' mathematics can be visualised in interesting and even artistic ways, aided using software.
Jonathan P. Bowen, Tula Giannini
openaire   +2 more sources

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

Galois connecting call-by-value and call-by-name [PDF]

open access: yesLogical Methods in Computer Science
We establish a general framework for reasoning about the relationship between call-by-value and call-by-name. In languages with computational effects, call-by-value and call-by-name executions of programs often have different, but related, observable ...
Dylan McDermott, Alan Mycroft
doaj   +1 more source

On the fixed‐point proportion of self‐similar groups

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We prove that super strongly fractal groups acting on regular rooted trees have null fixed‐point proportion. In particular, we show that the fixed‐point proportion of an infinite family of iterated monodromy groups of exceptional complex polynomials has the same property.
Jorge Fariña‐Asategui, Santiago Radi
wiley   +1 more source

Some order dualities in logic, games and choices [PDF]

open access: yes
We first present the concept of duality appearing in order theory, i.e. the notions of dual isomorphism and of Galois connection. Then, we describe two fundamental dualities, the duality extension/intention associated with a binary relation between two ...
Bernard Monjardet
core  

Quasi‐convex surface subgroups in some one‐relator groups with torsion

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We find surface subgroups in certain one‐relator groups with torsion and use this to deduce a profinite criterion for a word in the free group to be primitive.
Andrew Ng
wiley   +1 more source

A Constructive Framework for Galois Connections

open access: yesCoRR, 2017
Abstract interpretation-based static analyses rely on abstract domains of program properties, such as intervals or congruences for integer variables. Galois connections (GCs) between posets provide the most widespread and useful formal tool for mathematically specifying abstract domains.
openaire   +2 more sources

Home - About - Disclaimer - Privacy