Results 11 to 20 of about 53,079 (211)
Galois Theory for Finite Algebras of Operations and Multioperations of Rank 2
The construction of Galois theory for the algebras of operations and relations is a popular topic for investigation. It finds numerous applications in both algebra and discrete mathematics – especially for the perfect Galois connection, since if such a ...
N.A. Peryazev
doaj +1 more source
Generation modulo the action of a permutation group [PDF]
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism.
Nicolas Borie
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diaz-Toca, G.M., Lombardi, H.
openaire +2 more sources
The Galois group of a stable homotopy theory [PDF]
To a "stable homotopy theory" (a presentable, symmetric monoidal stable $\infty$-category), we naturally associate a category of finite \'etale algebra objects and, using Grothendieck's categorical machine, a profinite group that we call the Galois group.
Mathew, Akhil
core +1 more source
SERRE WEIGHTS AND WILD RAMIFICATION IN TWO-DIMENSIONAL GALOIS REPRESENTATIONS
A generalization of Serre’s Conjecture asserts that if $F$ is a totally real field, then certain characteristic
LASSINA DEMBÉLÉ +2 more
doaj +1 more source
Galois theory for semiclones [PDF]
We present a Galois theory connecting finitary operations with pairs of finitary relations one of which is contained in the other. The Galois closed sets on both sides are characterised as locally closed subuniverses of the full iterative function ...
Behrisch, Mike
core +4 more sources
Cyclic Homology and Quantum Orbits [PDF]
A natural isomorphism between the cyclic object computing the relative cyclic homology of a homogeneous quotient-coalgebra-Galois extension, and the cyclic object computing the cyclic homology of a Galois coalgebra with SAYD coefficients is presented ...
Maszczyk, Tomasz, Sütlü, Serkan
core +1 more source
Introduction. Polynomials in several variables over Galois fields provide the basis for the Reed-Muller coding theory, and are also used in a number of cryptographic problems.
V. M. Deundyak, N. S. Mogilevskaya
doaj +1 more source
The theory of $p$-ramification, regarding the Galois group of the maximal pro-$p$-extension of a number field $K$, unramified outside $p$ and $\infty$, is well known including numerical experiments with PARI/GP programs.
Georges Gras
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

