Results 1 to 10 of about 565 (128)
The Singular Value Decomposition over Completed Idempotent Semifields [PDF]
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value Decomposition for rectangular matrices over complete idempotent semifields (i-SVD).
Francisco J. Valverde-Albacete +1 more
doaj +2 more sources
The Rényi Entropies Operate in Positive Semifields [PDF]
We set out to demonstrate that the Rényi entropies are better thought of as operating in a type of non-linear semiring called a positive semifield.
Francisco J. Valverde-Albacete +1 more
doaj +2 more sources
Semifields from skew polynomial rings [PDF]
Abstract Skew polynomial rings are used to construct finite semifields, following from a construction of Ore and Jacobson of associative division algebras. Johnson and Jha [10] constructed the so-called cyclic semifields, obtained using irreducible semilinear transformations.
Michel Lavrauw, John Sheekey
openalex +5 more sources
The nuclei and other properties of p‐primitive semifield planes [PDF]
Publisher Summary This chapter present a study of the class of semifield planes of order p4 and kernel GF(p2) with the property that they admit a p-primitive Baer collineation; these are called “p-primitive semifield planes.”This is the class of planes obtained when the construction method of Hiramine, Matsumoto, and Oyama is applied to the ...
Minerva Cordero
openalex +2 more sources
Convexity via Weak Distributive Laws [PDF]
We study the canonical weak distributive law $\delta$ of the powerset monad over the semimodule monad for a certain class of semirings containing, in particular, positive semifields.
Filippo Bonchi, Alessio Santamaria
doaj +1 more source
Four-Fold Formal Concept Analysis Based on Complete Idempotent Semifields
Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lattice and Order Theory, that has several extensions to, e.g., fuzzy and idempotent semirings.
Francisco José Valverde-Albacete +1 more
doaj +1 more source
Algebraic Solution of Tropical Polynomial Optimization Problems
We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with idempotent addition and invertible multiplication).
Nikolai Krivulin
doaj +1 more source
A partition \(\Omega = \{A_1, \dots, A_K\}\), of \(\mathrm{GF}(p^n)\) (regarded as a \(\mathrm{GF}(p)\)-vector space) into \(K\) subsets is called a \textit{bent partition} of \textit{depth} \(K\), if every function \(f : \mathrm{GF}(p^n)\to \mathrm{GF}(p)\) for which the following property holds, is a bent function: The preimage set of any element \(c\
Nurdagül Anbar +2 more
openaire +4 more sources
We consider a decision-making problem to evaluate absolute ratings of alternatives from the results of their pairwise comparisons according to two criteria, subject to constraints on the ratings.
Nikolai Krivulin
doaj +1 more source

